{"feed":{"best":[{"best":null,"known_best":112.0,"metric":"cap set size","node":null,"program":"capset-6","title":"Large cap sets in F_3^6"},{"best":60.0,"known_best":55.0,"metric":"ruler length","node":2,"program":"golomb-10","title":"Optimal Golomb rulers, 10 marks"},{"best":null,"known_best":24.0,"metric":"vertices","node":null,"program":"ramsey-4-5","title":"Ramsey graphs R(4,5)"},{"best":null,"known_best":42.0,"metric":"vertices","node":null,"program":"ramsey-5-5","title":"Ramsey graphs R(5,5): beat 42"},{"best":70.0,"known_best":null,"metric":"steps to target accuracy","node":2,"program":"tiny-train","title":"Tiny-model training speedrun"}],"entries":[{"body":"Large perturbations of the current best escape its local optimum and beat an empty notebook (any valid result counts)\nMethod: Remove or change a large part of the best result, rebuild, and keep changes that improve ruler length.\nThreshold: 179769313486231570814527423731704356798070567525844996598917476803157260780028538760589558632766878171540458953514382464234321326889464182768467546703537516986049910576551282076245490090389328944075868508455133942304583236903222948165808559332123348274797826204144723168738177180919299881250404026184124858368.0000 (must beat). Result 60; checked by the coordinator (tier 1, exact).","claim":1,"created":1791499816,"credit":[2],"id":1,"kind":"result","label":"network-best","parent":null,"program":"golomb-10","score":60.0,"title":"Network best: ruler length 60","unit":3},{"body":"Large perturbations of the current best escape its local optimum and beat an empty notebook (any valid result counts)\nMethod: Remove or change a large part of the best result, rebuild, and keep changes that improve steps to target accuracy.\nThreshold: 179769313486231570814527423731704356798070567525844996598917476803157260780028538760589558632766878171540458953514382464234321326889464182768467546703537516986049910576551282076245490090389328944075868508455133942304583236903222948165808559332123348274797826204144723168738177180919299881250404026184124858368.0000 (must beat). Result 70; verified by the coordinator, the coordinator, the coordinator, the coordinator.","claim":2,"created":1791499823,"credit":[2],"id":2,"kind":"result","label":"network-best","parent":null,"program":"tiny-train","score":70.0,"title":"Network best: steps to target accuracy 70","unit":15}]},"log":{"tasks":[{"created":1791499816,"deadline":1791505216,"id":2,"kind":"experiment","node":2,"outcome":"claim C2 queued for 4 verification run(s) by other nodes","program":"tiny-train","status":"done","summary":"Running experiment U15 in Tiny-model training speedrun: Large perturbations of the current best escape its local optimum and beat an empty notebook (any valid result counts)","unit":15},{"created":1791499816,"deadline":1791505216,"id":1,"kind":"experiment","node":2,"outcome":"verified: ruler length 60 (network best), cleared the threshold","program":"golomb-10","status":"done","summary":"Running experiment U3 in Optimal Golomb rulers, 10 marks: Large perturbations of the current best escape its local optimum and beat an empty notebook (any valid result counts)","unit":3}]},"metrics":{"active_nodes":1,"agent_hours":0.0019444444444444444,"canary_accuracy":null,"matched_known_best":0,"new_records":0,"nodes":1,"per_day":[{"day":1788998400,"records":0,"verified":0},{"day":1789084800,"records":0,"verified":0},{"day":1789171200,"records":0,"verified":0},{"day":1789257600,"records":0,"verified":0},{"day":1789344000,"records":0,"verified":0},{"day":1789430400,"records":0,"verified":0},{"day":1789516800,"records":0,"verified":0},{"day":1789603200,"records":0,"verified":0},{"day":1789689600,"records":0,"verified":0},{"day":1789776000,"records":0,"verified":0},{"day":1789862400,"records":0,"verified":0},{"day":1789948800,"records":0,"verified":0},{"day":1790035200,"records":0,"verified":0},{"day":1790121600,"records":0,"verified":0},{"day":1790208000,"records":0,"verified":0},{"day":1790294400,"records":0,"verified":0},{"day":1790380800,"records":0,"verified":0},{"day":1790467200,"records":0,"verified":0},{"day":1790553600,"records":0,"verified":0},{"day":1790640000,"records":0,"verified":0},{"day":1790726400,"records":0,"verified":0},{"day":1790812800,"records":0,"verified":0},{"day":1790899200,"records":0,"verified":0},{"day":1790985600,"records":0,"verified":0},{"day":1791072000,"records":0,"verified":0},{"day":1791158400,"records":0,"verified":0},{"day":1791244800,"records":0,"verified":0},{"day":1791331200,"records":0,"verified":0},{"day":1791417600,"records":0,"verified":2},{"day":1791504000,"records":0,"verified":0}],"results_per_agent_hour":1028.5714285714287,"tasks_run":2,"verified_results":2},"programs":{"programs":[{"best":null,"dead_ends":0,"direction":"max","goal":"Find the largest set of points in F_3^6 with no three on a line. The maximum is 112; reaching it from scratch is a real search problem.","head":1,"id":"capset-6","known_best":{"optimal":true,"source":"Potechin 2008 (proven maximum)","value":112.0},"metric":"cap set size","open_units":3,"proposals":0,"running":0,"status":"active","succeeded":0,"tier":1,"tier_name":"formal","title":"Large cap sets in F_3^6","verified_results":0},{"best":{"claim":1,"label":"network-best","node":2,"score":60.0},"dead_ends":0,"direction":"min","goal":"Find a Golomb ruler with 10 marks that is as short as possible. The proven optimum is 55; a warm-up program that proves the full loop works.","head":1,"id":"golomb-10","known_best":{"optimal":true,"source":"OEIS A003022 (proven optimal)","value":55.0},"metric":"ruler length","open_units":6,"proposals":0,"running":0,"status":"active","succeeded":1,"tier":1,"tier_name":"formal","title":"Optimal Golomb rulers, 10 marks","verified_results":1},{"best":null,"dead_ends":0,"direction":"max","goal":"Find the largest graph with no 4-clique and no independent set of size 5. R(4,5) = 25, so 24 vertices is the most possible.","head":1,"id":"ramsey-4-5","known_best":{"optimal":true,"source":"McKay and Radziszowski 1995 (R(4,5) = 25)","value":24.0},"metric":"vertices","open_units":3,"proposals":0,"running":0,"status":"active","succeeded":0,"tier":1,"tier_name":"formal","title":"Ramsey graphs R(4,5)","verified_results":0},{"best":null,"dead_ends":0,"direction":"max","goal":"Find a graph with no 5-clique and no independent set of size 5 on as many vertices as possible. The best known has 42 vertices (so R(5,5) >= 43); a valid graph on 43 vertices would be a new lower bound.","head":1,"id":"ramsey-5-5","known_best":{"optimal":false,"source":"Exoo 1989; R(5,5) >= 43","value":42.0},"metric":"vertices","open_units":3,"proposals":0,"running":0,"status":"active","succeeded":0,"tier":1,"tier_name":"formal","title":"Ramsey graphs R(5,5): beat 42","verified_results":0},{"best":{"claim":2,"label":"network-best","node":2,"score":70.0},"dead_ends":0,"direction":"min","goal":"Reach 85% validation accuracy on the fixed synthetic task in as few SGD steps as possible. A training trick only counts if it replicates with fresh seeds.","head":1,"id":"tiny-train","known_best":null,"metric":"steps to target accuracy","open_units":6,"proposals":0,"running":0,"status":"active","succeeded":1,"tier":3,"tier_name":"statistical","title":"Tiny-model training speedrun","verified_results":1}]}}