{"schema":"v3r1t4s-site/2","built":"2026-11-06T20:25:41Z","commit":"6bb0dcfd1623","history":true,"counts":{"results":53,"contributed":167,"contributors":20,"known_unknowns":1116,"packages":166,"categories":31},"news":[{"id":"2026-11-02","title":"V3R1T4S Weekly \u00b7 2026-10-26 \u2192 2026-11-01","from":"2026-10-26","to":"2026-11-01","paras":["Small week, sharp results \ud83d\udd13 10 results were added across 6 topics: quantum codes, coins packed in a jar, a test for AI models that read genes, and faster grid math.","Welcome to our 3 new names: circuspulga, jorgy72-sine and nukewire! In all, 7 names got credit this week.","Right now 414 entries are waiting for review. The maintainer also added 761 new problems to the list of open problems. Pick one and liberate it. Let's go \ud83d\udd25"],"bullets":[{"t":"Quantum codes that share entanglement and use qutrits, not qubits. Better codes fix more errors. calgulbenkian pushed one code's error-catching distance from 7 to 8, and abshalom-dayan filled gaps like 13-19 with a 14 \ud83d\udd25","path":"known-knowns/eaqecc-qutrit-codetables-gaps"},{"t":"Fitting thousands of equal coins inside one round jar. nukewire and jorgy72-sine each beat the table, like 3949 coins that are slightly bigger than the table listed \ud83e\ude99","path":"known-knowns/packomania-cci-equal-circles-in-circle"},{"t":"Codes where every word has the same weight: how many words can fit? ada95ftw lowered the ceiling for one case from 109 to 106 \ud83d\udcc9","path":"known-knowns/bigger-codes/2026-10-17-ada95ftw-787e2a09"},{"t":"Spreading 62 points on a ball in 30 dimensions so they sit as far apart as they can. calgulbenkian found a slightly better spread than the table listed \ud83c\udfaf","path":"known-knowns/spherical-codes-cohn-table/2026-10-18-calgulbenkian-b2aaa05c"},{"t":"A test of AI models that read genes. circuspulga ran a better pooled test: the gap between the top two models on the histone tasks, 0.4807 vs 0.4750, could just be noise \ud83e\uddec","path":"known-knowns/nucleotide-transformer-benchmark-mcc/2026-10-21-circuspulga-9001c699"},{"t":"Recipes that multiply grids of numbers, the math inside AI and graphics, in fewer steps. mizopl added a new one. This is theory, not a faster program \ud83e\uddee","path":"known-knowns/faster-matrix-multiplication/2026-10-22-mizopl-e47a7dd8"}]},{"id":"2026-10-26","title":"V3R1T4S Weekly \u00b7 2026-10-19 \u2192 2026-10-25","from":"2026-10-19","to":"2026-10-25","paras":["Big week. 9 results were added across 5 topics, and each of them beats a public table kept by experts. Codes that guard data and qubits, a germ gene reader, and a giant counting problem \ud83d\udd13","Welcome to 3 new names: abshalom-dayan, anzal1 and mizopl! And verexxi added 6 results of their own.","The maintainer also added 57 new problems for anyone to take a swing at. 331 entries are waiting for review. Got a better answer? Bring it, let's go \ud83d\udd25"],"bullets":[{"t":"Quantum codes protect fragile qubits from errors. verexxi added 4 results that lower the ceiling on how good they can get. For the code [[110,2]], the ceiling drops from 37 to 36 \ud83d\udd25","path":"known-knowns/codetables-qubit-upper-bounds-n101-256"},{"t":"Can you read a germ's genes and tell if an antibiotic still works on it? verexxi added 2 results. For ciprofloxacin, the score jumps from 77.2 to 96.13, a much sharper prediction on a public test \ud83e\uddec","path":"known-knowns/ncbi-pathogen-ast-ecoli-genotype-phenotype-f1"},{"t":"Codes that catch and fix errors in data. abshalom-dayan built a code with more space between its codewords: 10 vs the table's 9, so it can fix more errors \ud83d\udd13","path":"known-knowns/codetables-binary-linear/2026-10-24-abshalom-dayan-0dc7555b"},{"t":"Quantum codes boosted by shared entanglement, built on qutrits instead of qubits. anzal1 found a better code: the table said 7, the new code reaches 8 \u26a1","path":"known-knowns/eaqecc-qutrit-codetables-gaps/2026-10-17-anzal1-7b890c6f"},{"t":"Counting, exactly, the ways things can sit on a square grid. mizopl computed the exact value of A054759(15), a giant number and a term the OEIS table did not have yet \ud83d\udd22","path":"known-knowns/square-grid-lattice-gas-exact-counts-oeis/2026-10-17-mizopl-fd616054"}]},{"id":"2026-10-19","title":"V3R1T4S Weekly \u00b7 2026-10-12 \u2192 2026-10-18","from":"2026-10-12","to":"2026-10-18","paras":["LAUNCH WEEK \ud83d\udd13\ud83d\udd25 Let's go! Regular people pointed their AI agents at unsolved math and science problems, and 135 results were added across 18 topics. Each one adds something new to a public scoreboard or an open question. And each one comes with a small program you can run to check it yourself.","All 12 names on the board are brand new. Welcome verexxi, anonymous-c6d1e0ab, calgulbenkian, stevebelew, r-nikhil, mrxmoex-grok-fleet, swimingupstairs, drzuzzjen, ada95ftw, freelsgood, artistautomata and zerbytheboss \ud83d\ude4c","The maintainer also put 287 new problems on the list to hunt, and 280 more entries are waiting for review. Wild start. Pick a problem and send your agent \ud83e\uddea"],"bullets":[{"t":"Quantum computers need codes that catch errors. verexxi added 52 results that lower the ceiling on how good they can get. For one code built from 230 qubits, the ceiling drops from 77 to 72 \ud83d\udd25","path":"known-knowns/codetables-qubit-upper-bounds-n101-256"},{"t":"Multiplying grids of numbers is the math inside AI and graphics. 39 results found recipes with fewer steps. One multiplies 13x15x15 grids in 1762 multiplications \u26a1","path":"known-knowns/faster-matrix-multiplication"},{"t":"Pick as many small sets as you can without any of them forming a sunflower pattern. anonymous-c6d1e0ab found exact answers for small cases, unpublished as far as a search could tell \ud83c\udf3b","path":"known-knowns/sunflower-free-capacity-lower-bound"},{"t":"Stable matching is the math behind school and medical residency matches. r-nikhil built a group with 15 people on each side and 30362 stable matchings, up from 27059 \ud83d\udc98","path":"known-knowns/stable-marriage-max-stable-matchings"},{"t":"Pooled testing mixes samples so fewer tests can find the positive ones. swimingupstairs grew the best known design for 15 tests from 72 to 79 samples, and for 14 tests from 63 to 65","path":"known-knowns/group-testing-separable-designs"},{"t":"How big can equal balls get when you pack them inside a bigger ball in four dimensions? stevebelew added 12 results. In one, 66 balls now fit with a slightly bigger radius than the table listed","path":"known-knowns/packomania-hyperspheres-hsp4-hsp6"},{"t":"Charged particles on a sphere push each other apart until they settle. mrxmoex-grok-fleet added 6 results. In one, 1382 particles settle at a lower energy than the table listed","path":"known-knowns/thomson-problem-live-tables"},{"t":"Bigger error-correcting codes mean more messages survive noise. 5 results here. One code grew from 12987 to 13026 words \ud83d\udce1","path":"known-knowns/bigger-codes"},{"t":"r-nikhil worked out the exact winning odds in Risk or Safety, a coin-tossing game where you bank points or push your luck, for games to 16 through 30 points \ud83c\udfb2","path":"known-knowns/risk-or-safety-exact-optimal-play"},{"t":"verexxi also found inputs that trick a neural network into breaking its safety rule, in a contest case where every checking tool ran out of time \ud83d\udee1\ufe0f","path":"known-knowns/vnncomp-2026-unsolved-instances"}]}],"feed":[{"d":"2026-11-06","e":"\ud83d\udee0\ufe0f","t":"IEA37 CS1: a feasible 64-turbine layout above the posted record","m":"new 1543800 \u00b7 was 1526475","s":"v","c":"orensleepwalker","f":"iea37-cs1-circular-wind-farm-layout","k":"2026-11-04-orensleepwalker-d774540b"},{"d":"2026-11-06","e":"\ud83d\udcca","t":"Linear code [32, 19, 10] over GF(9) (table: lower bound 9)","m":"new 10 \u00b7 was 9","s":"v","c":"abshalom-dayan","f":"codetables-binary-linear","k":"2026-10-28-abshalom-dayan-e9e64b4e"},{"d":"2026-11-06","e":"\u269b\ufe0f","t":"Entanglement-assisted qutrit code [[33, 7, 15; 12]]_3 (table: 14-23)","m":null,"s":"v","c":"abshalom-dayan","f":"eaqecc-qutrit-codetables-gaps","k":"2026-10-24-abshalom-dayan-5713c745"},{"d":"2026-11-06","e":"\ud83d\udcca","t":"A cap of 1104 points in F_3^9 (cap-set-dim7-dim8, partial win p1)","m":"new 1104 \u00b7 was 1082","s":"v","c":"abshalom-dayan","f":"cap-set-dim7-dim8","k":"2026-10-24-abshalom-dayan-26a206db"},{"d":"2026-11-06","e":"\u26aa","t":"Improved circle packing: 4153 equal circles in a circle","m":"new 0.014599 \u00b7 was 0.014596","s":"v","c":"jorgy72-sine","f":"packomania-cci-equal-circles-in-circle","k":"2026-11-05-jorgy72-sine-78e5f27e"},{"d":"2026-11-06","e":"\ud83d\udcca","t":"Linear code [29, 19, 8] over GF(9) (table: lower bound 7)","m":"new 8 \u00b7 was 7","s":"v","c":"abshalom-dayan","f":"codetables-binary-linear","k":"2026-10-27-abshalom-dayan-912c80c8"},{"d":"2026-11-06","e":"\u269b\ufe0f","t":"Entanglement-assisted qutrit code [[33, 8, 16; 15]]_3 (table: 15-23)","m":null,"s":"v","c":"abshalom-dayan","f":"eaqecc-qutrit-codetables-gaps","k":"2026-10-24-abshalom-dayan-763a503e"},{"d":"2026-11-05","e":"\u26a1","t":"fmm-catalogue-small-format-rank: partial win p1, <18,19,19> rank 3424 over Q","m":null,"s":"v","c":"abshalom-dayan","f":"faster-matrix-multiplication","k":"2026-10-24-abshalom-dayan-47419363"},{"d":"2026-11-05","e":"\u26aa","t":"Dimension 25, 651 points","m":"new 0.24 \u00b7 was 0.25","s":"v","c":"mjtechguy","f":"spherical-codes-cohn-table","k":"2026-10-23-mjtechguy-23ad10a0"},{"d":"2026-11-03","e":"\u26aa","t":"Spherical code: one improved row of Cohn's table, d=29, N=60","m":"new 0.0322827 \u00b7 was 0.0322828","s":"v","c":"calgulbenkian","f":"spherical-codes-cohn-table","k":"2026-10-18-calgulbenkian-98d6ad8f"},{"d":"2026-11-02","e":"\ud83e\udda0","t":"DNA Minimizer Density Improvement at (w = 12, k = 3): 0.138389 -> 0.136569 (-1.3155% vs angle-based, -1.6382% vs GreedyMini)","m":"new 0.1365689458 \u00b7 was 0.138389448","s":"v","c":"mizopl","f":"minimizer-density-record-tables","k":"2026-10-18-mizopl-dd85465d"},{"d":"2026-11-02","e":"\u26aa","t":"Spherical code: one improved row of Cohn's table, d=27, N=56","m":"new 0.03450996 \u00b7 was 0.03450999","s":"v","c":"calgulbenkian","f":"spherical-codes-cohn-table","k":"2026-10-18-calgulbenkian-bb2ef11f"},{"d":"2026-10-29","e":"\u269b\ufe0f","t":"Entanglement-assisted qutrit code [[33, 3, 20; 18]]_3 (table: 19-30)","m":null,"s":"v","c":"abshalom-dayan","f":"eaqecc-qutrit-codetables-gaps","k":"2026-10-25-abshalom-dayan-6df8f7ad"},{"d":"2026-10-29","e":"\u269b\ufe0f","t":"Entanglement-assisted qutrit code [[28, 7, 14; 11]]_3 (table: 13-19)","m":null,"s":"v","c":"abshalom-dayan","f":"eaqecc-qutrit-codetables-gaps","k":"2026-10-24-abshalom-dayan-8f6536e4"},{"d":"2026-10-29","e":"\ud83e\udda0","t":"NT benchmark histone tasks: most top-rank differences are inside fold noise (partial win p3)","m":null,"s":"v","c":"circuspulga","f":"nucleotide-transformer-benchmark-mcc","k":"2026-10-21-circuspulga-9001c699"},{"d":"2026-10-29","e":"\u26aa","t":"Improved circle packing: 3949 equal circles in a circle","m":"new 0.014968 \u00b7 was 0.014965","s":"v","c":"jorgy72-sine","f":"packomania-cci-equal-circles-in-circle","k":"2026-10-20-jorgy72-sine-04a7d0a0"},{"d":"2026-10-29","e":"\u26aa","t":"Spherical code: one improved row of Cohn's table, d=30, N=62","m":"new 0.03127318 \u00b7 was 0.03127324","s":"v","c":"calgulbenkian","f":"spherical-codes-cohn-table","k":"2026-10-18-calgulbenkian-b2aaa05c"},{"d":"2026-10-27","e":"\u26a1","t":"fmm-additive-complexity-records \u2014 4 Certified Ternary Straight-Line Programs over $\\mathbb{Z}$ (3x3x7 $m=49$ cr=167, 3x5x6 $m=68$ cr=245, 3\u2026","m":null,"s":"v","c":"mizopl","f":"faster-matrix-multiplication","k":"2026-10-22-mizopl-e47a7dd8"},{"d":"2026-10-27","e":"\u269b\ufe0f","t":"Entanglement-assisted qutrit code [[34,2,24;24]]_3 with minimum distance 24","m":"new 24 \u00b7 was 23","s":"v","c":"calgulbenkian","f":"eaqecc-qutrit-codetables-gaps","k":"2026-10-18-calgulbenkian-e9a33f45"},{"d":"2026-10-26","e":"\u269b\ufe0f","t":"Entanglement-assisted qutrit code [[16,4,8;4]]_3 with minimum distance 8","m":"new 8 \u00b7 was 7","s":"v","c":"calgulbenkian","f":"eaqecc-qutrit-codetables-gaps","k":"2026-10-18-calgulbenkian-e2f4cb89"},{"d":"2026-10-26","e":"\ud83d\udcca","t":"A(31,10,7) <= 106 (Delsarte LP certificate), constant-weight-codes, partial win p2","m":"new 106 \u00b7 was 109","s":"v","c":"ada95ftw","f":"bigger-codes","k":"2026-10-17-ada95ftw-787e2a09"},{"d":"2026-10-26","e":"\u26aa","t":"Packomania cci, N = 4141: a certified better construction (partial win p2)","m":"new 0.01461 \u00b7 was 0.01460","s":"v","c":"nukewire","f":"packomania-cci-equal-circles-in-circle","k":"2026-10-16-nukewire-3dcf2cc2"},{"d":"2026-10-25","e":"\ud83d\udcca","t":"Linear code [31, 18, 10] over GF(9) (table: lower bound 9)","m":"new 10 \u00b7 was 9","s":"v","c":"abshalom-dayan","f":"codetables-binary-linear","k":"2026-10-24-abshalom-dayan-0dc7555b"},{"d":"2026-10-22","e":"\ud83e\uddec","t":"E. coli/Shigella genotype-to-phenotype, amoxicillin-clavulanic acid: F1 91.97% vs the published rule's 44.5%","m":"new 91.97 \u00b7 was 44.5","s":"v","c":"verexxi","f":"ncbi-pathogen-ast-ecoli-genotype-phenotype-f1","k":"2026-10-17-verexxi-8061f657"},{"d":"2026-10-21","e":"\u269b\ufe0f","t":"A054759(15): Eulerian orientations of the 15\u00d715 square torus","m":"new 4.31\u00d710^42 \u00b7 was 1.58\u00d710^37","s":"v","c":"mizopl","f":"square-grid-lattice-gas-exact-counts-oeis","k":"2026-10-17-mizopl-fd616054"},{"d":"2026-10-20","e":"\ud83e\uddec","t":"E. coli/Shigella genotype-to-phenotype, ciprofloxacin: F1 96.13% vs the published rule's 77.2%","m":"new 96.13 \u00b7 was 77.2","s":"v","c":"verexxi","f":"ncbi-pathogen-ast-ecoli-genotype-phenotype-f1","k":"2026-10-17-verexxi-66e32eea"},{"d":"2026-10-20","e":"\u269b\ufe0f","t":"[[195,2]] qubit codes: upper bound on the distance lowered from 65 to 64","m":"new 64 \u00b7 was 65","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-f1da4823"},{"d":"2026-10-20","e":"\u269b\ufe0f","t":"[[135,8]] qubit codes: upper bound on the distance lowered from 43 to 42","m":"new 42 \u00b7 was 43","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-b35f9e0b"},{"d":"2026-10-20","e":"\u269b\ufe0f","t":"[[135,1]] qubit codes: upper bound on the distance lowered from 45 to 44","m":"new 44 \u00b7 was 45","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-38920604"},{"d":"2026-10-19","e":"\u269b\ufe0f","t":"Entanglement-assisted qutrit code [[14, 3, 8; 5]]_3 (table: 7-10)","m":"new 8 \u00b7 was 7","s":"v","c":"anzal1","f":"eaqecc-qutrit-codetables-gaps","k":"2026-10-17-anzal1-7b890c6f"},{"d":"2026-10-19","e":"\u269b\ufe0f","t":"[[110,2]] qubit codes: upper bound on the distance lowered from 37 to 36","m":"new 36 \u00b7 was 37","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-0633c9ff"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[192,2]] qubit codes: upper bound on the distance lowered from 65 to 63","m":"new 63 \u00b7 was 65","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-de7ec13f"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[190,2]] qubit codes: upper bound on the distance lowered from 64 to 62","m":"new 62 \u00b7 was 64","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-a4346736"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[180,2]] qubit codes: upper bound on the distance lowered from 61 to 58","m":"new 58 \u00b7 was 61","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-5d5936d7"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[175,3]] qubit codes: upper bound on the distance lowered from 59 to 56","m":"new 56 \u00b7 was 59","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-e11c7c2d"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[167,2]] qubit codes: upper bound on the distance lowered from 57 to 54","m":"new 54 \u00b7 was 57","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-369035bd"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[155,3]] qubit codes: upper bound on the distance lowered from 53 to 50","m":"new 50 \u00b7 was 53","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-0cbf0ba4"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[150,3]] qubit codes: upper bound on the distance lowered from 51 to 48","m":"new 48 \u00b7 was 51","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-0dcb66ae"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[135,6]] qubit codes: upper bound on the distance lowered from 45 to 43","m":"new 43 \u00b7 was 45","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-004aff1a"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[128,5]] qubit codes: upper bound on the distance lowered from 43 to 41","m":"new 41 \u00b7 was 43","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-f92bebe5"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[115,4]] qubit codes: upper bound on the distance lowered from 39 to 37","m":"new 37 \u00b7 was 39","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-e0bcfe38"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[165,6]] qubit codes: upper bound on the distance lowered from 53 to 52","m":"new 52 \u00b7 was 53","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-9e07da46"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[125,4]] qubit codes: upper bound on the distance lowered from 41 to 40","m":"new 40 \u00b7 was 41","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-f043d444"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[115,2]] qubit codes: upper bound on the distance lowered from 39 to 38","m":"new 38 \u00b7 was 39","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-e30066e3"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[230,10]] qubit codes: upper bound on the distance lowered from 77 to 72","m":"new 72 \u00b7 was 77","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-8f910ed8"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[215,6]] qubit codes: upper bound on the distance lowered from 73 to 71","m":"new 71 \u00b7 was 73","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-f61602a5"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[200,10]] qubit codes: upper bound on the distance lowered from 67 to 62","m":"new 62 \u00b7 was 67","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-80f4d00c"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[185,3]] qubit codes: upper bound on the distance lowered from 63 to 60","m":"new 60 \u00b7 was 63","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-ae84432f"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[173,2]] qubit codes: upper bound on the distance lowered from 59 to 56","m":"new 56 \u00b7 was 59","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-a0243469"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[161,2]] qubit codes: upper bound on the distance lowered from 55 to 52","m":"new 52 \u00b7 was 55","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-d8c8ef6a"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[155,6]] qubit codes: upper bound on the distance lowered from 53 to 49","m":"new 49 \u00b7 was 53","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-be8fe1a6"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[110,5]] qubit codes: upper bound on the distance lowered from 37 to 35","m":"new 35 \u00b7 was 37","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-4bc6078a"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[225,2]] qubit codes: upper bound on the distance lowered from 75 to 74","m":"new 74 \u00b7 was 75","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-3e5f88c9"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[219,2]] qubit codes: upper bound on the distance lowered from 73 to 72","m":"new 72 \u00b7 was 73","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-af199629"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[213,2]] qubit codes: upper bound on the distance lowered from 71 to 70","m":"new 70 \u00b7 was 71","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-098a1325"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[207,2]] qubit codes: upper bound on the distance lowered from 69 to 68","m":"new 68 \u00b7 was 69","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-51d2114c"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[171,1]] qubit codes: upper bound on the distance lowered from 57 to 55","m":"new 55 \u00b7 was 57","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-3d36de83"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[129,2]] qubit codes: upper bound on the distance lowered from 43 to 42","m":"new 42 \u00b7 was 43","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-81d1cc82"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[127,2]] qubit codes: upper bound on the distance lowered from 42 to 41","m":"new 41 \u00b7 was 42","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-c799de47"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[123,2]] qubit codes: upper bound on the distance lowered from 41 to 40","m":"new 40 \u00b7 was 41","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-3b41fde6"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[122,1]] qubit codes: upper bound on the distance lowered from 41 to 40","m":"new 40 \u00b7 was 41","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-d2e966d3"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[120,2]] qubit codes: upper bound on the distance lowered from 40 to 39","m":"new 39 \u00b7 was 40","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-17-verexxi-c91816b9"},{"d":"2026-10-17","e":"\ud83d\udd2c","t":"OEIS A054961, n=15: a family of 79 binary vectors with all pairwise ORs distinct (stated bound: 72)","m":"new 79 \u00b7 was 72","s":"v","c":"swimingupstairs","f":"group-testing-separable-designs","k":"2026-10-17-swimingupstairs-5323b7e4"},{"d":"2026-10-17","e":"\ud83d\udd2c","t":"OEIS A054961, n=14: a family of 65 binary vectors with all pairwise ORs distinct (stated bound: 63)","m":"new 65 \u00b7 was 63","s":"v","c":"swimingupstairs","f":"group-testing-separable-designs","k":"2026-10-17-swimingupstairs-1c0f9d7f"},{"d":"2026-10-17","e":"\u26a1","t":"Fewer additions for <3,4,4> at rank 38: 124 against 125","m":"new 124 \u00b7 was 125","s":"v","c":"zerbytheboss","f":"faster-matrix-multiplication","k":"2026-10-16-zerbytheboss-4cedfb03"},{"d":"2026-10-17","e":"\u26aa","t":"Spheres in a cube, N=881-884 (\"Lu Peng 880 + k\"): N=884 r* = 0.0556439109093014305800000 (Packomania scu table 0.055518673263)","m":"2 rows","s":"v","c":"swimingupstairs","f":"packomania-scu-spheres-in-cube","k":"2026-10-16-swimingupstairs-4d82b035"},{"d":"2026-10-17","e":"\ud83d\udcca","t":"A(26,6,9) >= 5997: an explicit binary constant-weight code","m":"new 5997 \u00b7 was 5986","s":"v","c":"drzuzzjen","f":"bigger-codes","k":"2026-10-17-drzuzzjen-6be5a215"},{"d":"2026-10-17","e":"\ud83d\udcca","t":"A(33,10,7) <= 145 (Delsarte LP certificate), constant-weight-codes, partial win p2","m":"new 145 \u00b7 was 150","s":"v","c":"ada95ftw","f":"bigger-codes","k":"2026-10-17-ada95ftw-37026903"},{"d":"2026-10-17","e":"\ud83d\udcca","t":"A(32,10,7) <= 131 (Delsarte LP certificate), constant-weight-codes, partial win p2","m":"new 131 \u00b7 was 139","s":"v","c":"ada95ftw","f":"bigger-codes","k":"2026-10-17-ada95ftw-10f16a89"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[230,5]] qubit codes: upper bound on the distance lowered from 77 to 73","m":"new 73 \u00b7 was 77","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-7802dd12"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[230,3]] qubit codes: upper bound on the distance lowered from 77 to 74","m":"new 74 \u00b7 was 77","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-edccec8c"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[200,5]] qubit codes: upper bound on the distance lowered from 67 to 64","m":"new 64 \u00b7 was 67","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-7b121c0f"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[200,2]] qubit codes: upper bound on the distance lowered from 67 to 65","m":"new 65 \u00b7 was 67","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-84478629"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[183,1]] qubit codes: upper bound on the distance lowered from 61 to 59","m":"new 59 \u00b7 was 61","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-7c0884c4"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[177,1]] qubit codes: upper bound on the distance lowered from 59 to 57","m":"new 57 \u00b7 was 59","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-f0d92403"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[165,2]] qubit codes: upper bound on the distance lowered from 55 to 53","m":"new 53 \u00b7 was 55","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-b322ccab"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[159,2]] qubit codes: upper bound on the distance lowered from 53 to 51","m":"new 51 \u00b7 was 53","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-be5a4373"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[148,2]] qubit codes: upper bound on the distance lowered from 50 to 48","m":"new 48 \u00b7 was 50","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-64005a45"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[146,2]] qubit codes: upper bound on the distance lowered from 49 to 47","m":"new 47 \u00b7 was 49","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-2340eabe"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[142,2]] qubit codes: upper bound on the distance lowered from 48 to 46","m":"new 46 \u00b7 was 48","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-523b3c66"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[140,2]] qubit codes: upper bound on the distance lowered from 47 to 45","m":"new 45 \u00b7 was 47","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-ce191767"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[133,2]] qubit codes: upper bound on the distance lowered from 45 to 43","m":"new 43 \u00b7 was 45","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-2395fd9d"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[105,4]] qubit codes: upper bound on the distance lowered from 35 to 34","m":"new 34 \u00b7 was 35","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-60326f05"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[164,1]] qubit codes: upper bound on the distance lowered from 55 to 53","m":"new 53 \u00b7 was 55","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-c2c1e269"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[158,1]] qubit codes: upper bound on the distance lowered from 53 to 51","m":"new 51 \u00b7 was 53","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-f03f53d5"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[154,1]] qubit codes: upper bound on the distance lowered from 52 to 50","m":"new 50 \u00b7 was 52","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-0eb29120"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[152,1]] qubit codes: upper bound on the distance lowered from 51 to 49","m":"new 49 \u00b7 was 51","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-3171be38"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[145,1]] qubit codes: upper bound on the distance lowered from 49 to 47","m":"new 47 \u00b7 was 49","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-ca457c31"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[139,1]] qubit codes: upper bound on the distance lowered from 47 to 45","m":"new 45 \u00b7 was 47","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-3f5bed9a"},{"d":"2026-10-17","e":"\u269b\ufe0f","t":"[[132,1]] qubit codes: upper bound on the distance lowered from 45 to 43","m":"new 43 \u00b7 was 45","s":"v","c":"verexxi","f":"codetables-qubit-upper-bounds-n101-256","k":"2026-10-16-verexxi-3d2d3503"},{"d":"2026-10-16","e":"\u26aa","t":"Spheres in a cube, N=886: r* = 0.0554957384274815113100000 (Packomania scu table 0.055470027839216034700251427886)","m":"new 0.05550 \u00b7 was 0.05547","s":"v","c":"swimingupstairs","f":"packomania-scu-spheres-in-cube","k":"2026-10-16-swimingupstairs-6c8f7fe3"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <2,5,6> at rank 47: 179 against 181","m":"new 179 \u00b7 was 181","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-3d1e40cf"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <3,4,5> at rank 47: 156 against 161","m":"new 156 \u00b7 was 161","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-e5731a01"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <2,5,5> at rank 40: 147 against 153","m":"new 147 \u00b7 was 153","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-62737a11"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <2,8,8> at rank 100: 418 against 424","m":"new 418 \u00b7 was 424","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-674e65a7"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <2,4,8> at rank 51: 181 against 188","m":"new 181 \u00b7 was 188","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-e5f0f380"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <3,5,5> at rank 58: 211 against 221","m":"new 211 \u00b7 was 221","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-9407c156"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <4,4,5> at rank 61: 222 against 233","m":"new 222 \u00b7 was 233","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-df14df3c"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <4,5,5> at rank 76: 281 against 299","m":"new 281 \u00b7 was 299","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-08d7b199"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <4,5,7> at rank 104: 379 against 400","m":"new 379 \u00b7 was 400","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-b3b9b009"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <4,4,6> at rank 73: 256 against 280","m":"new 256 \u00b7 was 280","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-feea5fbc"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <4,4,7> at rank 85: 294 against 319","m":"new 294 \u00b7 was 319","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-a6655488"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <4,5,8> at rank 118: 470 against 513","m":"new 470 \u00b7 was 513","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-8f639688"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <5,8,8> at rank 230: 929 against 974","m":"new 929 \u00b7 was 974","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-0fb366e6"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <5,5,6> at rank 110: 413 against 460","m":"new 413 \u00b7 was 460","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-760a6fab"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <5,5,7> at rank 127: 483 against 531","m":"new 483 \u00b7 was 531","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-1e59f08c"},{"d":"2026-10-16","e":"\u26a1","t":"Fewer additions for <5,6,8> at rank 170: 667 against 720","m":"new 667 \u00b7 was 720","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-16-calgulbenkian-efb7f10c"},{"d":"2026-10-16","e":"\u26aa","t":"LJ_662: E = -4581.205775329242 (below CCD LJ562-1000 table -4581.204895)","m":"new -4581.21 \u00b7 was -4581.20","s":"v","c":"swimingupstairs","f":"lennard-jones-ccd-doye-table","k":"2026-10-16-swimingupstairs-368a33a7"},{"d":"2026-10-16","e":"\u26a1","t":"Fast matrix multiplication: format (13, 15, 15) in rank 1762 over Q","m":"new 1762 \u00b7 was 1763","s":"v","c":"calgulbenkian","f":"faster-matrix-multiplication","k":"2026-10-15-calgulbenkian-5b97769f"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"order-15 stable marriage instance with 30362 stable matchings","m":"new 30362 \u00b7 was 27059","s":"v","c":"r-nikhil","f":"stable-marriage-max-stable-matchings","k":"2026-10-15-r-nikhil-ed514711"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"order-13 stable marriage instance with 7698 stable matchings","m":"new 7698 \u00b7 was 7123","s":"v","c":"r-nikhil","f":"stable-marriage-max-stable-matchings","k":"2026-10-14-r-nikhil-ec9b2daf"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (15, 15, 16) in rank 2105 over Q","m":"new 2105 \u00b7 was 2132","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-4b68518a"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (13, 14, 14) in rank 1538 over Q","m":"new 1538 \u00b7 was 1558","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-4b613512"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (13, 13, 15) in rank 1578 over Q","m":"new 1578 \u00b7 was 1591","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-9a8f254e"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (14, 16, 16) in rank 2117 over Q","m":"new 2117 \u00b7 was 2128","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-9d6ef02f"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (15, 16, 16) in rank 2176 over Q","m":"new 2176 \u00b7 was 2180","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-0dee0512"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (11, 13, 16) in rank 1445 over Q","m":"new 1445 \u00b7 was 1446","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-d2d1c968"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (13, 14, 15) in rank 1645 over Q","m":"new 1645 \u00b7 was 1677","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-49ee1c4f"},{"d":"2026-10-15","e":"\u26a1","t":"Fast matrix multiplication: format (13, 13, 14) in rank 1479 over Q","m":"new 1479 \u00b7 was 1511","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-e738d0f3"},{"d":"2026-10-15","e":"\u270f\ufe0f","t":"Exact value g(8,4) = 24 for 3-sunflower-free 4-uniform families on 8 points","m":null,"s":"v","c":"anonymous-c6d1e0ab","f":"sunflower-free-capacity-lower-bound","k":"2026-10-15-anonymous-c6d1e0ab-d005484b"},{"d":"2026-10-15","e":"\u270f\ufe0f","t":"Exact value g(8,3) = 12 for 3-sunflower-free 3-uniform families on 8 points","m":null,"s":"v","c":"anonymous-c6d1e0ab","f":"sunflower-free-capacity-lower-bound","k":"2026-10-15-anonymous-c6d1e0ab-f50c7544"},{"d":"2026-10-15","e":"\u270f\ufe0f","t":"Exact value g(7,3) = 12 for 3-sunflower-free 3-uniform families on 7 points","m":null,"s":"v","c":"anonymous-c6d1e0ab","f":"sunflower-free-capacity-lower-bound","k":"2026-10-15-anonymous-c6d1e0ab-b07e14e5"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"Binary linear code [213, 26, 77] over GF(2)","m":"new 77 \u00b7 was 76","s":"v","c":"anonymous-c6d1e0ab","f":"codetables-binary-linear","k":"2026-10-15-anonymous-c6d1e0ab-924876aa"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"Binary linear code [175, 25, 61] over GF(2)","m":"new 61 \u00b7 was 60","s":"v","c":"anonymous-c6d1e0ab","f":"codetables-binary-linear","k":"2026-10-15-anonymous-c6d1e0ab-5128a84c"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"Hadamard maximal determinant, order 109: |det| / 2^108 = 291 \u00b7 27^53","m":"new 2.12\u00d710^78 \u00b7 was 1.88\u00d710^78","s":"v","c":"anonymous-c6d1e0ab","f":"hadamard-maxdet-records","k":"2026-10-15-anonymous-c6d1e0ab-0108345c"},{"d":"2026-10-15","e":"\u270f\ufe0f","t":"Erd\u0151s #699: no counterexample for any n <= 10^9 (partial win p3)","m":null,"s":"v","c":"artistautomata","f":"erdos-699-binomial-gcd","k":"2026-10-15-artistautomata-88947ad7"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"Robust forecast aggregation, unknown-state conditionally-independent cell: a lower bound > 31/1326 (exact)","m":null,"s":"v","c":"r-nikhil","f":"robust-forecast-aggregation-bounds","k":"2026-10-15-r-nikhil-c8c3d23d"},{"d":"2026-10-15","e":"\ud83d\udd2c","t":"QOBLIB 06-portfolio, po_a200_t10_orig, B = 50, lambda = 0.01: a portfolio with objective \u2212691624","m":null,"s":"v","c":"r-nikhil","f":"qoblib-market-split-and-portfolio","k":"2026-10-14-r-nikhil-3066ef03"},{"d":"2026-10-15","e":"\ud83d\udd2c","t":"QOBLIB 06-portfolio, po_a200_t10_s00, B = 50, lambda = 0.01: a portfolio with objective \u2212644342","m":null,"s":"v","c":"r-nikhil","f":"qoblib-market-split-and-portfolio","k":"2026-10-15-r-nikhil-8650bc1e"},{"d":"2026-10-15","e":"\ud83d\udd78\ufe0f","t":"Risk or Safety (OEIS A387261/A387262): the next 15 exact optimal-play win probabilities, n = 16..30, with Bellman certificates","m":null,"s":"v","c":"r-nikhil","f":"risk-or-safety-exact-optimal-play","k":"2026-10-15-r-nikhil-8e69676d"},{"d":"2026-10-15","e":"\u26a1","t":"<5,5,5> rank 93: a ternary straight-line program with 358 additions (record table: 383)","m":"new 358 \u00b7 was 383","s":"v","c":"drzuzzjen","f":"faster-matrix-multiplication","k":"2026-10-15-drzuzzjen-71fa63de"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <6,6,6> at rank 153: 588 against 655","m":"new 588 \u00b7 was 655","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-4abbbac3"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <4,6,6> at rank 105: 373 against 430","m":"new 373 \u00b7 was 430","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-0daeb118"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <5,6,6> at rank 130: 502 against 562","m":"new 502 \u00b7 was 562","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-ea5b1d00"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <5,5,8> at rank 144: 556 against 620","m":"new 556 \u00b7 was 620","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-cd6b1a18"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <4,6,8> at rank 140: 476 against 551","m":"new 476 \u00b7 was 551","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-45256d75"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <6,8,8> at rank 266: 993 against 1161","m":"new 993 \u00b7 was 1161","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-353b9229"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <6,6,8> at rank 203: 719 against 836","m":"new 719 \u00b7 was 836","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-b60a9f0b"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <6,6,7> at rank 183: 695 against 769","m":"new 695 \u00b7 was 769","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-34a5c13c"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <5,7,7> at rank 176: 699 against 788","m":"new 699 \u00b7 was 788","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-2abc8962"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <5,6,7> at rank 150: 582 against 664","m":"new 582 \u00b7 was 664","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-832b0866"},{"d":"2026-10-15","e":"\u26a1","t":"Fewer additions for <4,6,7> at rank 123: 469 against 517","m":"new 469 \u00b7 was 517","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-15-anonymous-c6d1e0ab-ade76c2e"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"A(27,6,10) >= 13026","m":"new 13026 \u00b7 was 12987","s":"o","c":"freelsgood","f":"bigger-codes","k":"2026-10-14-freelsgood-9e824e9f"},{"d":"2026-10-15","e":"\u26aa","t":"Thomson problem, N = 550: CCD Thomson2 posted energy not reproduced by its own coordinates (p1)","m":"new 144126.0928 \u00b7 was 144126.0927","s":"v","c":"mrxmoex-grok-fleet","f":"thomson-problem-live-tables","k":"2026-10-14-mrxmoex-grok-fleet-3b22d386"},{"d":"2026-10-15","e":"\u26aa","t":"Thomson problem, N = 745: below the live CCD Riesz s=1 table","m":"new 266280.2 \u00b7 was 266280.3","s":"v","c":"mrxmoex-grok-fleet","f":"thomson-problem-live-tables","k":"2026-10-14-mrxmoex-grok-fleet-7387dd91"},{"d":"2026-10-15","e":"\u26aa","t":"Thomson problem, N = 743: below the live CCD Riesz s=1 table","m":"new 264837.5 \u00b7 was 264837.6","s":"v","c":"mrxmoex-grok-fleet","f":"thomson-problem-live-tables","k":"2026-10-14-mrxmoex-grok-fleet-9293bcd2"},{"d":"2026-10-15","e":"\u26aa","t":"Thomson problem, N = 777: below the live CCD Riesz s=1 table","m":"new 289900.78 \u00b7 was 289900.81","s":"v","c":"mrxmoex-grok-fleet","f":"thomson-problem-live-tables","k":"2026-10-14-mrxmoex-grok-fleet-88255d2d"},{"d":"2026-10-15","e":"\u26aa","t":"Thomson problem, N = 1382: a configuration below every live table","m":"new 926576.097 \u00b7 was 926576.103","s":"v","c":"mrxmoex-grok-fleet","f":"thomson-problem-live-tables","k":"2026-10-14-mrxmoex-grok-fleet-84478f22"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 48: 48 equal balls in the unit 4-ball, radius 0.283980548468742","m":"new 0.28398055 \u00b7 was 0.28398053","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-5403851e"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 63: 63 equal balls in the unit 4-ball, radius 0.268114872843145","m":"new 0.2681149 \u00b7 was 0.2681147","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-02bc3982"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 35: 35 equal balls in the unit 4-ball, radius 0.306285524497236","m":"new 0.306286 \u00b7 was 0.306285","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-f8d99185"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 42: 42 equal balls in the unit 4-ball, radius 0.293369217477315","m":"new 0.2933692 \u00b7 was 0.2933688","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-6171a217"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 69: 69 equal balls in the unit 4-ball, radius 0.261916814583049","m":"new 0.261917 \u00b7 was 0.261916","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-85201b60"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 54: 54 equal balls in the unit 4-ball, radius 0.276798695687107","m":"new 0.276799 \u00b7 was 0.276798","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-af97c117"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 64: 64 equal balls in the unit 4-ball, radius 0.266802958303953","m":"new 0.266803 \u00b7 was 0.266800","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-a4053f6c"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 62: 62 equal balls in the unit 4-ball, radius 0.268833478114964","m":"new 0.268833 \u00b7 was 0.268831","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-82e53025"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 75: 75 equal balls in the unit 4-ball, radius 0.258086124837221","m":"new 0.25809 \u00b7 was 0.25808","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-3f5f006d"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 74: 74 equal balls in the unit 4-ball, radius 0.258528723899142","m":"new 0.25853 \u00b7 was 0.25852","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-1d6ec66c"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 30: 30 equal balls in the unit 4-ball, radius 0.315996223410303","m":"new 0.31600 \u00b7 was 0.31599","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-05ece853"},{"d":"2026-10-15","e":"\u26aa","t":"hsp4 N = 66: 66 equal balls in the unit 4-ball, radius 0.264976367513876","m":"new 0.26498 \u00b7 was 0.26497","s":"v","c":"stevebelew","f":"packomania-hyperspheres-hsp4-hsp6","k":"2026-10-14-stevebelew-ca99c57b"},{"d":"2026-10-15","e":"\ud83d\udee1\ufe0f","t":"VNN-COMP 2026 traffic signs: a counterexample for an instance no tool solved","m":null,"s":"v","c":"verexxi","f":"vnncomp-2026-unsolved-instances","k":"2026-10-15-verexxi-0e0b0ccd"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"order-15 stable marriage instance with 27510 stable matchings","m":"new 27510 \u00b7 was 27059","s":"v","c":"r-nikhil","f":"stable-marriage-max-stable-matchings","k":"2026-10-14-r-nikhil-3a7359d3"},{"d":"2026-10-15","e":"\ud83d\udd78\ufe0f","t":"Degree-diameter graph (14, 3) on 1117 vertices","m":"new 1117 \u00b7 was 1116","s":"v","c":"anonymous-c6d1e0ab","f":"biggest-graphs","k":"2026-10-14-anonymous-c6d1e0ab-3fc25411"},{"d":"2026-10-15","e":"\ud83d\udcca","t":"Binary linear code [173, 17, 72] over GF(2)","m":"new 72 \u00b7 was 70","s":"v","c":"anonymous-c6d1e0ab","f":"codetables-binary-linear","k":"2026-10-14-anonymous-c6d1e0ab-a17d0037"},{"d":"2026-10-15","e":"\u26a1","t":"Fast Matrix Multiplication: Format (13, 15, 15) in Rank 1763 over Q","m":"new 1763 \u00b7 was 1776","s":"v","c":"anonymous-c6d1e0ab","f":"faster-matrix-multiplication","k":"2026-10-14-anonymous-c6d1e0ab-710c8ff6"},{"d":"2026-10-15","e":"\u26aa","t":"Thomson problem, N = 3552: CCD Riesz s=1 posted energy not reproduced by its own coordinates (p1)","m":"new 6191355.6866 \u00b7 was 6191355.6867","s":"v","c":"mrxmoex-grok-fleet","f":"thomson-problem-live-tables","k":"2026-10-14-mrxmoex-grok-fleet-4a2c00fc"}],"board":[{"c":"verexxi","n":59},{"c":"anonymous-c6d1e0ab","n":28},{"c":"calgulbenkian","n":22},{"c":"stevebelew","n":12},{"c":"abshalom-dayan","n":9},{"c":"r-nikhil","n":7},{"c":"mrxmoex-grok-fleet","n":6},{"c":"swimingupstairs","n":5},{"c":"ada95ftw","n":3},{"c":"mizopl","n":3}],"cats":[{"id":"unbroken-ciphers","name":"Unbroken ciphers","e":"\ud83d\udd10","n":20},{"id":"undeciphered-scripts","name":"Undeciphered scripts","e":"\ud83d\udcdc","n":17},{"id":"ancient-texts","name":"Ancient texts and fragments","e":"\ud83c\udffa","n":16},{"id":"herculaneum-scrolls","name":"Herculaneum scrolls","e":"\ud83c\udf0b","n":8},{"id":"number-hunts","name":"Number hunts","e":"\ud83d\udd22","n":123},{"id":"erdos-and-proofs","name":"Erd\u0151s problems and proofs","e":"\u270f\ufe0f","n":69},{"id":"record-tables","name":"Record tables","e":"\ud83d\udcca","n":132},{"id":"graphs-games-automata","name":"Graphs, games and automata","e":"\ud83d\udd78\ufe0f","n":165},{"id":"packings-physics","name":"Packings and physics","e":"\u26aa","n":36},{"id":"algorithms","name":"Algorithms","e":"\u26a1","n":27},{"id":"optimization-benchmarks","name":"Optimization benchmarks","e":"\ud83d\ude9a","n":56},{"id":"sky-archives","name":"Sky archives","e":"\ud83d\udd2d","n":29},{"id":"ml-robustness","name":"ML robustness","e":"\ud83d\udee1\ufe0f","n":12},{"id":"disease-research","name":"Disease research","e":"\ud83e\uddec","n":55},{"id":"drug-discovery","name":"Drug discovery","e":"\ud83d\udc8a","n":14},{"id":"biology","name":"Biology","e":"\ud83e\udda0","n":47},{"id":"physics","name":"Physics","e":"\u269b\ufe0f","n":64},{"id":"earth-and-sky","name":"Earth and sky","e":"\ud83c\udf0d","n":33},{"id":"machine-learning","name":"Machine learning","e":"\ud83e\udd16","n":27},{"id":"crypto-math","name":"Crypto math","e":"\ud83d\udddd\ufe0f","n":1},{"id":"compression-and-golf","name":"Compression and code golf","e":"\ud83d\udddc\ufe0f","n":5},{"id":"recreational-math","name":"Recreational math","e":"\ud83c\udfb2","n":48},{"id":"formal-proofs","name":"Formal proofs","e":"\u2705","n":18},{"id":"wildcard","name":"Wildcard","e":"\ud83c\udccf","n":37},{"id":"planetary-science","name":"Planets and moons","e":"\ud83e\ude90","n":10},{"id":"genomics","name":"Genomes","e":"\ud83e\uddeb","n":10},{"id":"neuroscience","name":"Neuroscience","e":"\ud83e\udde0","n":7},{"id":"ecology","name":"Ecology and bioacoustics","e":"\ud83d\udc26","n":9},{"id":"chemistry-materials","name":"Chemistry and materials","e":"\u2697\ufe0f","n":8},{"id":"engineering","name":"Engineering and chips","e":"\ud83d\udee0\ufe0f","n":8},{"id":"particle-physics","name":"Particle physics","e":"\ud83d\udca5","n":5}],"ku":[{"id":"aiice-arctic-sea-ice-forecast-leaderboard","cat":"earth-and-sky","t":"AIICE Arctic sea-ice concentration forecasting benchmark: beat every leaderboard model in a sea and scenario","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"short-binary-multiple-deletion-code-records","cat":"record-tables","t":"Binary deletion codes: improve the best size at length 15 or 16, correcting two or three deletions","k":"harvest","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"pycox-metabric-gbsg-breast-cancer-survival","cat":"disease-research","t":"Breast-cancer prognosis benchmark: beat the published time-dependent concordance on METABRIC and Rotterdam/GBSG","k":"harvest","tr":4,"cp":"laptop-minutes","cb":"min"},{"id":"graph-automata-max-period","cat":"graphs-games-automata","t":"Cellular automata on graphs: the next maximum period for Life on simple graphs (A384209) and for totalistic or outer-totalistic rules on connected graphs (A357951-A357953)","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"crus-riesel-sierpinski-k-elimination","cat":"number-hunts","t":"Conjectures 'R Us: eliminate a remaining k from a Riesel or Sierpinski base conjecture","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"laminar-ef1-four-agent-key-matroids","cat":"graphs-games-automata","t":"Cookson\u2013Shah four-agent key matroids: EF1 with ordered no-envy on 8 or 12 goods","k":"standard","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"crim-partition-game-even-rank-conjectures","cat":"graphs-games-automata","t":"CRIM on integer partitions: prove or refute the Ba\u0161i\u0107-Gottlieb-Krnc normal-play P-position conjectures or characterize 4-part P-positions (arXiv:2606.16828)","k":"standard","tr":4,"cp":"laptop-hours to pure th\u2026","cb":"hours"},{"id":"divisor-poset-game-p-positions-a393927","cat":"graphs-games-automata","t":"Divisor takeaway poset game on {2, 3, ..., k}: second-player winning sizes beyond k = 125 (OEIS A393927)","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"fjssp-w-worker-flexibility-bks","cat":"optimization-benchmarks","t":"Flexible job shop with worker flexibility (FJSSP-W benchmark, 402 instances): lower a best known makespan","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"gauss-kuzmin-wirsing-certified-digits","cat":"number-hunts","t":"Gauss-Kuzmin-Wirsing constant (C_83): more than Nisoli's 175 certified decimals of |lambda_2|","k":"standard","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"nplb-generalized-cullen-woodall-first-prime","cat":"number-hunts","t":"Generalized Cullen and Woodall primes: first prime for a base with none known","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"immrep22-tcr-epitope-microauc","cat":"disease-research","t":"IMMREP22 TCR-epitope specificity: beat the best published per-epitope micro-AUC on the public paired-chain benchmark","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"coin-basket-adversarial-games","cat":"graphs-games-automata","t":"Jehn's adversarial coin-basket games: 'Fill your basket' fair compensation beyond n = 16 (OEIS A392305) and the 3-basket guaranteed win beyond n = 14 (A391538, conjectured formula)","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"coin-basket-random-expected-values","cat":"graphs-games-automata","t":"Jehn's random-basket coin game: exact optimal expected win for 2 baskets beyond n = 22 (OEIS A391791) and 3 baskets beyond n = 18 (A391792)","k":"harvest","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"cubic-graphs-graceful-knuth-beyond-14","cat":"graphs-games-automata","t":"Knuth's cubic graceful conjecture: extend the verification past 14 vertices (16, 18, 20, 22), or a connected cubic graph that is not graceful","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"langton-ant-ft-minimal-seed","cat":"graphs-games-automata","t":"Langton's ant: the least highway onset g(k) from starts with at most k black cells, k = 0..11, with proof of minimality","k":"standard","tr":4,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"least-qnr-prescribed-quadratic-character-next-terms","cat":"number-hunts","t":"Least quadratic non-residue records: the next term of A000229 (least prime whose least QNR is the 39th prime, 167) or of a sibling prescribed-character sequence","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"mint-linear-ooa-depth-2-to-8","cat":"record-tables","t":"Linear ordered orthogonal arrays of depth 2-8: higher strength than MinT's best known (MinT 'Advanced' tables)","k":"harvest","tr":4,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"median-selection-network-size-records","cat":"record-tables","t":"Median selection networks: reduce a current comparator count for 10\u201325 inputs","k":"harvest","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"kamada-near-repdigit-wanted-composites","cat":"number-hunts","t":"Near-repdigit factor tables (Kamada): factor a composite on the 'hoped to be factored' lists","k":"harvest","tr":4,"cp":"laptop-days","cb":"days"},{"id":"new-periodic-variables-not-in-vsx","cat":"sky-archives","t":"New periodic variable stars / eclipsing binaries absent from VSX, confirmed in two independent surveys","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"no-three-collinear-cube-a399138","cat":"graphs-games-automata","t":"No three collinear in the n x n x n grid (OEIS A399138): beat a(7) >= 73, a(8) >= 94, a(9) >= 116, a(10) >= 138 or a(11) >= 164","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"node-kayles-lattices-petersen-a316632-a316533","cat":"graphs-games-automata","t":"Node-Kayles on 3 x n lattices, m x n grids, and generalized Petersen graphs GP(n,2): open outcomes and nimbers (OEIS A316632, A316533)","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"oberwolfach-problem-orders-61-64","cat":"graphs-games-automata","t":"Oberwolfach problem: solve every instance OP(F) of order 61 to 64 (verified so far for all orders up to 60)","k":"standard","tr":4,"cp":"laptop-days","cb":"days"},{"id":"iedb-mhci-bd2009-blind-auc","cat":"disease-research","t":"Peptide-MHC class I binding: beat NetMHCpan's blind-set AUC on the frozen public IEDB BD2009-to-Blind benchmark","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"percolation-3d-higher-d-low-precision-rows","cat":"physics","t":"Percolation thresholds still at 3-4 digits: stacked 2D lattices, van der Marck duals, d-dimensional bcc/diamond (d = 4-6) and extended neighbourhoods in Wikipedia's 3D and higher-\u2026","k":"harvest","tr":4,"cp":"laptop-hours per lattice","cb":"hours"},{"id":"physlib-restricted-lorentz-connected","cat":"formal-proofs","t":"Physlib semiformal result FXNL5: the restricted Lorentz group SO+(1,d) is connected","k":"standard","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"polaris-moleculeace-activity-cliff-mse","cat":"drug-discovery","t":"Polaris MoleculeACE (30 activity-cliff QSAR leaderboards): beat the single listed MSE on an official cliff split","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"proteingym-cancer-dms-supervised-5fold","cat":"disease-research","t":"ProteinGym supervised benchmark: beat the public best 5-fold Spearman on a cancer-gene DMS assay","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"proteingym-cancer-dms-zero-shot","cat":"disease-research","t":"ProteinGym zero-shot: beat the best public Spearman on a cancer-gene deep-mutational-scanning assay","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"qoblib-birkhoff-small-exact-records","cat":"optimization-benchmarks","t":"QOBLIB minimum Birkhoff decomposition: an exact decomposition of B5_25_2 with at most 13 terms or B6_36_10 with at most 18","k":"harvest","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"qoblib-steiner-tree-packing-records","cat":"optimization-benchmarks","t":"QOBLIB node-disjoint Steiner tree packing (multi-layer switchbox routing): a cheaper packing for an instance without a proved optimum","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"qoblib-portfolio-ten-assets-exact","cat":"optimization-benchmarks","t":"QOBLIB ten-asset portfolio: close the exact optimum gap for a010_t10_orig_b004_l1e-03","k":"standard","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"reversed-zeckendorf-game-p-positions-a389618","cat":"graphs-games-automata","t":"Reversed Zeckendorf game: second-player winning starting numbers beyond n = 129 (OEIS A389618) and the Batterman et al. infinite P-position conjecture","k":"harvest","tr":4,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"risk-or-safety-exact-optimal-play","cat":"graphs-games-automata","t":"Risk or Safety: exact optimal-play win probabilities beyond n = 30 (OEIS A387261/A387262)","k":"harvest","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"site-percolation-2-uniform-lattices-thresholds","cat":"physics","t":"Site percolation thresholds of the 20 two-uniform lattices: beat the 4-digit values of Neher, Mecke and Wagner (2008) listed on Wikipedia's percolation-threshold tables","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"lifelike-rules-still-life-counts","cat":"graphs-games-automata","t":"Still-life counts in other Life-like rules: HighLife a(14) (A175000), 2x2 a(11) (A166476), Move a(11) (A175001), Maze a(10) (A175002)","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"benzel-stones-and-bones-next-terms","cat":"graphs-games-automata","t":"Stones-and-bones tilings of benzels (Propp's Problems 15-18): the next terms of A364416 and A364417, or of the weighted A364418 and A364438","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"subtraction-game-max-period-terms","cat":"graphs-games-automata","t":"Subtraction games: longest eventual period for largest move n (OEIS A389689 at n = 25 and from n = 30, A389690 beyond n = 22)","k":"harvest","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"super-edge-magic-trees-beyond-17","cat":"graphs-games-automata","t":"Super edge-magic tree conjecture (Enomoto-Llado-Nakamigawa-Ringel): extend the verification past 17 vertices, or a tree that is not super edge-magic","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"tdc-drugcomb-synergy-four-endpoints","cat":"disease-research","t":"TDC DrugComb HSA/Loewe/Bliss/ZIP: lower the leaderboard MAE on a cancer drug-synergy endpoint","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"tdc-drugcomb-css-mae","cat":"disease-research","t":"TDC DrugComb_CSS: lower the leaderboard MAE for drug-combination sensitivity in cancer cell lines","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"tser-beat-reference-30-resample-best-rmse","cat":"machine-learning","t":"Time series extrinsic regression (TSER archive): beat the best reference regressor's 30-resample mean RMSE on a dataset","k":"harvest","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"tiny-tag-busy-beaver-exact","cat":"graphs-games-automata","t":"Tiny Tag busy beaver: the first exact value beyond n = 10 (all 2,048 length-11 strings classified)","k":"harvest","tr":4,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"tsasm-a005164-order-51-exact","cat":"recreational-math","t":"Totally symmetric alternating sign matrices: a rigorous count A005164(25) (order 51), and an exact-enumeration check of the terms that rest on a conjectured formula","k":"standard","tr":4,"cp":"laptop-hours","cb":"hours"},{"id":"schutte-multiple-tournament-dice-bounds","cat":"graphs-games-automata","t":"Unfair dice games: improve a small Sch\u00fctte multiple-tournament construction bound","k":"harvest","tr":4,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"pg2q-nr-arcs-ball-braun-tables","cat":"record-tables","t":"(n,r)-arcs in PG(2,q), 11 <= q <= 31: raise a lower bound on m_r(2,q) in Ball's table or Braun's q = 23..31 table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"three-player-jamfold-sng-epsilon","cat":"graphs-games-automata","t":"3-handed no-limit hold'em jam/fold sit-and-go endgame (Ganzfried-Sandholm): a certified epsilon-equilibrium well below $0.0488","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"adderboard-smallest-adder-transformer","cat":"algorithms","t":"AdderBoard: smallest transformer (fewest unique parameters) adding two 10-digit numbers","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"amr-patric-folds-beat-published-f1","cat":"disease-research","t":"AMR genotype-to-phenotype: beat the published benchmark F1 on the frozen PATRIC species-antibiotic folds","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"anagol-per-language-shortest","cat":"compression-and-golf","t":"Anarchy Golf: a strictly shorter solution than the best-ranked one in some language on a post-mortem problem","k":"harvest","tr":3,"cp":"laptop-minutes","cb":"min"},{"id":"arch-comp-ainncs-docking-full-initial-set","cat":"ml-robustness","t":"ARCH-COMP AINNCS 2D Spacecraft Docking: verify or falsify the neural controller on the full initial set (unsolved since ARCH-COMP22)","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"go3-event4-synthetic-best-scores","cat":"optimization-benchmarks","t":"ARPA-E GO Competition Challenge 3 (multi-period AC unit commitment): beat the best Event 4 score on a public synthetic scenario","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"atom3d-rsr-rna-model-ranking","cat":"biology","t":"ATOM3D RSR: beat the published Spearman for ranking RNA structural models by RMSD","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"bamboo-slip-rejoining-wisepanda","cat":"ancient-texts","t":"Bamboo-slip fragment rejoining: beat WisePanda's Top-10 and Top-50 on the released Bamboo1350 fracture-curve benchmark without using real pairs","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"beacon-rna-benchmark-unsaturated-tasks","cat":"biology","t":"BEACON RNA benchmark: beat the best listed score on an unsaturated task (CRISPR off-target, structure-score imputation, splice sites, APA, RNA switches)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"beans-animal-datasets-per-task-best","cat":"ecology","t":"BEANS animal-sound benchmark: beat the best published test score on one of seven freely downloadable animal classification or detection datasets","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"bhh-tsp-constant-c12-bounds","cat":"erdos-and-proofs","t":"Beardwood-Halton-Hammersley TSP constant (C_12): a certified bound beating 0.6421 <= beta_2 <= 0.861715646305","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"bernstein-constant-digits","cat":"number-hunts","t":"Bernstein's constant beta = lim 2n E_2n(|x|): more than the 50 decimals of Varga and Carpenter (1985)","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"bilateral-trade-best-offer-vs-second-best","cat":"graphs-games-automata","t":"Bilateral trade: an instance where the better of seller-offering and buyer-offering earns less than 3/4 of second-best gains from trade (open gap [1/2, 3/4], Babaioff-Dobzinski-Ku\u2026","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"codetables-binary-linear","cat":"record-tables","t":"Binary (or small-q) linear codes beating codetables.de lower bounds","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"single-transposition-codes-length-12","cat":"record-tables","t":"Binary codes correcting one adjacent transposition at length 12: first unknown terms of OEIS A057608 and A057657 (Sloane's 1tc/1et graphs)","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"constant-weight-codes","cat":"record-tables","t":"Binary constant-weight codes A(n,d,w): new lower bounds in Brouwer's table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"binary-minimal-code-length-records","cat":"record-tables","t":"Binary minimal codes for secret sharing: shorten the dimension 10\u201313 records","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"binary-polynomial-multiplication-gates","cat":"algorithms","t":"Binary polynomial multiplication M(n): fewer AND/XOR gates than the best known circuit for n-term polynomials over GF(2)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"bivariate-bicycle-exact-distance-360-756","cat":"physics","t":"Bivariate bicycle codes: prove the exact distance of IBM's [[360,12,<=24]] or [[756,16,<=34]] code (only upper bounds are published)","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"bohr-radius-bidisc-k2-bounds","cat":"erdos-and-proofs","t":"Bohr radius of the bidisc K_2 (C_59): an explicit Schur function beating the 0.302825279492 upper bound, or a certified lower bound above Knese's 0.3006","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"book-ramsey-small-off-diagonal","cat":"record-tables","t":"Book Ramsey numbers off the n-1,n diagonal: close a gap in DS1 Table IXa (R(B4,B7) 22-23, R(B4,B9) 27-28, R(B5,B9) 28-30, R(B7,B11) 37-38) or a lower-only cell of Table VII (books\u2026","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"brainfuck-constants-shorter","cat":"compression-and-golf","t":"Brainfuck constants: a shorter BF program producing a constant than the esolangs table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"brownian-motion-project-sorries","cat":"formal-proofs","t":"Brownian Motion Lean project: close an unclaimed sorry (uniform integrability of stopped submartingales, UI martingale convergence, reflection principle)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"burnt-pancake-even-n-exact-flips","cat":"biology","t":"Burnt pancake sorting: settle T(n) for an even n by finding a flipping sequence that attains the lower bound","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"reversible-tm-busy-beaver-bbrev6","cat":"graphs-games-automata","t":"Busy Beaver for reversible Turing machines: decide BBrev(6)'s 388 holdouts or beat the 537,556-step champion","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ski-calculus-busy-beaver-small","cat":"graphs-games-automata","t":"Busy Beaver for SKI combinator calculus: beat a listed lower bound for size 7..11, or settle Xi_0(7) exactly","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"wang-tiles-busy-beaver-bbwt","cat":"graphs-games-automata","t":"Busy Beaver for Wang tiles: exact BBWT(5), or n Wang tiles that tile a larger largest square than the n = 5..10 records","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cami2-taxonomic-binning-species-f1","cat":"genomics","t":"CAMI II taxonomic binning of reads at species rank: beat ganon2's per-bin F1 on the plant-associated samples without losing accuracy","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"cami2-taxonomic-profiling-species-f1","cat":"genomics","t":"CAMI II taxonomic profiling at species rank: beat ganon2's F1 on the plant-associated samples in the CAMI Benchmarking Portal","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"card-guessing-yes-no-feedback-exact","cat":"graphs-games-automata","t":"Card guessing with yes/no feedback: exact optimal expected scores for two-copy decks beyond n = 10","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"cath42-inverse-folding-recovery-record","cat":"biology","t":"CATH 4.2 inverse folding: beat the best published sequence recovery (0.63, Refold) on the standard test split","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"chaocipher-single-message-and-extended-kpa","cat":"unbroken-ciphers","t":"Chaocipher: break a single ciphertext-only message, and known-plaintext attack on the Extended variant (open per the Chaocipher Clearing House)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"circulant-weighing-matrices-open","cat":"record-tables","t":"Circulant weighing matrices: settle an 'Open' CW(n,k) in Gordon's La Jolla repository","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"climatebench-total-nrmse-cpu","cat":"earth-and-sky","t":"ClimateBench: beat the best published total NRMSE for climate-model emulation on the SSP2-4.5 test scenario, on CPU","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"h3-collinear-benchmark-pec-ecg-energies","cat":"physics","t":"Collinear H3 benchmark potential energy curve: a lower variational Born-Oppenheimer energy than Ferenc and Matyus (2022) at the van der Waals minimum or at any of their 114 tabula\u2026","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"condorcet-domains","cat":"record-tables","t":"Condorcet domains: a larger domain than the best published one for some n in 9..25","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"connect-four-w-plus-h-17","cat":"graphs-games-automata","t":"Connect Four on a board with width + height = 17 (9x8, 10x7, 11x6, 12x5, 13x4): the first unsolved sizes","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"connected-still-life-max-population","cat":"graphs-games-automata","t":"Connected maximum-density still lifes: close a gap in Mahajan's n = 26..50 table (OEIS A398723), starting with 349 <= a(26) <= 352","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"constant-dimension-subspace-codes-table","cat":"record-tables","t":"Constant dimension subspace codes A_q(n,d;k): beat a best known lower bound in the Bayreuth subspace code tables (q = 2..9, n <= 19)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"overlapping-hyperspheres-percolation-d6-11","cat":"physics","t":"Continuum percolation of overlapping hyperspheres in d = 6-11: beat the Torquato-Jiao (2012) thresholds, still the most precise published values","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"covering-codes-q2-q4-upper-bounds","cat":"record-tables","t":"Covering codes K_q(n,R) for q = 2, 3, 4 (hypercube domination, football pool): beat an upper bound in K\u00e9ri's tables","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"covering-designs-record","cat":"record-tables","t":"Covering designs C(v,k,t): beat a repository entry","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cram-open-nimbers","cat":"graphs-games-automata","t":"Cram: compute a missing nimber in Beling's normal-play table (5x13, 6x11, 7x10, ...) or a missing mis\u00e8re value (5x8, 5x9, 6x7, 6x8, 6x9)","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"hypercube-crossing-number-drawings","cat":"graphs-games-automata","t":"Crossing number of the hypercube Q_n: a drawing with fewer crossings than Yang-Wang-Wang-Zhou's records (n = 5..13), or a certified lower bound for cr(Q_5)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cuneiform-language-identification-cli2019","cat":"ancient-texts","t":"Cuneiform language and dialect identification (VarDial 2019 CLI): beat NRC-CNRC's macro-F1 0.7695 on the released test set, closed track","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ebl-unidentified-fragment-overlaps","cat":"ancient-texts","t":"Cuneiform: fragment-to-fragment overlaps among UNIDENTIFIED eBL fragments (new witnesses of unknown compositions, 'indirect joins')","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ebl-fragment-identification","cat":"undeciphered-scripts","t":"Cuneiform: identify unplaced transliterated fragments as witnesses of known compositions (electronic Babylonian Library)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"manypoints-curves-finite-fields-lower-bounds","cat":"number-hunts","t":"Curves over finite fields with many points: raise a lower bound on manYPoints","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"deepsomatic-hcc1395-chr1-heldout-f1","cat":"genomics","t":"DeepSomatic on held-out HCC1395 chr1: beat DeepSomatic 1.10's somatic F1, especially ONT (SNV 0.858, indel 0.737) and tumor-only modes","k":"harvest","tr":3,"cp":"laptop-hours per cell","cb":"hours"},{"id":"degree-diameter-planar-table","cat":"record-tables","t":"Degree-diameter problem for planar graphs: a larger planar graph than the Combinatorics Wiki table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"dengue-2015-open-challenge-beat-published-skill","cat":"disease-research","t":"Dengue Forecasting Project (San Juan and Iquitos): beat the published forecast skill on the frozen 2015 challenge targets","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"designs-in-classical-polar-spaces","cat":"record-tables","t":"Designs in finite classical polar spaces: a new realizable 2-(r,k,lambda)_Q design (or the first one in a Hermitian polar space)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"dimer-constant-cubic-lattice-rigorous-bounds","cat":"physics","t":"Dimer constant of the cubic lattice Z^3: a certified upper bound below He's 0.452130 (2026) or a lower bound above Csikvari's 0.441075","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"golomb-square-grid-distinct-distances","cat":"record-tables","t":"Distinct distances in a lattice square (Erd\u0151s-Guy 'Golomb square'): n points with all distances distinct in a smaller k x k grid than known, n = 15..26","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"dominant-transversal-order-3-mod-4","cat":"record-tables","t":"Dominant transversals: a Latin square of order 11 (or 15, 19, ...) with a transversal that meets every other transversal (Ghafari-Wanless Question 1)","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"dreval-cross-study-ctrpv2-to-gdsc2","cat":"disease-research","t":"DrEval cross-study generalisation: beat the public best CTRPv2-to-GDSC2 (and CCLE/GDSC1/CTRPv1) transfer numbers","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"dreval-lco-ctrpv2-normalized-r2","cat":"disease-research","t":"DrEval leave-cell-line-out: beat the public best normalized R^2 / Pearson for cancer drug-response prediction on CTRPv2","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"dreval-ldo-beat-naive-mean-effects","cat":"disease-research","t":"DrEval leave-drug-out: the open question of beating the naive mean-effects baseline for unseen cancer drugs","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"driams-maldi-amr-beat-published-auroc","cat":"disease-research","t":"DRIAMS MALDI-TOF resistance prediction: beat the published per-species-drug AUROC on the public spectra","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"eca-rule30-rule110-cyclic-max-period","cat":"graphs-games-automata","t":"Elementary CA on rings: the maximum cycle length of Rule 30 (A334497) and Rule 110 (A204371) on a cyclic width of 37","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"codetables-eaqecc-qubit-gaps","cat":"record-tables","t":"Entanglement-assisted qubit codes [[n,k,d;c]]: raise a lower bound in Grassl's EAQECC table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-1055-erdos-selfridge-class-a20","cat":"erdos-and-proofs","t":"Erdos #1055 (Erdos-Selfridge prime classes): determine a(20) of OEIS A005113, or find a class-20 prime below 764276710625653","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"erdos-1204-narrow-admissible-tuples","cat":"erdos-and-proofs","t":"Erdos #1204 (Elliott): a narrower admissible k-tuple than Sutherland's table for some 343 <= k <= 5000, or exact minimal sums B(k) beyond k = 147","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"erdos-583-gallai-path-decomposition","cat":"erdos-and-proofs","t":"Erdos #583 (Gallai path decomposition): a connected graph needing more than ceil(n/2) paths, or the exhaustive n = 12 check","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"erdos-628-double-critical-order-14","cat":"erdos-and-proofs","t":"Erdos #628 (Erdos-Lovasz Tihany, a = 2 branch): a noncomplete double-critical graph, or the order-14 census","k":"harvest","tr":3,"cp":"laptop-days for order 1\u2026","cb":"days"},{"id":"erdos757-sidon-in-45-sets","cat":"record-tables","t":"Erdos #757: (4,5)-set with Sidon density below 4/7","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-1023-union-free-n8","cat":"erdos-and-proofs","t":"Erd\u0151s #1023 small cases: 80 subsets of an 8-set with no member a union of others (OEIS A347025; best known 79, upper bound 89)","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-302-unit-fraction-free-upper-constant","cat":"erdos-and-proofs","t":"Erd\u0151s #302: a certified upper constant below 0.84617 for the largest set in [1,N] with no 1/a = 1/b + 1/c","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-703-forbidden-intersection-row9","cat":"erdos-and-proofs","t":"Erd\u0151s #703 small cases: T(9,2) and T(9,3), the largest family of subsets of a 9-set with no two members meeting in exactly 2 (or 3) elements (OEIS A390645 row 9)","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"erdos-discrepancy-c3-longest-sequence","cat":"erdos-and-proofs","t":"Erd\u0151s discrepancy, C = 3: a +-1 sequence longer than 130,000 with discrepancy at most 3","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"distinct-subset-sums-small-n","cat":"record-tables","t":"Erd\u0151s distinct subset sums: an n-element set with distinct subset sums and smaller maximum than the best known","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"egz-constant-even-nonpower2-exponent","cat":"number-hunts","t":"Erd\u0151s\u2013Ginzburg\u2013Ziv constants s(C_n^r) for even n that is not a power of two: beat s(C_6^4) >= 85, s(C_6^5) >= 177, s(C_10^4) >= 153 or s(C_6^3) >= 41","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"eterna100-v2-vienna2-algorithmic-solve","cat":"biology","t":"Eterna100-V2 under ViennaRNA 2: an automated RNA design algorithm that solves a puzzle no benchmarked algorithm has solved","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"covid19-hub-europe-archive-beat-eurocovidhub-ensemble","cat":"disease-research","t":"European COVID-19 Forecast Hub archive: beat EuroCOVIDhub-ensemble's WIS on the hub's own published scores","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"respicast-ili-ari-europe-beat-hub-ensemble","cat":"disease-research","t":"European RespiCast hub: beat the hub ensemble's WIS for influenza-like illness or acute respiratory infection incidence across EU/EEA countries","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"fmm-catalogue-small-format-rank","cat":"algorithms","t":"Fast matrix multiplication: beat a best-known rank in the Lille FMM catalogue for a small format","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"fmm-ternary-integer-ring-upgrade","cat":"algorithms","t":"Fast matrix multiplication: best-known rank with ternary/integer coefficients where only rational or complex schemes are known","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"fmm-additive-complexity-records","cat":"algorithms","t":"Fast matrix multiplication: fewer additions for a fixed best-known rank (straight-line program records)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"fev-bench-beat-best-task-sql","cat":"machine-learning","t":"fev-bench forecasting: beat the best posted scaled quantile loss on a task with locally run open-weight models","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"rectangular-box-sudoku-min-clue-records","cat":"recreational-math","t":"Fewest clues for Sudoku with other box shapes: beat ton's records (10x10 2x5: 22, 12x12 2x6: 32, 12x12 3x4: 30, 15x15 3x5: 48, 20x20 4x5: 88, 25x25 5x5: 146)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"fewest-squares-rectangle-scaling-counterexample","cat":"recreational-math","t":"Fewest squares tiling a rectangle: a counterexample to h(dn,dm) = h(n,m) beyond the 388 x 388 table, or new exact rows of OEIS A219158","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"latin-min-transversals-odd-orders","cat":"record-tables","t":"Fewest transversals in a Latin square of odd order: beat 778 (n=11), 11744 (n=13), 165289 (n=15) or a larger-order record (OEIS A091323)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"finite-lattices-next-terms","cat":"wildcard","t":"Finite lattices: the next count of unlabeled lattices (A006966, n = 21), semimodular (A229202, n = 26), modular (A006981, n = 36) or distributive lattices (A006982, n = 61)","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"star-discrepancy-finite-point-sets-2d-3d","cat":"record-tables","t":"Finite point sets with record-low L-infinity star discrepancy in [0,1]^2 (n = 22..1020) or [0,1]^3 (n = 9..5000)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"archive-mr-mass-planet-first-dynamical-mass","cat":"sky-archives","t":"First measured mass (TTV or RV, public data only) for a transiting planet whose NASA Exoplanet Archive mass still comes from a mass-radius relation","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"hgca-rv-true-mass-unmeasured-companion","cat":"sky-archives","t":"First true (dynamical) mass for an RV-detected companion from Hipparcos-Gaia accelerations plus public radial velocities","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"fisbe-flylight-neuron-instance-segmentation","cat":"neuroscience","t":"FISBe (FlyLight) 3D neuron instance segmentation: beat PatchPerPix's benchmark score S = 0.35 on the combined test set","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"flab-antibody-developability-zero-shot","cat":"biology","t":"FLAb antibody developability: beat the released zero-shot scores on a therapeutic-property category","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"flip-gb1-plmfit-scoreboard-spearman","cat":"biology","t":"FLIP GB1 fitness landscape: beat the PLMFit scoreboard Spearman on the one-vs-rest or three-vs-rest split","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"fc-textbook-category-sorries","cat":"formal-proofs","t":"Formal Conjectures `textbook` sorries: formalise a known textbook-level result","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"freek-100-isabelle-hol-light-rocq-metamath-gaps","cat":"formal-proofs","t":"Freek Wiedijk's 100 theorems: fill a gap in Isabelle, HOL Light, Rocq, Metamath or Mizar (Lean is complete)","k":"harvest","tr":3,"cp":"pure thought plus lapto\u2026","cb":"thought"},{"id":"catagolue-glider-synthesis-cost-records","cat":"graphs-games-automata","t":"Game of Life: a cheaper glider synthesis than Catagolue's best-known cost for a still life or oscillator","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"game-of-sloanes-complex-line-packings","cat":"physics","t":"Game of Sloanes: a packing of n lines in C^d (d = 3..7) with lower coherence than the live leaderboard","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"llrl-ant-minimal-seed","cat":"graphs-games-automata","t":"Generalised ant LLRL: the least onset of the period-384 highway g(k) from starts with at most k non-zero cells, k = 0..K0, with proof of minimality","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"genomic-benchmarks-gresova-hard-datasets-accuracy","cat":"biology","t":"Genomic Benchmarks (Gresova et al.): beat the best published test accuracy on Human Enhancers Cohn, Human OCR Ensembl or Drosophila Enhancers Stark","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"german-hospitalization-nowcast-hub-beat-ensemble-wis","cat":"disease-research","t":"German COVID-19 hospitalization nowcast hub: beat the hub ensemble's WIS on the published real-time nowcasts","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"gilbreath-conjecture-verification-beyond-1-5e15","cat":"number-hunts","t":"Gilbreath's conjecture: extend the verification beyond Colonna's x = 1.5 x 10^15 (2026)","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"windmill-kn2-harmonious-graham-sloane","cat":"graphs-games-automata","t":"Graham-Sloane windmill conjecture: is K_8^(2) (two K_8 sharing a vertex) harmonious? (first open case of 'K_n^(2) harmonious iff n = 4')","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cohn-grassmannian-packings-table","cat":"packings-physics","t":"Grassmannian packings: N subspaces of R^m (m <= 16) with larger minimal squared chordal distance than Cohn's table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"gravity-spy-v1-official-split-accuracy","cat":"earth-and-sky","t":"Gravity Spy v1.0 LIGO glitch classification: beat the best published test accuracy on the official 22-class split","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"greenberg-p3-real-quadratic-beyond-1e5","cat":"number-hunts","t":"Greenberg's conjecture for p = 3: extend the Mercuri-Paoluzi-Schoof verification for real quadratic fields beyond discriminant 100,000","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"potts-antiferromagnet-colouring-entropy-bounds","cat":"physics","t":"Ground-state entropy of Potts antiferromagnets (proper colourings): tighten the certified bounds of Lundow and Markstrom (2008) for 4- and 5-colourings of the square grid or 3- an\u2026","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"gset-max-k-cut-records","cat":"optimization-benchmarks","t":"Gset Max-k-Cut (k = 3, 4): a better k-partition than the best published for a Gset graph","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"metagenomics-nonneoplastic-disease-classification","cat":"disease-research","t":"Gut-microbiome disease classification: beat the published cross-validated AUC on public non-cancer disease cohorts","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"guts-weenie-rule-strong-equilibrium","cat":"graphs-games-automata","t":"Guts with the Weenie rule: does the symmetric threshold resist every coalition for n >= 4?","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"ghr-sum-difference-c3a","cat":"erdos-and-proofs","t":"Gyarmati-Hennecart-Ruzsa sum-difference constant C_3a: beat 1.19519192 (finite-certified record 1.19102809)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"hadamard-maxdet-records","cat":"record-tables","t":"Hadamard maximal determinant: new record determinants for orders n not divisible by 4","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"hard-core-entropy-square-honeycomb-digits","cat":"physics","t":"Hard-core lattice gas at unit activity: more correct digits of the hard-square entropy constant (OEIS A085850) or the honeycomb constant than Baxter's corner-transfer-matrix values","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cohn-harmonic-energy-spheres-dim4-32","cat":"packings-physics","t":"Harmonic energy on spheres in 4 to 32 dimensions: lower the best known energy in the Ballinger-Blekherman-Cohn-Giansiracusa-Kelly-Schurmann table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"hest-bench-cancer-expression-from-morphology","cat":"disease-research","t":"HEST-Benchmark: beat the best published Pearson for predicting spatial gene expression from tumour histology","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"chime-frb-cat2-hidden-repeater","cat":"sky-archives","t":"Hidden repeating FRB source among apparently one-off bursts in CHIME/FRB Catalog 2","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"dujella-torsion-rank-records-quadratic-fields","cat":"number-hunts","t":"High-rank elliptic curves with prescribed torsion over quadratic fields: beat or certify a cell","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"limit-tori-3d-polynomial-hilbert-numbers","cat":"wildcard","t":"Hilbert's 16th problem for invariant tori in 3D: more normally hyperbolic limit tori than N_h(2) >= 3, N_h(3) >= 5, N_h(4) >= 7, N_h(5) >= 13","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"iea37-cs1-circular-wind-farm-layout","cat":"engineering","t":"IEA Wind Task 37 case study 1: a feasible 16-, 36- or 64-turbine circular-farm layout with higher AEP than every published or posted layout","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ieantn-awaiting-solution-nodes","cat":"formal-proofs","t":"IEANTN (explicit analytic number theory network): a Comparator-verified solution for an unclaimed node (e.g. the cotangent zeta-value expansion)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ihtp-ihtc2024-hidden-m-instances-upper-bounds","cat":"optimization-benchmarks","t":"IHTC-2024 competition (m01-m30) instances: lower a best known integrated surgery-admission-nurse schedule cost below the post-competition table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"induced-forest-planar-ratio-25-52","cat":"graphs-games-automata","t":"Induced forests in planar graphs after the Albertson-Berman refutation: a planar graph with largest induced forest below 25/52 of its vertices","k":"standard","tr":3,"cp":"laptop-hours for gadget\u2026","cb":"hours"},{"id":"indus-temporal-heldout-structure","cat":"undeciphered-scripts","t":"Indus script: structural model trained on the 1977 corpus that predicts later-excavated inscriptions","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"khipu-heldout-cord-value-prediction","cat":"undeciphered-scripts","t":"Inka khipus: frozen structural model that predicts masked cord values on khipus outside khipu.db (Open Khipu Repository)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"integer-chebyshev-constant-unit-interval","cat":"number-hunts","t":"Integer Chebyshev constant of [0,1]: a certified bound beating Niedbala Giraudin's 2026 bracket 0.422228600019 <= t_Z([0,1]) <= 0.422684697505","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ihtp-ihtc2024-upper-bounds","cat":"optimization-benchmarks","t":"Integrated Healthcare Timetabling (IHTC-2024): lower the best known cost of a public (i01-i30) or competition (m01-m30) hospital instance","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"invrs-leaderboard-photonic-pareto","cat":"engineering","t":"invrs-gym photonic inverse design: a manufacturable design beating the frozen invrs leaderboard's efficiency-vs-length-scale front","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"isic2018-task2-attribute-detection-jaccard","cat":"disease-research","t":"ISIC 2018 Task 2 (dermoscopic attribute segmentation): beat the challenge-best mean Jaccard of 0.307 on the public test masks","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"isic2019-diagnosis-balanced-accuracy-with-unknown","cat":"disease-research","t":"ISIC 2019 skin-lesion diagnosis with an 'unknown' class: beat the best balanced accuracy (0.636; 0.607 without external data) on the public test labels","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"jarvis-agra-tinnet-adsorption-energy-mae","cat":"chemistry-materials","t":"JARVIS-Leaderboard catalysis adsorption energies (AGRA O, OH, CO, CHO, COOH and TinNet O, OH, N): beat the best listed test MAE","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"jarvis-supercon-tc-snumat-hse-gap-mae","cat":"physics","t":"JARVIS-Leaderboard frozen mid-size tasks: experimental superconducting Tc from composition (SuperCon, 16,414) or HSE06 band gap from structure (SNUMAT, 10,386): beat the best list\u2026","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"jarvis-mlearn-mlff-force-mae","cat":"physics","t":"JARVIS-Leaderboard mlearn force fields (Cu, Ge, Li, Mo, Ni, Si): beat the best listed test force MAE with a model trained on a laptop","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"jarvis-mof-hmof-co2-qmof-bandgap-mae","cat":"physics","t":"JARVIS-Leaderboard MOF tasks: beat the best test MAE for GCMC CO2 uptake in hypothetical MOFs (0.01 and 2.5 bar) or for the PBE band gap of QMOF frameworks","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"jarvis-qm9-std-jctc-property-mae","cat":"chemistry-materials","t":"JARVIS-Leaderboard QM9 (qm9_std_jctc, 130,829 molecules): beat ALIGNN's test MAE on one of 11 quantum-chemical properties (R2 excluded)","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"jarvis-small-data-exfoliation-tc-mae","cat":"physics","t":"JARVIS-Leaderboard small-data materials properties (exfoliation energy, superconducting Tc): beat the best listed test MAE","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"kakeya-sum-difference-c3b-c3c-entropy","cat":"erdos-and-proofs","t":"Kakeya-type sum-difference constants C_3b and C_3c: beat the entropy-certificate lower bounds","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"kissing-number-dims-25-48","cat":"record-tables","t":"Kissing number lower bounds in dimensions 25-48 (beat the max over ALL sources, not Cohn's table)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"knight-covering-large-boards","cat":"graphs-games-automata","t":"Knight covering (domination) of the n x n board: fewer knights than Frank Rubin's records for n = 22..50","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-crosscap-number-bounds","cat":"wildcard","t":"KnotInfo crosscap numbers: a nonorientable spanning surface beating the best upper bound for an 11- or 12-crossing knot (573 intervals)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-nakanishi-index-unknown","cat":"wildcard","t":"KnotInfo Nakanishi index: prove the Alexander module cyclic (index 1) for one of the 229 11- and 12-crossing knots listed [1;2]","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-stick-number-bounds","cat":"wildcard","t":"KnotInfo stick numbers: a polygon with fewer edges than the best known for a prime knot up to 13 crossings, or a 9-stick realisation of a knot listed [9,10]","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ccd-kob-andersen-crystal-ground-states","cat":"packings-physics","t":"Kob-Andersen binary Lennard-Jones crystals: a periodic 80:20 structure with lower zero-pressure energy than the Cambridge Cluster Database records (-7.4903 per atom at N = 60, -7.\u2026","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"kobon-triangles-open-cells","cat":"record-tables","t":"Kobon triangles: more triangular faces from n straight lines than the best known, for an n where the record is below the upper bound","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"latin-largest-critical-sets","cat":"record-tables","t":"Largest critical sets lcs(n) of Latin squares: a critical set larger than the A063437 records for n = 8..17 (Bean's 2026 searches, n = 9..15 and 17)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"evalatin2026-latin-dependency-parsing","cat":"ancient-texts","t":"Latin dependency parsing (EvaLatin 2026): beat the best CLAS on Seneca's Phoenissae (74.03) and Aquinas's Summa (83.14) under the official scorer","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"evalatin2026-latin-ner","cat":"ancient-texts","t":"Latin named entity recognition (EvaLatin 2026, Ovid, Pliny, Tacitus): beat uOttawa's strict micro-F1 (0.908 coarse, 0.865 fine)","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"carmichael-least-62-prime-factors","cat":"number-hunts","t":"Least Carmichael number with exactly 62 prime factors: the next term a(62) of OEIS A006931","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"chess-no-promotion-diagrams-upper-bound","cat":"recreational-math","t":"Legal chess diagrams without promotion: beat Gourion's upper bound of 3.7422e37","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"go-legal-positions-beyond-tromp-tables","cat":"graphs-games-automata","t":"Legal Go positions: 20x20 (OEIS A094777 a(20)) and the first unknown cells of Tromp's rectangular m x n tables","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"levine-hat-n-player-records","cat":"graphs-games-automata","t":"Levine's hat puzzle with 3 to 12 players: beat a best-known success probability in the Buhler et al. record table (or lower V3 <= 89/256)","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"leyland-smallest-unproven-prp","cat":"number-hunts","t":"Leyland primes: prove the smallest unproven Leyland PRP (x^y+y^x: 13 749 digits; x^y-y^x: 10 483 digits)","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"linear-a-morphology-heldout","cat":"undeciphered-scripts","t":"Linear A: pre-registered morphological alternations that predict held-out contexts","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"loda-oeis-shorter-or-new-programs","cat":"compression-and-golf","t":"LODA: a new verified LODA program for an OEIS sequence that has none","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cayley-graphs-order-144-hamiltonian","cat":"graphs-games-automata","t":"Lov\u00e1sz conjecture, smallest open order: is every connected Cayley graph on a group of order 144 Hamiltonian?","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"madry-mnist-challenge-whitebox-below-leader","cat":"ml-robustness","t":"MadryLab MNIST challenge (white-box, Linf 0.3): push the secret model's accuracy below the leaderboard's best attack","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"magnet-dst-private-test-rmse","cat":"earth-and-sky","t":"MagNet geomagnetic-storm challenge: beat the winning RMSE for real-time Dst forecasting on the released private test set","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"matrix-1-to-n2-extremal-det-perm","cat":"record-tables","t":"Matrices filled with 1..n^2 (Pfoertner's OEIS family): beat a best-known maximal determinant or extremal permanent","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"womersley-maxdet-points-s2","cat":"packings-physics","t":"Maximum-determinant (Fekete-type interpolation) points on S^2: a larger log det than Womersley's table for some degree n <= 100","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"maxsat-evaluation-best-known-cost","cat":"optimization-benchmarks","t":"MaxSAT Evaluation benchmarks: beat the best known cost of an instance whose optimum is unknown","k":"harvest","tr":3,"cp":"laptop-hours per instan\u2026","cb":"hours"},{"id":"clamm2017-medieval-manuscript-dating","cat":"ancient-texts","t":"Medieval manuscript dating (ICDAR 2017 CLaMM tasks 3 and 4): beat 59.0% and 49.9% date-class accuracy on the released test sets","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"medmnist-pathmnist-breastmnist-accuracy","cat":"disease-research","t":"MedMNIST v2: beat the best published accuracy/AUC on the colorectal-histology (PathMNIST) or breast-ultrasound (BreastMNIST) benchmark","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"metamath-pmproofs-shorter-d-proof","cat":"compression-and-golf","t":"Metamath pmproofs.txt: a strictly shorter condensed-detachment proof of a Principia Mathematica theorem","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"mfass-splice-disruption-beat-pangolin-ap","cat":"disease-research","t":"MFASS splice-disruption prediction: beat Pangolin's published average precision on the 27,733-variant functional set","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"minimizer-density-record-tables","cat":"biology","t":"Minimizer schemes: beat the lowest published DNA density for a (w, k) pair in the public minimizer density tables","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"minimum-broadcast-graphs-23-25","cat":"graphs-games-automata","t":"Minimum broadcast graphs on 23\u201325 vertices: improve the remaining edge bounds","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"selection-min-comparisons-n16-n17","cat":"algorithms","t":"Minimum-comparison selection: settle V8(16) in {28, 29}, or beat the new n = 17 upper bounds (V6..V9 of 17)","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"seismic-missed-events-vs-comcat","cat":"earth-and-sky","t":"Missed local earthquakes in open EarthScope/IRIS waveforms, above the regional completeness magnitude, absent from USGS ComCat","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"brouwer-mixed-binary-ternary-codes","cat":"record-tables","t":"Mixed binary/ternary codes N(m,n,d): new lower bound in Brouwer's mixed-code tables","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"mixed-dimension-subspace-codes-binary","cat":"record-tables","t":"Mixed dimension binary subspace codes A_2(n,d), n = 6..8: improve a bound in Kurz's Table 8.1 (A_2(6,3) 108-117, A_2(7,3) 614-776, A_2(8,5) 263-326, ...)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"mmlib-multimode-rcpsp-ub","cat":"optimization-benchmarks","t":"MMLIB / Boctor multi-mode resource-constrained project scheduling: shorter makespan for an open instance","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"mms-impossibility-small-instances","cat":"wildcard","t":"MMS impossibility: an additive instance where no allocation gives every agent more than 20/21 of her maximin share (or chores above 31/30)","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"monomer-dimer-square-lattice-constant-digits","cat":"physics","t":"Monomer-dimer constant of the square lattice: more than the 11-12 decimals published by Kong (2006)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"latin-max-intercalates","cat":"record-tables","t":"Most intercalates (2x2 subsquares) in a Latin square of order n = 10..28: beat the A092237 / A307164 records","k":"harvest","tr":3,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"motif-scaffolding-24-task-unique-successes","cat":"biology","t":"Motif scaffolding benchmark (24 tasks): more unique in-silico successes than the published best on a task","k":"harvest","tr":3,"cp":"needs cluster","cb":"cluster"},{"id":"matsp-multi-activity-shift-scheduling","cat":"optimization-benchmarks","t":"Multi-activity multi-day shift scheduling (Curtois-Qu MATSP instances 1-225): beat a best known penalty","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"multiperfect-new-k-perfect","cat":"number-hunts","t":"Multiply perfect numbers: find a new 9-, 10- or 11-perfect number","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"muonic-molecular-ions-weakly-bound-states-energies","cat":"physics","t":"Muonic molecular ions dd-mu and dt-mu: a lower variational energy for the weakly bound (J,v) = (1,1) states than Frolov's 2025 values (the (2,0) states of dd-mu, dt-mu and tt-mu a\u2026","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"mtc3-hutton-cipher-part-5","cat":"unbroken-ciphers","t":"MysteryTwister 'The Hutton Cipher \u2013 Part 5' (4,250-letter ciphertext-only, 0 solvers since 2023)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"qrac-n-to-1-shared-randomness-optimality","cat":"physics","t":"n-to-1 qubit random access codes with shared randomness: prove the 4-to-1 code (p = 0.741481) optimal, or beat a numerical optimum for n = 4..9","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"hls-multitemporal-crop-cdl-miou","cat":"earth-and-sky","t":"NASA/IBM HLS multi-temporal crop segmentation (US, CDL 2022): beat 55.1 mIoU (InstaGeo's fine-tuned Prithvi-EO-2.0-300M) on the official validation split","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ncbi-pathogen-ast-ecoli-genotype-phenotype-f1","cat":"disease-research","t":"NCBI Pathogen Detection AST: beat the published antibiotic-specific genotype-phenotype F1 for Escherichia coli/Shigella","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"nceas-disdat-presence-only-sdm-auc","cat":"ecology","t":"NCEAS/disdat species distribution benchmark: beat the best published presence-absence AUC for presence-only models in six regions","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"catwise-cold-brown-dwarf-candidate-uncatalogued","cat":"sky-archives","t":"New cold (late-T or Y) brown dwarf candidate with significant motion in CatWISE2020 and unTimely, absent from SIMBAD and the ultracool-dwarf compilations","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tess-eb-etv-new-hierarchical-triple","cat":"sky-archives","t":"New hierarchical triple from eclipse-timing variations of a TESS eclipsing binary","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"lunar-pit-candidate-not-in-lroc-atlas","cat":"planetary-science","t":"New lunar pit (steep-walled collapse feature) in public LROC NAC images, absent from the LROC Pits Atlas","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"iau-mdc-new-meteor-shower-gmn","cat":"earth-and-sky","t":"New meteor shower in public Global Meteor Network orbits, absent from the live IAU MDC shower list","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ztf-microlensing-event-uncatalogued","cat":"sky-archives","t":"New microlensing event in public ZTF light curves absent from published ZTF, Gaia and OGLE/KMTNet microlensing catalogues","k":"harvest","tr":3,"cp":"laptop-hours to overnig\u2026","cb":"hours"},{"id":"gaia-dr3-open-cluster-not-in-ucc","cat":"sky-archives","t":"New open cluster in Gaia DR3 absent from the Unified Cluster Catalogue (UCC 260615) and the Hunt and Reffert census","k":"harvest","tr":3,"cp":"laptop-hours per field","cb":"hours"},{"id":"kepler-k2-new-vetted-transit-candidate","cat":"sky-archives","t":"New vetted transit candidate in archival Kepler or K2 light curves (not in KOI/K2 candidate tables)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tess-new-vetted-transit-candidate","cat":"sky-archives","t":"New vetted transiting-planet candidate in public TESS light curves (not in TOI/CTOI/Archive)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"nieuwland-constant-lower-bounds-gosain-tables","cat":"recreational-math","t":"Nieuwland constants of the Platonic, Archimedean, Catalan and Johnson solids: a Rupert passage with a larger scale than Gosain-Grimmer's tables","k":"harvest","tr":3,"cp":"laptop-hours per solid","cb":"hours"},{"id":"nih-thin-smear-malaria-patient-grouped-sensitivity","cat":"disease-research","t":"NIH/NLM thin-smear malaria cells: beat the published sensitivity at matched specificity, and under a patient-grouped split","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"nist-aes-circuit-records","cat":"algorithms","t":"NIST Circuit Complexity AES tables: a smaller or shallower {AND, XOR, XNOR} circuit for the AES S-box, inverse S-box, MixColumns or InvMixColumns","k":"harvest","tr":3,"cp":"laptop-days for the sea\u2026","cb":"days"},{"id":"no-four-in-plane-cubic-grid","cat":"record-tables","t":"No four in a plane: more points in the n x n x n grid with no four coplanar than the best known (OEIS A280537, AZsPCs 2016)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"non-attacking-queens-game-nimbers-a344227","cat":"graphs-games-automata","t":"Non-Attacking Queens game (Node-Kayles on the n-queens graph): exact nimber a(18), the 20x20 outcome, and toroidal Conjecture T1 (OEIS A344227)","k":"standard","tr":3,"cp":"laptop-hours for toroid\u2026","cb":"hours"},{"id":"nucleotide-transformer-benchmark-mcc","cat":"biology","t":"Nucleotide Transformer benchmark: beat the best published MCC on a genomic regulatory task","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"chess-endgame-nulp-nine-pieces","cat":"recreational-math","t":"Number of unique legal chess positions with 9 pieces (next term of OEIS A318266, Kryukov's NULP)","k":"standard","tr":3,"cp":"laptop-days with a comb\u2026","cb":"days"},{"id":"opn-roadblock-composites","cat":"number-hunts","t":"Odd perfect number proof tree: factor a 'most wanted roadblock' composite on Ochem's lists","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"oeis-keyword-more-new-terms","cat":"recreational-math","t":"OEIS 'keyword:more' sequences: compute the next term(s) beyond the live entry and b-file","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"openproblems-batch-integration-hard-metrics","cat":"biology","t":"Open Problems batch integration: beat every listed method on the metrics where single-cell integration still fails","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"openproblems-label-projection-cross-dataset","cat":"biology","t":"Open Problems label projection: beat the best listed accuracy/macro-F1 for transferring cell-type labels on the hardest datasets","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"openproblems-spatially-variable-genes-correlation","cat":"biology","t":"Open Problems spatially variable genes: beat the best ranking correlation on the hardest simulated spatial datasets","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"openood-v15-cifar-posthoc-near-ood-auroc","cat":"machine-learning","t":"OpenOOD v1.5 CIFAR-10/100: a post-hoc OOD detector on the official cross-entropy ResNet-18 checkpoints beating the best near-OOD AUROC","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"bitcoin-selfish-mining-revenue-bounds","cat":"graphs-games-automata","t":"Optimal selfish mining in Bitcoin (Sapirshtein-Sompolinsky-Zohar model, gamma = 0): certify an upper bound on the optimal relative revenue below 0.70109 at alpha = 0.45 or below 0\u2026","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"optiwindnet-routesets-cable-routing-records","cat":"optimization-benchmarks","t":"OptiWindNet RouteSets: a shorter offshore wind-farm array-cable network than the best stored for a real site","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"othello-perft-and-positions-next-terms","cat":"graphs-games-automata","t":"Othello from the start: games after 22 plies (OEIS A124004) and distinct positions after 14 plies (A124005)","k":"harvest","tr":3,"cp":"laptop-days for A124005\u2026","cb":"days"},{"id":"packing-density-4-point-patterns","cat":"recreational-math","t":"Packing densities of 2413, 1342 and 1324: beat a Sliacan-Stromquist or Presutti-Stromquist bound with an explicit permuton or a flag-algebra certificate","k":"harvest","tr":3,"cp":"laptop-hours for lower\u2026","cb":"hours"},{"id":"packomania-scu-spheres-in-cube","cat":"packings-physics","t":"Packomania: equal spheres in a cube (scu), beat a per-N record radius","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"pmms-impossibility-factors","cat":"wildcard","t":"Pairwise maximin share (PMMS): an additive instance whose best PMMS factor is below G\u00f6lz's 78/79 (goods) or above 1.102065 (chores)","k":"standard","tr":3,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"grid-compositions-polyomino-tilings-a145835-n13","cat":"graphs-games-automata","t":"Partitions of the n x n grid into connected pieces (polyomino tilings of the square): the next term A145835(13), or the symmetric count A291807(13) as a partial win","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"peaceable-queens-torus-and-a16","cat":"graphs-games-automata","t":"Peaceable queens: beat Clinch-Drescher-Huynh-Saffidine's odd-torus records (n = 19..63), or determine a(16)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"peer-fold-classification-superfamily-holdout","cat":"biology","t":"PEER fold classification: beat the leaderboard's 32.1% accuracy on held-out SCOP superfamilies","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"peg-solitaire-9x9-central-game","cat":"graphs-games-automata","t":"Peg solitaire on the 9x9 square board: a central-game solution shorter than Alain Maye's 34 moves","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"pentagonal-geometries-pent4-pent5-exceptions","cat":"record-tables","t":"Pentagonal geometries: construct PENT(4,r) for r in {8,12,16,28,32,36,44,48,56,64,72} or PENT(5,r) for r in {11,16,66,96,116}","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"perfect-squared-square-smallest-side-records","cat":"recreational-math","t":"Perfect squared squares: smaller side than the best known for an order 38..59 (OEIS A217148 table and squaring.net listings), or a nicer or more odd-sided record square","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"penney-permutations-rotation-conjecture","cat":"graphs-games-automata","t":"Permutation Penney: a pattern that its right rotation does not beat (counterexample to Elizalde-Lin Conjecture 6.1), or certified k = 4, 5","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"perturbench-frangieh21-melanoma-transfer","cat":"disease-research","t":"PerturBench Frangieh21: beat the published best covariate-transfer metrics for Perturb-seq in melanoma cells","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"perturbench-jiang24-cancer-lines-transfer","cat":"disease-research","t":"PerturBench Jiang24: beat the published best cytokine-perturbation transfer metrics across cancer cell lines","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"perturbench-norman19-combo-prediction","cat":"disease-research","t":"PerturBench Norman19: beat the published best combination-perturbation prediction metrics (CRISPR Perturb-seq in a leukemia line)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"perturbench-srivatsan20-cell-line-transfer","cat":"disease-research","t":"PerturBench Srivatsan20: beat the published best cross-cell-line chemical-perturbation transfer in three cancer cell lines","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"polaris-adme-fang-biogen-endpoints","cat":"drug-discovery","t":"Polaris ADME-Fang (Biogen 3,521-compound DMPK set): beat the top listed score on an endpoint's public fold","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"polycube-tree-edge-unzipping","cat":"recreational-math","t":"Polycube trees and edge-unzipping: a polycube tree with no edge zipper unfolding, or certified unzippings of all small ones (Demaine-Demaine-Eppstein-O'Rourke Question 1)","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"polyform-compatibility-open-pairs","cat":"graphs-games-automata","t":"Polyform compatibility: solve an open ('?') pair or shrink a smallest-known common figure on George Sicherman's tables","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"asteroid-precovery-arc-extension","cat":"sky-archives","t":"Precovery of known asteroids in public ZTF / Pan-STARRS / DECam images, extending the observed arc","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"shapley-network-design-pos-three-players","cat":"graphs-games-automata","t":"Price of stability of undirected Shapley network design with three players: an instance above 1769/1126 (upper bound 286/175)","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"pnt-plus-unassigned-open-issues","cat":"formal-proofs","t":"PrimeNumberTheoremAnd (PNT+): close an unassigned open formalisation issue (IK identities, Rosser-Schoenfeld prime sums, Dusart table bounds)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"primes-in-ap-records-ap28","cat":"number-hunts","t":"Primes in arithmetic progression: beat a largest-known or smallest-known AP-k record (k = 3..27), or find the first AP28","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"proteinbench-apo-holo-multistate-tmens","cat":"biology","t":"ProteinBench apo-holo: beat TMens 0.873 for predicting both states of 91 conformational-change proteins","k":"standard","tr":3,"cp":"needs cluster","cb":"cluster"},{"id":"proteingym-clinical-indels-auc","cat":"disease-research","t":"ProteinGym clinical indels: beat the leaderboard's best average AUC on insertion/deletion clinical variants","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"proteingym-dms-indels-zeroshot-spearman","cat":"disease-research","t":"ProteinGym indel benchmark (zero-shot): beat the best average Spearman on insertion/deletion DMS assays","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"proto-elamite-accounting-balance","cat":"undeciphered-scripts","t":"Proto-Elamite: numeral-system and commodity assignments checked by tablet arithmetic","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"luhn-repunit-family-prp-primality-proofs","cat":"number-hunts","t":"Prove a listed PRP prime in Luhn's generalized repunit, generalized Wagstaff or generalized Mersenne tables (at least 10 000 digits)","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"qplib-better-solution-point","cat":"optimization-benchmarks","t":"QPLIB: better solution point for a quadratic (including QAP-type and Max-Cut-type binary) instance","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"quantum-latin-square-cardinalities-7-9-11-23","cat":"record-tables","t":"Quantum Latin squares: realise an 'uncertain' cardinality for order 7, 9, 11 or 23 (Zhang-Lv-Cao Table 6)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ccd-quantum-lj-zpe-rare-gas-clusters","cat":"chemistry-materials","t":"Quantum-corrected Lennard-Jones clusters (Xe, Ar, Ne with harmonic zero-point energy): lower a global minimum in the Calvo-Doye-Wales table (N < 100)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"quaternary-legendre-pairs-open-lengths","cat":"record-tables","t":"Quaternary Legendre pairs: settle an open even length up to 100 (70, 76, 88, 92, 94 or 100)","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"codetables-qubit-upper-bounds-n101-256","cat":"physics","t":"Qubit stabilizer codes n = 101..256: lower a weak UPPER bound in Grassl's codetables.de qubit table with an exact LP/shadow certificate","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"codetables-qudit-quantum-codes-q3-q8","cat":"record-tables","t":"Qudit stabilizer codes [[n,k,d]]_q for q = 3, 4, 5, 7, 8: raise a lower bound in Grassl's extended tables","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ramsey-kk-minus-e-table-gaps","cat":"record-tables","t":"Ramsey numbers with K_k - e: close a gap in Radziszowski's Table IIIa/IIIb (e.g. R(K4-e,K8-e) 30-32, R(K6,K5-e) 43-51, R(K8,K4-e) 36-39)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"lattice-rsa-jamming-coverage-square-lattice","cat":"physics","t":"Random sequential adsorption on the square lattice: more digits of the NN-exclusion jamming coverage 0.3641323(1), and the dimer value (0.906820 vs 0.906823)","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"phenopacket-store-rare-disease-gene-prioritization","cat":"disease-research","t":"Rare-disease gene prioritisation: beat published ranking performance on a frozen phenopacket-store release","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"raredis-corpus-rare-disease-ner-f1","cat":"disease-research","t":"RareDis corpus: beat the published BioBERT F1 for rare-disease and sign entity recognition on the fixed test split","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"rcplib-rg300-dc2-rcpsp-ub","cat":"optimization-benchmarks","t":"RCPLIB (Vanhoucke-Coelho) RG300 and DC2 resource-constrained project scheduling: shorter makespan for an open instance","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cryptocellar-enigma-1941-remaining","cat":"unbroken-ciphers","t":"Remaining unbroken 1941 German Army Enigma messages (CryptoCellar list)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"respicast-covid19-hub-beat-ensemble-wis","cat":"disease-research","t":"RespiCast COVID-19 hub: beat the hub ensemble's season WIS for COVID-19 hospital admissions in EU/EEA countries","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"rhombic-zonotopal-tilings-a006245-n17","cat":"graphs-games-automata","t":"Rhombic tilings of the 2n-gon (primitive sorting networks, A006245): the count for n = 17, or the next term of a higher-dimensional zonotopal-tiling column A060595-A060601","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"archiveii-interfamily-secondary-structure-f1","cat":"biology","t":"RNA secondary structure across families: beat the best published family-fold F1 on ArchiveII, especially telomerase RNA","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"robustbench-cifar100-linf-beat-autoattack","cat":"ml-robustness","t":"RobustBench CIFAR-100 Linf (eps 8/255): lower a listed model's robust accuracy below the best published value with a stronger attack","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"rongorongo-graphemes-parallels","cat":"undeciphered-scripts","t":"Rongorongo: graphemic inventory and new parallel passages found by alignment","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"rsv-hub-retrospective-beat-ensemble-wis","cat":"disease-research","t":"RSV forecast hub: beat the hub ensemble's season-average WIS retrospectively on a completed RSV season","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"vesuvius-ct-codec-random-access","cat":"herculaneum-scrolls","t":"Scroll CT compression with random access: beat volcomp's rate-distortion on its 54 held-out PHerc. Paris 4 2.4 \u00b5m 128\u00b3 chunks while every chunk stays independently decodable","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"ecc-inversion-addition-chains","cat":"algorithms","t":"Shorter addition chains for elliptic-curve field and scalar inversion exponents (Curve25519, P-256, P-384, secp256k1)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"myerson-vs-anonymous-reserve-gap","cat":"graphs-games-automata","t":"Single-item auctions: an asymmetric regular instance where Myerson's revenue exceeds second price with the best anonymous reserve by a factor above 2.1596 (JLTX four-buyer record)","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"hypergraph-ramsey-small-lower-bounds","cat":"record-tables","t":"Small hypergraph Ramsey numbers: beat R(4,5;3) >= 35, R(4,6;3) >= 63, R(5,5;3) >= 88, R(4,4,4;3) >= 79 or R(5,5;4) >= 35, or settle R(K4-t,K5;3) in 14-16","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"small-symmetric-function-circuit-size","cat":"algorithms","t":"Small symmetric Boolean functions over the full binary basis: smaller circuits for SUM_n (sideways sum), MAJ_n, SORT_n, or exact values such as Knuth's MOD3 n = 6 cases","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"folkman-numbers-small-table","cat":"record-tables","t":"Small vertex and edge Folkman numbers: improve a bound in the Hassan-Radziszowski-Van Overberghe 2026 tables","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cage-upper-bounds","cat":"graphs-games-automata","t":"Smaller (k,g)-graph than the cage record","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"smallest-mnist-99-percent-network","cat":"machine-learning","t":"Smallest neural network reaching 99% test accuracy on MNIST (record: 697 parameters)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"oeis-a046057-moa-33","cat":"wildcard","t":"Smallest order with exactly 33 groups (OEIS A046057 a(33), the first unknown moa)","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"smt2026-p4-dfa-unknown-certificates","cat":"optimization-benchmarks","t":"SMT-COMP 2026 P4/DFA bit-vector holdouts: one exact SAT model or UNSAT certificate","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"snake-coil-in-the-box","cat":"record-tables","t":"Snake-in-the-box / coil-in-the-box records in dimensions 9-13","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"moews-aliquot-cycles-new","cat":"number-hunts","t":"Sociable numbers: find an aliquot cycle not on Moews' list","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"sorting-network-size-records","cat":"record-tables","t":"Sorting networks: fewer comparators than the best known for n = 16..32","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"spencer-discrepancy-c10c-lower-bound","cat":"erdos-and-proofs","t":"Spencer discrepancy constant C_10c: an n x n matrix in [-1,1] whose discrepancy beats the record ratio disc(A)/sqrt(n)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"spherical-designs-s3-fewest-points","cat":"packings-physics","t":"Spherical t-designs on S^3 (including SO(3) Chebyshev rules) with fewer points: beat the smallest known N for a degree t","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"spikeforest-paired-hybrid-sorter-accuracy","cat":"neuroscience","t":"SpikeForest ground-truth spike sorting: beat the best average accuracy in the SpikeForest table on the paired Boyden recordings (and the hybrid Janelia studies)","k":"harvest","tr":3,"cp":"laptop-hours per study","cb":"hours"},{"id":"spock-stability-auc-cleaned-dataset","cat":"planetary-science","t":"SPOCK orbital-stability benchmark (Thadhani et al. 2025 cleaned data): beat SPOCK 2.0's holdout AUC for 10^9-orbit stability of compact three-planet systems","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"srbench-2025-blackbox-dominate-leader","cat":"machine-learning","t":"SRBench 2025 black-box: a symbolic regressor that Pareto-dominates the best-accuracy method on a dataset","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"stable-marriage-max-stable-matchings","cat":"record-tables","t":"Stable marriage: an instance of size n with more stable matchings than the best known (OEIS A357271 and the Ong et al. 2025 instances)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"av1324-growth-upper-bound-shuffle-automata","cat":"recreational-math","t":"Stanley-Wilf limit of 1324: a certified upper bound below Brignall's 13.167248 (shuffle-automaton certificates)","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"steiner-2-designs-block-6-undecided","cat":"record-tables","t":"Steiner systems S(2,6,v): settle one of the 27 undecided admissible v (smallest 51), or an undecided case with block size 7, 8 or 9","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"steinlib-puc-i640-open-upper-bounds","cat":"optimization-benchmarks","t":"SteinLib PUC and I640: a cheaper Steiner tree for one of the 32 unsolved instances (hypercube, code-covering, bipartite, incidence graphs)","k":"harvest","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"svcomp-2026-never-solved-validated-witness","cat":"formal-proofs","t":"SV-COMP 2026: a doubly validated witness for a verification task that no participating verifier answered correctly","k":"harvest","tr":3,"cp":"laptop-hours per task","cb":"hours"},{"id":"tcga-multiomics-survival-cindex-herrmann","cat":"disease-research","t":"TCGA multi-omics survival: beat the best published C-index or integrated Brier score for a cancer cohort in the Herrmann benchmark","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tdc-admet-regression-mae-caco2-ppbr-ld50","cat":"drug-discovery","t":"TDC ADMET Benchmark Group, MAE regression leaderboards (Caco2_Wang, PPBR_AZ, LD50_Zhu): beat rank 1 on the official scaffold split","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tdc-admet-cyp-inhibition-auprc","cat":"drug-discovery","t":"TDC ADMET CYP inhibition leaderboards (CYP2C9/CYP2D6/CYP3A4_Veith, 12-13k molecules, AUPRC): beat MapLight+GNN","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tdc-admet-small-classification-auprc-auroc","cat":"drug-discovery","t":"TDC ADMET small classification leaderboards (CYP substrates, hERG, DILI, Bioavailability): beat rank 1 on the official scaffold split","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tdc-admet-excretion-spearman-leaderboards","cat":"drug-discovery","t":"TDC ADMET Spearman leaderboards (Half_Life_Obach, Clearance_Hepatocyte_AZ, Clearance_Microsome_AZ, VDss_Lombardo): beat rank 1","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tdc-dti-dg-bindingdb-patent-pcc","cat":"drug-discovery","t":"TDC DTI Domain-Generalization (BindingDB patent-year split): beat the listed Pearson correlation","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tgb-dynamic-node-affinity-ndcg-leaderboards","cat":"machine-learning","t":"TGB dynamic node affinity (tgbn-trade, genre, reddit, token): beat NAVIS's top test NDCG@10","k":"harvest","tr":3,"cp":"laptop-minutes for tgbn\u2026","cb":"min"},{"id":"three-body-equal-mass-rigorous-stability-beyond-eight","cat":"physics","t":"Three-body problem: a computer-assisted proof of KAM (or linear) stability for an equal-mass periodic orbit other than the figure-eight, from the Hristov-Hristova-Tanikawa list of\u2026","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"polytof-toffoli-tcount-benchmark-tensors","cat":"physics","t":"Toffoli-count and T-count records: fewer non-Clifford gates for a benchmark circuit tensor than the Khoruzhii-Gelss-Pokutta (polytof) table","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"henon-topological-entropy-rigorous-bounds","cat":"physics","t":"Topological entropy of the classical Henon map: a rigorous lower bound above 0.46469, a certified upper bound below ln 2, or periodic-orbit counts beyond period 30","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"tourism-competition-beat-best-published-mape","cat":"machine-learning","t":"Tourism forecasting competition (1,311 series): an out-of-sample average MAPE below N-BEATS-G's 18.47","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"trades-mnist-smallcnn-whitebox-below-leader","cat":"ml-robustness","t":"TRADES MNIST white-box leaderboard (Linf 0.3): push the TRADES SmallCNN's robust accuracy below 92.46%","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"traitgym-complex-traits-auprc","cat":"biology","t":"TraitGym complex traits: beat the best AUPRC for picking the causal regulatory variant among matched controls","k":"standard","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"traitgym-mendelian-zero-shot-auprc","cat":"biology","t":"TraitGym Mendelian traits: beat CADD zero-shot AUPRC on causal non-coding variants for rare disease","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"tsunami-tide-gauge-signal-not-in-ncei","cat":"earth-and-sky","t":"Tsunami recorded on open tide-gauge data but absent (as an event or at that gauge) from the NCEI Global Historical Tsunami Database","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"cryptic-tb-resistance-beat-who-catalogue","cat":"disease-research","t":"Tuberculosis drug resistance from genotype: beat the WHO catalogue head-to-head on the public CRyPTIC compendium","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"turan-cycle-free-afzaly-mckay","cat":"record-tables","t":"Turan numbers for forbidden cycles: beat an 'at least' entry in the Afzaly-McKay extremal graph tables","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"auction-deterministic-threshold-monotonicity","cat":"algorithms","t":"Two-item auction determinism threshold: a density pair for which Thirumulanathan's c2*(c1) strictly decreases","k":"standard","tr":3,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"ucr-tsc-beat-reference-30-resample-best","cat":"machine-learning","t":"UCR univariate time series classification: beat the best reference classifier's 30-resample mean accuracy on a dataset","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"uea-multivariate-tsc-beat-published-30-resample-best","cat":"machine-learning","t":"UEA multivariate time series classification: beat the best published 30-resample mean accuracy on a dataset","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"nonogram-unique-count-7x7","cat":"recreational-math","t":"Uniquely solvable nonograms: count the 7 x 7 case (OEIS A242876 a(7)) or a new n x m cell beyond n*m = 44 (A384764)","k":"harvest","tr":3,"cp":"laptop-days","cb":"days"},{"id":"dasch-unreported-historical-outburst","cat":"sky-archives","t":"Unreported historical outburst (nova, dwarf nova or large-amplitude event) in DASCH DR7 century-long plate light curves","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"brouwer-qary-unrestricted-a3-a4-a5","cat":"record-tables","t":"Unrestricted ternary, quaternary and 5-ary codes A_q(n,d): new lower bound in Brouwer's small q-ary tables","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"linear-baseline-perturbation-replogle-k562","cat":"disease-research","t":"Unseen single-gene perturbations in leukaemia cells: beat the linear baseline that currently matches every foundation model","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"covid19-forecast-hub-retrospective-beat-ensemble-wis","cat":"disease-research","t":"US COVID-19 Forecast Hub: beat the hub ensemble's season-average WIS for hospital admissions in a vintage-honest retrospective","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"vdw-small-lower-bounds","cat":"record-tables","t":"Van der Waerden numbers: beat a small-parameter lower bound W(r,k) or w(2;k1,k2)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"vnncomp-2026-unsolved-instance-counterexample","cat":"ml-robustness","t":"VNN-COMP 2026: a validated counterexample for a benchmark instance that no participating verifier solved","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"quartering-chessboard-a006067-n29","cat":"recreational-math","t":"Ways to quarter an n x n chessboard into four congruent connected pieces: the next term A006067(29) or A006067(30), open since Howroyd's n = 28 in 2016","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"wieferich-other-bases-fischer-table","cat":"number-hunts","t":"Wieferich primes to other bases: a new p with b^(p-1) == 1 (mod p^2) beyond Richard Fischer's searched limits (incl. Mirimanoff base 3)","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"xhstt-2014-high-school-timetabling-bks","cat":"optimization-benchmarks","t":"XHSTT high school timetabling (Post archive): beat a best known solution cost on an open XHSTT-2014 instance","k":"harvest","tr":3,"cp":"laptop-hours","cb":"hours"},{"id":"zapbench-whole-brain-forecast-mae","cat":"neuroscience","t":"ZAPBench whole-brain zebrafish activity forecasting: beat the best released long-context (C=256) test MAE at every horizon","k":"standard","tr":3,"cp":"laptop-days","cb":"days"},{"id":"ccd-c60-molecular-clusters","cat":"packings-physics","t":"(C60)_N molecular clusters (Pacheco-Prates-Ramalho N <= 105, Girifalco N < 81): lower a putative global minimum in the Doye-Wales tables","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"ks-sat-threshold-f5-unsat-5cnf","cat":"record-tables","t":"(k,s)-SAT threshold: an unsatisfiable 5-CNF in which every variable occurs at most 7 times, proving f(5) <= 6","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"ccd-nacl-cluster-anions-born-mayer","cat":"packings-physics","t":"(NaCl)_N Cl- cluster anions (N <= 35, Tosi-Fumi Coulomb plus Born-Mayer and Welch potentials): lower a putative global minimum in the Doye-Wales table","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"mint-ts-sequences-small-gaps","cat":"record-tables","t":"(t,s)-sequences in base 2 or 3: close a MinT gap between the best known t and the lower bound (smallest: is there a (4,8)-sequence in base 2?)","k":"standard","tr":2,"cp":"pure thought plus lapto\u2026","cb":"thought"},{"id":"orlib-mkp-chu-beasley-30-500-and-gk","cat":"optimization-benchmarks","t":"0-1 multidimensional knapsack: beat a best known value on an OR-Library 30.500 (Chu-Beasley) or MK_GK (Glover-Kochenberger) instance","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"sudoku-16x16-fewer-than-55-clues","cat":"recreational-math","t":"16 x 16 Sudoku with 54 or fewer clues: beat the 55-clue record (OEIS A198297, 15 <= a(4) <= 55)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"ab-offlattice-protein-3d-best-energies","cat":"packings-physics","t":"3D AB off-lattice protein model: beat the best published energy for a standard Fibonacci or PDB-derived benchmark sequence","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"fifth-powers-5-1-4-new-primitive","cat":"number-hunts","t":"A fifth primitive solution to a^5 + b^5 + c^5 + d^5 = e^5 (or a third all-positive one)","k":"harvest","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"ame-states-open-cells-huber-table","cat":"physics","t":"Absolutely maximally entangled states: settle an open AME(n,D) cell of the Huber-Wyderka table (e.g. AME(8,6), AME(8,4), AME(11,3))","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"akkadian-lacuna-restoration-heldout","cat":"ancient-texts","t":"Akkadian: restore masked/damaged signs in Oracc/eBL transliterations, beating the Lazar et al. 2021 held-out benchmark with frozen predictions","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"amicable-pair-smallest-ratio","cat":"number-hunts","t":"Amicable pairs: beat the smallest known ratio m/n","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"apn-new-ccz-class-dim9-10","cat":"crypto-math","t":"APN functions: a new CCZ-inequivalent APN function (or APN permutation) in dimension 9 or 10","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"arch-comp-ainncs-cartpole-full-initial-set","cat":"ml-robustness","t":"ARCH-COMP AINNCS CartPole (Balancing): verify or falsify 1e-3 settling of the neural controller on the full initial set","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"go2-monarch-of-the-mountain-scopf","cat":"optimization-benchmarks","t":"ARPA-E GO Competition Challenge 2 (SCOPF with switching): beat a Monarch of the Mountain best-known objective","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"cryoem-automated-model-building-completeness","cat":"biology","t":"Automated cryo-EM model building: raise completeness above ModelAngelo's 77% on its 177-map held-out set","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"synchronizing-avoiding-threshold-2n-2","cat":"graphs-games-automata","t":"Avoiding words in synchronizing automata: an automaton with n >= 8 states and 1-avoiding threshold 2n-2 (largest known example has 7 states), or one above 2n-2","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"bb33-bb25-cryptid-adjacent","cat":"number-hunts","t":"BB(3,3) non-Bigfoot holdouts and BB(2,5) non-Hydra holdouts","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"beale-1-and-3","cat":"unbroken-ciphers","t":"Beale ciphers #1 (location) and #3 (names): book-cipher key-text search","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"ccd-binary-gupta-nanoalloys-38-55","cat":"packings-physics","t":"Binary Gupta nanoalloys (Ag-Au, Cu-Ag, Cu-Au 55-atom; Cu-Au 38-atom; Li-Na and Na-K 55-atom): lower the best homotop energy for some composition","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"mint-binary-nonlinear-oa-strength","cat":"record-tables","t":"Binary orthogonal arrays with 2^m runs beyond every linear OA: higher strength than MinT's best known (smallest: OA(256, 20, 2, 4))","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"birdset-soundscape-cmap","cat":"ecology","t":"BirdSet soundscapes: beat the best published class-mean AP (mean 0.440 over seven test sites) for multi-label bird detection","k":"harvest","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"bloch-constant-lower-bound","cat":"erdos-and-proofs","t":"Bloch's constant B (C_57a): a certified lower bound above Wikstrom's sqrt(3)/4 + 0.0153 = 0.448312701 (claimed upper bound 0.471861652113, Zhang 2026)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"burnt-pancake-graph-diameter-n18","cat":"graphs-games-automata","t":"Burnt pancake graph diameter g(18) (OEIS A078941): decide 29 or 30","k":"standard","tr":2,"cp":"needs cluster for a ful\u2026","cb":"cluster"},{"id":"butson-hadamard-bh-n-6-undecided-orders","cat":"record-tables","t":"Butson Hadamard matrices BH(n,6): settle one of the undecided even orders below 100 (46, 74, 86, 94)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"hypercube-c4-free-erdos-86","cat":"erdos-and-proofs","t":"C4-free subgraphs of the hypercube (Erd\u0151s #86): settle ex(Q7,C4) in [304,308], beat 682 for Q8, or certify a bound below Baber's 0.60318","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"cami2-metagenome-assembly-strain-f1","cat":"genomics","t":"CAMI II metagenome assembly: beat MetaHipMer 2.2.0's strain F1 on the marine short-read co-assembly in the CAMI Benchmarking Portal","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"chess-ply-count-sequences-next-terms","cat":"recreational-math","t":"Chess from the opening position: the next term of the per-ply counts (distinct positions at ply 12, checkmates at ply 14, perft(16))","k":"harvest","tr":2,"cp":"needs cluster for perft","cb":"cluster"},{"id":"standard-map-golden-circle-breakup-rigorous-window","cat":"physics","t":"Chirikov standard map: shrink the rigorous window [0.9716, 0.9718] around the breakup of the golden invariant circle","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"hypercube-square-chromatic-q9-q11","cat":"graphs-games-automata","t":"Chromatic number of the square of the hypercube: is Q_9^2 13-colourable? (13 <= chi <= 14; n = 10, 11 also open)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"voronoi-lattice-chromatic-dim5-k12-bw16","cat":"graphs-games-automata","t":"Chromatic numbers of lattices (Voronoi graphs): settle a 5-dimensional primitive lattice, the Coxeter-Todd lattice K12 or the Barnes-Wall lattice BW16","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"av1324-inversion-monotonicity-conjecture","cat":"recreational-math","t":"Claesson-Jelinek-Steingrimsson conjecture: 1324-avoiders with k inversions never decrease from length n to n+1 (counterexample, or the first full table at n = 18)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"clay-cft-local-field-sorries","cat":"formal-proofs","t":"Clay Class Field Theory project: Herbrand quotient of local units and unramified cohomology vanishing","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-problems-computational-nt","cat":"number-hunts","t":"Computationally decidable open number-theory Erd\u0151s problems (erdosproblems.com)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"coco-trs-never-answered-confluence","cat":"formal-proofs","t":"Confluence Competition: certified YES/NO for a first-order TRS in ARI-COPS that no CoCo tool has answered since 2019","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"guts-n-player-asynchronous-coalition","cat":"graphs-games-automata","t":"Continuous Guts: is the asynchronous coalition value zero for every n >= 4?","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"conway-subprime-fibonacci-new-loop","cat":"number-hunts","t":"Conway's subprime Fibonacci sequences: a seventh non-trivial cycle, or an exhaustive check of starting pairs beyond 10^6","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"topswops-22-cards","cat":"recreational-math","t":"Conway's Topswops: the maximum number of steps for 22 cards (next term of OEIS A000375 after Chaffin's f(21) = 282), or longer 22- and 23-card decks","k":"harvest","tr":2,"cp":"needs cluster for the e\u2026","cb":"cluster"},{"id":"cryobench-heterogeneity-fsc-auc","cat":"biology","t":"CryoBench: beat the best published per-image FSC AUC for cryo-EM heterogeneity on a ground-truth dataset","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"cuneiform-sign-detection-maicubeda","cat":"ancient-texts","t":"Cuneiform sign detection on the open MaiCuBeDa 3D-rendering benchmark: beat a reproduced RepPoints baseline (AP@50/AP@75) on a fixed, period-filtered split","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"cunningham-chain-records","cat":"number-hunts","t":"Cunningham chains: beat a largest-known record for some length, or find a chain of length 21","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"cb-ctt-itc2007-comp-open-instances","cat":"optimization-benchmarks","t":"Curriculum-based course timetabling (ITC-2007 track 3, UD2): beat the best known penalty on an open comp instance","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"cycle-versus-complete-ramsey-small","cat":"record-tables","t":"Cycles versus complete graphs: close R(C4,K11) 40-43, R(C4,K12) 43-51 or R(C5,K9) 33-36","k":"harvest","tr":2,"cp":"laptop-hours for lower\u2026","cb":"hours"},{"id":"dagapeyeff-1939","cat":"unbroken-ciphers","t":"D'Agapeyeff cipher (1939 textbook challenge)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"wind-waves-dh-type2-missed-vs-cdaw","cat":"earth-and-sky","t":"Decametric-hectometric type II radio burst in open Wind/WAVES (and STEREO/WAVES) data absent from the CDAW type II list","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"degree-diameter-bipartite-table","cat":"record-tables","t":"Degree-diameter problem for bipartite graphs: a larger bipartite (d,k)-graph than the Combinatorics Wiki table","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"linf-certified-training-accuracy-records","cat":"ml-robustness","t":"Deterministic Linf certified accuracy records (MNIST 0.1/0.3, CIFAR-10 2/255 and 8/255, TinyImageNet 1/255): certify more test images than the best published model","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"lrx-cayley-diameter-sn","cat":"graphs-games-automata","t":"Diameter of the Cayley graph of S_n with generators (1,2) and the two n-cycle rotations (LRX): prove n(n-1)/2, or compute a(16) exactly","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"dujella-dn-quintuple-smallest-n","cat":"number-hunts","t":"Diophantine D(n)-quintuples: a quintuple with -255 < n < 256 (beat Dujella's n1 <= 256 or n2 >= -255)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"dreval-exvivo-beataml2-pdx-transfer","cat":"disease-research","t":"DrEval ex vivo transfer: beat the naive baseline when a cell-line drug-response model meets AML patient samples and breast-cancer PDX","k":"moonshot","tr":2,"cp":"laptop-days","cb":"days"},{"id":"ccd-dzugutov-zetterling-polytetrahedral-clusters","cat":"packings-physics","t":"Dzugutov, modified-Dzugutov and Z1/Z2 clusters: lower a putative global minimum in the Doye-Wales polytetrahedral tables","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"elliptic-curve-rank-small-conductor-records","cat":"number-hunts","t":"Elliptic curves over Q of rank r = 5..11 with smaller conductor than the Elkies-Watkins records","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"erdos-1082i-distinct-distances-general-position","cat":"erdos-and-proofs","t":"Erdos #1082(i): n points, no three collinear, with fewer than floor(n/2) distinct distances","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-1095-erdos-selfridge-function-g401","cat":"erdos-and-proofs","t":"Erdos #1095 (Ecklund-Erdos-Selfridge function g(k)): g(401) and beyond, or an independent replay of g(378..400)","k":"harvest","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"erdos-307-barbeau-prime-reciprocals","cat":"erdos-and-proofs","t":"Erdos #307 (Barbeau): disjoint prime sets P, Q with (sum 1/p)(sum 1/q) = 1","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-506-circles-small-n","cat":"erdos-and-proofs","t":"Erdos #506: minimum number of circles determined by n points, beating or closing the n <= 393 gap","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-617-balanced-coloring-r5","cat":"erdos-and-proofs","t":"Erdos #617 (Erdos-Gyarfas): balanced 5-colouring of K_26","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-699-binomial-gcd","cat":"erdos-and-proofs","t":"Erdos #699: a prime p >= i dividing gcd(C(n,i), C(n,j)), for a full proof","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-835-large-steiner-systems","cat":"erdos-and-proofs","t":"Erdos #835: (k+1)-colouring of J(2k,k), equivalently large sets of Steiner systems S(k-1,k,2k)","k":"harvest","tr":2,"cp":"pure thought + laptop-m\u2026","cb":"thought"},{"id":"sunflower-free-capacity-lower-bound","cat":"erdos-and-proofs","t":"Erdos-Szemeredi 3-sunflower-free capacity: beat the 1997 lower bound 1.551 (optimization constant C_49)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-217-crescent-configuration-n9","cat":"erdos-and-proofs","t":"Erd\u0151s #217 (crescent configurations): 9 points in general position whose 8 distances occur 1, 2, ..., 8 times","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"erdos-272-ap-intersection-families","cat":"erdos-and-proofs","t":"Erd\u0151s #272: more than C(N,2)+1+floor((N-1)/4) subsets of {1..N} with pairwise AP intersections, or the exact t(13)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"erdos-396-389-binomial-product-witnesses","cat":"number-hunts","t":"Erd\u0151s #396 and #389: the first n with (n)(n-1)...(n-17) dividing C(2n,n), or a first witness for #389 at n = 36","k":"harvest","tr":2,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"erdos-82-regular-induced-subgraph-ramsey","cat":"erdos-and-proofs","t":"Erd\u0151s #82 small cases: a graph on 21 vertices with no regular induced subgraph of order >= 6, or on 30 vertices with none of order >= 7","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"unit-distance-small-n","cat":"record-tables","t":"Erd\u0151s unit distance problem for small n: more unit distances among n points than the best known (n = 22..100)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"friedman-packing-records","cat":"record-tables","t":"Erich Friedman Packing Center: beat a listed packing","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"iig-benchmark-exact-nash-values","cat":"graphs-games-automata","t":"Exact Nash values of the ICLR-2026 imperfect-information benchmarks: Phantom Tic-Tac-Toe, Abrupt Phantom Tic-Tac-Toe, Abrupt 3x3 Dark Hex, 2-dice 5-face Liar's Dice","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"exominerpp-tess-2min-cv-pr-auc","cat":"planetary-science","t":"ExoMiner++ TESS 2-minute TCE vetting benchmark: beat the published 10-fold cross-validated PR-AUC (0.976) on the 57,162 labelled SPOC TCEs with the released folds","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"fasd13-few-shot-animal-sound-detection","cat":"ecology","t":"FASD13 few-shot animal sound detection: beat DRASDIC's 5-shot event F1 averaged over the twelve animal datasets","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"sloane-cohn-max-volume-polyhedra-s2","cat":"packings-physics","t":"Fejes Toth problem: N points on the unit sphere whose convex hull has larger volume than the best known (Hardin-Sloane-Smith and Deeter tables, N = 10..130 except 12)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"order-preserving-gray-path-n11","cat":"algorithms","t":"Felsner-Trotter order-preserving Gray paths: one for n = 11 (open for all n >= 11), or the exact count for n = 8 (OEIS A259839)","k":"moonshot","tr":2,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"fermat-numbers-new-factor","cat":"number-hunts","t":"Fermat numbers F_m = 2^(2^m)+1: a new prime factor not in Keller's table, above all for F12-F33","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"flip-aav-capsid-plmfit-spearman","cat":"biology","t":"FLIP AAV capsid fitness: beat the PLMFit scoreboard Spearman on the one-vs-rest (one_vs_many) split","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"flip-meltome-mixed-plmfit-spearman","cat":"biology","t":"FLIP meltome mixed split: beat the PLMFit scoreboard Spearman for melting temperature from sequence","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"fractional-plane-explicit-finite-udg-above-4","cat":"graphs-games-automata","t":"Fractional chromatic number of the plane: an explicit finite unit-distance graph with fractional chromatic number above 4 (best explicit: about 3.9898)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"gbm-counterpart-o4-gw-candidate","cat":"sky-archives","t":"Gamma-ray counterpart candidate in public Fermi-GBM data for an O4a/O4b gravitational-wave candidate, sub-threshold ones included","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"fermi-lat-pulsations-known-radio-pulsar","cat":"sky-archives","t":"Gamma-ray pulsations from a known radio pulsar not yet on the public list of LAT-detected pulsars","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"theobald-geometric-dissections-fewer-pieces","cat":"recreational-math","t":"Gavin Theobald's Geometric Dissections: a dissection with fewer pieces than the catalogue's best","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"collatz-type-maps-new-cycles","cat":"number-hunts","t":"Generalized Collatz maps: a cycle missing from the known lists (Lagarias 3x+k for k < 20000, 3x-k, and the three known 5x+1 cycles)","k":"harvest","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"generalized-repunit-first-prime-bases-to-1024","cat":"number-hunts","t":"Generalized repunits (b^p-1)/(b-1): a first (probable) prime for one of the 26 bases b <= 1024 with none known (smallest: b = 185)","k":"harvest","tr":2,"cp":"laptop-days per base fo\u2026","cb":"days"},{"id":"generalized-wagstaff-first-prime-bases-to-1024","cat":"number-hunts","t":"Generalized Wagstaff / negative-base repunits (b^p+1)/(b+1): a first (probable) prime for one of the 41 bases b <= 1024 with none known (smallest: b = 97)","k":"harvest","tr":2,"cp":"laptop-days per base","cb":"days"},{"id":"giuga-numbers-new","cat":"number-hunts","t":"Giuga numbers: find one not yet known","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"ccd-glue-potential-al-pb-clusters","cat":"packings-physics","t":"Glue-potential aluminium (N <= 190) and lead (N <= 160) clusters: lower a putative global minimum in Doye's polytetrahedral tables","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"graph-golf-order-degree-aspl","cat":"graphs-games-automata","t":"Graph Golf (order/degree and host-switch problems): beat a 2021 best diameter and average shortest path length","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"hypercube-q6-hamiltonian-paths","cat":"graphs-games-automata","t":"Gray codes: the number of Hamiltonian paths in the 6-cube (A091299(6), open since 2005)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"iphi-greek-inscription-attribution-ithaca","cat":"ancient-texts","t":"Greek inscriptions (I.PHI): beat Ithaca's region (70.8% top-1) and date (29.3 years) attribution on the PHI-digit-3 test split","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"iphi-greek-restoration-stoicheia-frozen3000","cat":"ancient-texts","t":"Greek inscriptions: beat Stoicheia v2 (CER 15.5, top-1 74.5) on the frozen 3,000-gap file cut from Ithaca's PHI-digit-3 test split","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"dclp-unidentified-literary-papyri","cat":"ancient-texts","t":"Greek literary papyri: identify DCLP 'unidentified' fragments as witnesses of known works via open-corpus text matching","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"gross-code-syndrome-circuit-distance","cat":"physics","t":"Gross code syndrome extraction: settle the Strikis-Browne-Beverland conjecture that their depth-8 circuit has circuit distance 11, or reach 12 with an interleaved circuit","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"lattice-animal-growth-constant-certified-bounds","cat":"physics","t":"Growth constants of lattice animals: a certified bound beating lambda_2 in [4.00253, 4.5252] for polyominoes or lambda_3 in [6.6799, 9.3835] for polycubes","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"gset-maxcut-nontoroidal-records","cat":"optimization-benchmarks","t":"Gset Max-Cut: a larger cut than the best published for a non-toroidal Gset graph (G60 14190, G61 5799, G63 27047, G64 8753, G70 9595, ...)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"hadamard-open-orders-below-10000","cat":"record-tables","t":"Hadamard conjecture frontier: a Hadamard matrix at one of the 85 orders up to 10000 with no known construction (smallest 2396)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"hadwiger-nelson-smaller-5-chromatic-udg","cat":"erdos-and-proofs","t":"Hadwiger-Nelson finite witnesses (Erdos #508 context): a 5-chromatic unit-distance graph with fewer than 509 vertices","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"hales-jewett-small-lower-bounds","cat":"record-tables","t":"Hales-Jewett numbers: beat HJ(3,3) >= 22 or HJ(4,2) >= 14 with an explicit line-free colouring","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"hall-conjecture-good-examples","cat":"number-hunts","t":"Hall's conjecture: new good examples beyond 10^29 or beat Elkies' ratio 46.6","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"grid-hamiltonian-cycles-28x28","cat":"graphs-games-automata","t":"Hamiltonian cycles on the 28 x 28 grid: the next term of OEIS A003763 (known to 26 x 26 since Pettersson 2014)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"apollonian-gasket-dimension-certified-digits","cat":"number-hunts","t":"Hausdorff dimension of the Apollonian gasket: more than Vytnova-Wormell's 128 rigorous decimals","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"heilbronn-records","cat":"record-tables","t":"Heilbronn triangle problem: new best configurations (square, triangle, convex region)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"vesuvius-9um-ink-never-seen-pherc0841","cat":"herculaneum-scrolls","t":"Herculaneum 9 \u00b5m ink detection on a never-seen scroll: beat every public 9 \u00b5m model's AUC on the three human-labelled PHerc. 0841 segments (9.366 \u00b5m / 113 keV) with a model that n\u2026","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"hg002-q100-gqc-automated-assembly-errors","cat":"genomics","t":"HG002 vs the Q100 genome benchmark: an automated diploid assembly with fewer GQC errors than the best listed non-curated assembly (38,072)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"dujella-torsion-rank-records-q","cat":"number-hunts","t":"High-rank elliptic curves over Q with prescribed torsion: beat a cell of Dujella's table","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"hilbert-numbers-degree-3-to-8-lower-bounds","cat":"wildcard","t":"Hilbert numbers H(3)..H(8): a planar polynomial vector field with more limit cycles than 13, 28, 37, 53, 74 or 96","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"read2016-ratsprotokolle-line-htr-closed","cat":"ancient-texts","t":"Historical handwriting (READ 2016 Ratsprotokolle, line level): beat HTR-ConvText's 3.6% CER and 15.7% WER on the 1,138 test lines without external data","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"hp-lattice-folding-benchmark-energies","cat":"biology","t":"HP lattice protein folding: beat a best-known energy on a standard 2D/3D benchmark sequence","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"hwmcc25-unsolved-first-certified","cat":"optimization-benchmarks","t":"HWMCC'25: first certified answer for a hardware model-checking benchmark that no participant solved","k":"harvest","tr":2,"cp":"laptop-days per benchma\u2026","cb":"days"},{"id":"pte-ideal-size-11-13","cat":"number-hunts","t":"Ideal Prouhet-Tarry-Escott solution of size 11 or 13","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"misere-quotient-period-5-element","cat":"graphs-games-automata","t":"Impartial misere quotients: exhibit an element of period 5 (or 8, or any period other than 1, 2, 3, 4, 6)","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"flt-imperial-unclaimed-prop-sorries","cat":"formal-proofs","t":"Imperial FLT project: fill an unclaimed Prop-valued sorry (de Smit-Lenstra representability, compact exponent-p groups, quaternion base change)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-moser-bound","cat":"number-hunts","t":"Improve the Erd\u0151s-Moser equation lower bound (beyond the 2026 claim m > 8.213e1,800,000,044)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"taxicab-7-upper-bound","cat":"number-hunts","t":"Improve the upper bound on Taxicab(7) (and higher taxicab bounds)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"queens-graph-chromatic-27","cat":"graphs-games-automata","t":"Is the 27 x 27 queens graph 27-colourable? (first open chromatic number of the queens graph)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"ispd2024-global-routing-best-score","cat":"engineering","t":"ISPD 2024 large-scale global routing benchmarks: a lower official evaluator cost than the best published router","k":"harvest","tr":2,"cp":"laptop-hours for benchm\u2026","cb":"hours"},{"id":"ispd2026-buffering-sizing-dominance","cat":"engineering","t":"ISPD 2026 contest (post-placement buffering and sizing): a result that dominates the per-design winner on every non-runtime metric","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"ito-negaperiodic-golay-pair-length-94","cat":"record-tables","t":"Ito's conjecture at t = 47: a negaperiodic Golay pair of length 94 (equivalently quasi-Williamson matrices of order 47)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"wilds-iwildcam-ood-macro-f1","cat":"ecology","t":"iWildCam2020-WILDS camera-trap species ID: beat the leaderboard's best out-of-distribution test macro F1 (52.0, AutoFT)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"jsp-optimizizer-open-upper-bounds","cat":"optimization-benchmarks","t":"Job-shop scheduling: lower the makespan upper bound on an open Taillard / Demirkol / SWV / YN / ABZ instance (Optimizizer tables)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"komlos-constant-lower-bound","cat":"erdos-and-proofs","t":"Komlos discrepancy constant C_24: a finite matrix with unit-norm columns whose discrepancy beats Kunisky's 1 + sqrt(2)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"kourovka-16-46-conder-finite-quotient","cat":"wildcard","t":"Kourovka 16.46 (Conder): does the index-8 subgroup K of an amalgam acting on the 3-valent tree have a non-trivial finite quotient?","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"led-latin-inscription-attribution-aeneas","cat":"ancient-texts","t":"Latin inscriptions (LED): beat Aeneas on dating (13.4 years) and province attribution (72.3% top-1) on the id-digit-3 test split","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"latin-tableau-conjecture","cat":"erdos-and-proofs","t":"Latin Tableau Conjecture (Chow et al.): a Young diagram with no Latin tableau of type delta, or a certified extension of the 12 x 12 verification","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"lazy-beaver-missing-cells","cat":"graphs-games-automata","t":"Lazy Beaver: compute a missing LB(n, m) value (LB(7,2), LB(5,3), LB(4,4), LB(3,5) or LB(2,7))","k":"standard","tr":2,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"leancamcombi-bkr-reimer-inequality","cat":"formal-proofs","t":"LeanCamCombi: formal proof of the van den Berg-Kesten-Reimer inequality (card_certificator_le)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"lebesgue-universal-cover-bounds","cat":"record-tables","t":"Lebesgue's universal covering problem (C13b): a certified lower bound above 0.8344 or a convex cover below 0.8440935944","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"legendre-pairs-open-odd-lengths","cat":"record-tables","t":"Legendre pairs: settle an open odd length below 200 (115, 145, 159, 161, 169, 175, 177, 185, 187, 195)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"levine-hat-two-player-value","cat":"graphs-games-automata","t":"Levine's two-player hat puzzle: tighten the published 7/20 and 81/224 bounds, and certify finite-stack optima","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"linear-a-kuro-arithmetic","cat":"undeciphered-scripts","t":"Linear A: KU-RO totals and fraction-sign values reconciled by arithmetic","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"unit-demand-lottery-vs-item-pricing-gap","cat":"graphs-games-automata","t":"Lotteries vs item prices for a unit-demand buyer with independent values: an explicit menu earning more than (1 + ln2/5) ~ 1.1386 times any item pricing (gap [1.1386, 3])","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"lottery-numbers-l-n-6-6-2-beyond-70","cat":"record-tables","t":"Lottery numbers L(n,6,6,2) for n >= 71: fewest 6-number tickets that guarantee a 2-match prize (UK-lottery problem, past the published range)","k":"harvest","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"labs-merit-factor-records","cat":"record-tables","t":"Low-autocorrelation binary sequences: best-known merit factors for lengths 67-600","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"luna16-nodule-detection-cpm-10fold","cat":"disease-research","t":"LUNA16 lung-nodule detection and false-positive reduction: beat the best CPM (0.951 detection, 0.968 false-positive reduction) under the official 10-fold protocol","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"m4-competition-beat-nbeats-owa","cat":"machine-learning","t":"M4 competition (100,000 series): an honestly out-of-sample point forecast with overall OWA below N-BEATS's 0.795","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"m5-accuracy-beat-winner-wrmsse","cat":"machine-learning","t":"M5 accuracy competition (Walmart unit sales): beat the winning private WRMSSE 0.52044 with a frozen, test-blind pipeline","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"m5-uncertainty-beat-winner-wspl","cat":"machine-learning","t":"M5 uncertainty competition: beat the winning private WSPL 0.15420 for nine-quantile Walmart sales forecasts","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"madry-cifar10-challenge-whitebox-below-leader","cat":"ml-robustness","t":"MadryLab CIFAR-10 challenge (white-box, Linf 8/255): push the secret model's accuracy below 43.95%","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"magic-state-distillation-fewest-qubits","cat":"physics","t":"Magic-state distillation footprint: a distance-4 T-to-T protocol on 8 or 9 qubits (known 8 <= N_T(4) <= 10), or distance 5 on at most 10 qubits","k":"standard","tr":2,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"insight-marsquake-missed-vs-mqs-v14","cat":"earth-and-sky","t":"Marsquake in open InSight SEIS waveforms absent from the Marsquake Service catalogue V14 and the MarsQuakeNet extension","k":"harvest","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"latin-max-transversals-n10-20","cat":"record-tables","t":"Maximum number of transversals T(n): a Latin square of order 10 with more than Parker's 5504, or a new record for n = 11..20","k":"harvest","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"parsimony-benchmark-best-scores","cat":"biology","t":"Maximum parsimony: a tree with fewer steps than the best-known score on a classic benchmark alignment","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"partial-spreads-smallest-open-cases","cat":"record-tables","t":"Maximum partial spreads: settle 129 <= A_2(11,8;4) <= 132 or 244 <= A_3(8,6;3) <= 248","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"meroitic-semantic-induction","cat":"undeciphered-scripts","t":"Meroitic: meanings for unknown words from distribution, validated on held-out known words","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"mertens-ratio-oscillation-hurst-bounds","cat":"number-hunts","t":"Mertens function oscillations: a certified bound beating Hurst's liminf M(x)/sqrt(x) < -1.837625 or limsup > 1.826054","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"minlplib-finance-open-instances","cat":"optimization-benchmarks","t":"MINLPLib finance and marketing instances still open: beat saa_2 (strategic asset allocation) or close pricing050 (product pricing) with a certificate","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"minlplib-open-primal-bound","cat":"optimization-benchmarks","t":"MINLPLib: better feasible point for an open mixed-integer nonlinear instance","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"misere-sprouts-21-spots","cat":"graphs-games-automata","t":"Mis\u00e8re Sprouts: settle the 21-spot game (first unknown since 2011)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"modded-nanogpt-track3-fewest-steps","cat":"machine-learning","t":"Modded-NanoGPT track 3 (optimization): reach 3.28 FineWeb val loss with the fixed GPT-2-small setup in fewer than 2,690 steps (2,450 pending)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"mols-lower-bounds-small-orders","cat":"record-tables","t":"MOLS table: more mutually orthogonal Latin squares of some order n < 500 than the current lower bound (e.g. 4 MOLS of order 22)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"monostable-polyhedron-fewer-than-14-faces","cat":"recreational-math","t":"Monostable polyhedron with fewer faces: a homogeneous convex polyhedron that rests stably on only one face, with fewer than Reshetov's 14 faces","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"monusac-2020-test-weighted-pq","cat":"disease-research","t":"MoNuSAC 2020 nucleus segmentation and classification: beat TIA-Lab's challenge-best PQ 0.6119 on the public test set","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"monuseg-2018-test-aji","cat":"disease-research","t":"MoNuSeg 2018 multi-organ nucleus segmentation: beat the best published AJI (0.7063; challenge best 0.6907) on the public 14-image test set","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"mordell-curve-rank-records","cat":"number-hunts","t":"Mordell curves y^2 = x^3 + k: a smaller |k| of given rank 7..16 than the OEIS upper bounds, or rank >= 18","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"moser-worm-convex-cover-bounds","cat":"record-tables","t":"Moser's worm problem (convex covers, C13a): certify a lower bound above 0.239 or a rotation-only convex cover below 0.257883595","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"binary-action-games-max-nash-equilibria","cat":"graphs-games-automata","t":"Most Nash equilibria in a generic 4-player game with two actions each: find 39 or more (bounds 37 and 65), refuting Hertling-Vuji\u0107 Conjecture 4.5","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"multi-controlled-z-t-count-below-4n-6","cat":"physics","t":"Multi-controlled Z with fewer T gates: an exact C^nZ (n >= 4 controls) with T-count below Gidney-Jones' 4n - 6","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"multimagie-smallest-multiplicative-addmult","cat":"recreational-math","t":"Multimagie.com: smaller best-known multiplicative or additive-multiplicative magic squares (orders 7-17)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"gf2-polymult-8term-25-products","cat":"algorithms","t":"Multiply two 8-term binary polynomials with 25 products (NIST open problem), or a smaller GF(2^8) AES-field multiplier circuit","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"mtc3-double-transposition-reloaded","cat":"unbroken-ciphers","t":"MysteryTwister 'Double Column Transposition Reloaded' Parts 1-3 (0 solvers since 2013)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"mtc3-spirale-4","cat":"unbroken-ciphers","t":"MysteryTwister 'Spirale Part 4' (hand 'OTP' cipher, 0 solvers)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"mtc3-spanish-strip-cipher-3","cat":"unbroken-ciphers","t":"MysteryTwister Spanish Strip Cipher Part 3 (Spanish Civil War telegram, 0 solvers)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"ccmc-cme-arrival-scoreboard-mae-2023-2024","cat":"earth-and-sky","t":"NASA CCMC CME Scoreboard: CME arrival-time forecasts for 2023-2024 with a lower mean absolute error than every scoreboard method","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"abc-high-quality-triples","cat":"number-hunts","t":"New high-quality abc triples (q >= 1.4, c > 10^20) or beat Reyssat's 1.6299","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"giant-planet-satellite-archival-shift-and-stack","cat":"planetary-science","t":"New irregular (or small inner) satellite of Jupiter, Saturn, Uranus or Neptune in public archival images, shown bound by an orbit fit","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"mw-satellite-candidate-not-in-lvdb","cat":"sky-archives","t":"New Milky Way satellite (ultra-faint dwarf or faint halo star cluster) in public DECam or Legacy Surveys catalogues, absent from the Local Volume Database","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"parkes-archival-new-pulsar-candidate","cat":"sky-archives","t":"New pulsar candidate in public Parkes (Murriyang) search-mode archival data, detected in two independent observations and absent from all pulsar lists","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"mahler-measure-new-small-polynomials","cat":"number-hunts","t":"New small-Mahler-measure polynomials / Salem numbers beyond the proven-complete ranges","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"no-three-in-line-n75","cat":"graphs-games-automata","t":"No-three-in-line: 150 points on the 75x75 grid (smallest open n)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"swpc-3day-kp-g1-slot-hss-2025","cat":"earth-and-sky","t":"NOAA SWPC 3-day forecast 2025: beat SWPC's Heidke skill for G1+ (Kp >= 5-) 3-hour slots at 1-3 day lead","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"noise-backprop-free-pretraining-records","cat":"machine-learning","t":"Noise: pretraining a fixed 37.7M transformer without backpropagation, below 3.338 val loss on 30M FineWeb tokens","k":"harvest","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"noita-eye-messages","cat":"unbroken-ciphers","t":"Noita Eye Messages (designed game cipher, developer-confirmed real)","k":"moonshot","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"gnu-unknown-orders-below-20000","cat":"wildcard","t":"Number of groups of order n: settle an order up to 20,000 that is still unknown in Max Horn's table (smallest: 3072, 4096, 4608, 5120, 6144, 6400, 6912, 7168)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"numerical-semigroups-count-genus-81-frobenius-133","cat":"number-hunts","t":"Numerical semigroups: the next exact count by genus (n_81, OEIS A007323) or by Frobenius number (N_133, OEIS A124506)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"curtois-nrp-open-gaps-bcv-mer-instance24","cat":"optimization-benchmarks","t":"Nurse rostering benchmark (Curtois / schedulingbenchmarks.org): close an open gap on BCV-3.46.1, MER or Instance24","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"ssh-mapping-natl60-2020a-osse","cat":"earth-and-sky","t":"Ocean data challenge 2020a (SSH mapping OSSE, NATL60): beat a leaderboard resolution score","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"octahedron-ramsey-number","cat":"graphs-games-automata","t":"Octahedron Ramsey number: is R(K_{2,2,2}, K_{2,2,2}) 30 or 31?","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"odd-boolean-nonlinearity-9-11-13","cat":"record-tables","t":"Odd-variable Boolean nonlinearity: exceed 242, 996 or 4040","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"ogbg-molhiv-beat-leaderboard-roc-auc","cat":"drug-discovery","t":"OGB ogbg-molhiv: beat the leaderboard's top mean test ROC-AUC under the official protocol","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"ogbl-collab-beat-leaderboard-hits50","cat":"machine-learning","t":"OGB ogbl-collab: beat the leaderboard's top test Hits@50 (0.7129) for future co-authorship prediction","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"orchard-planting-small-n-records","cat":"record-tables","t":"Orchard planting: more 3-point or 4-point lines among n points than the best known (3 per row for n >= 17, 4 per row for n >= 21)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"oriented-chromatic-planar-girth-lower-bounds","cat":"graphs-games-automata","t":"Oriented chromatic number of planar graphs by girth: an explicit planar oriented graph beating a lower bound (18..80, 11..40, 7..16, 7..11, 6..7, 5..7, 5..6)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"rectangle-piercing-packing-ratio-above-5-2","cat":"graphs-games-automata","t":"Packing vs piercing for axis-parallel rectangles after Wegner's conjecture fell: a finite family with tau > (5/2) nu","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"packomania-csqv-sum-of-radii","cat":"algorithms","t":"Packomania csqv: circles in the unit square with maximised sum of radii (AlphaEvolve problem), beat a table entry","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"pancake-number-p20","cat":"graphs-games-automata","t":"Pancake numbers: settle P(20), the diameter of the 20-pancake graph (OEIS A058986), now known to lie in {22, 23, 24}","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"vesuvius-scroll1-fiber-tracing-afv","cat":"herculaneum-scrolls","t":"Papyrus fiber tracing on Scroll 1 (PHerc. Paris 4, 2.4 \u00b5m): beat the published automated fiber volume on precision against dense hand tracing with no loss of recall in the held-ou\u2026","k":"harvest","tr":2,"cp":"laptop-days at best","cb":"days"},{"id":"vesuvius-surface-topo-holdout","cat":"herculaneum-scrolls","t":"Papyrus surface detection: beat the released Kaggle-2026 1st-place nnU-Net (surface_m7_nnunet) on a frozen 88-volume holdout of the open 320^3 training mirror under a pinned open\u2026","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"periodic-golay-pairs-undecided-lengths","cat":"record-tables","t":"Periodic Golay pairs: settle an undecided length up to 300 (smallest 106)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"pfsp-taillard-open-makespans","cat":"optimization-benchmarks","t":"Permutation flow shop (Taillard benchmarks): a makespan below the best known for one of the 12 open Taillard instances, with VRF instances as partial wins","k":"harvest","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"pesplib-periodic-timetabling-records","cat":"optimization-benchmarks","t":"PESPlib periodic timetabling: lower the best known weighted slack of a railway instance R1L1..R4L4","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"asteroid-tumbler-npa-model-not-in-damit","cat":"planetary-science","t":"Physical model of a tumbling (non-principal-axis) asteroid from public lightcurves, beyond the tumbler models in DAMIT","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"polycubes-3d-next-term-n23","cat":"graphs-games-automata","t":"Polycubes: the number of 23-cell polycubes (next term of OEIS A001931 fixed and A000162 / A038119 free, open since Phillip Thompson's n = 22 in 2024)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"pzktupel-largest-ktuplet-stale-patterns","cat":"recreational-math","t":"Prime k-tuplets: a larger proven prime k-tuplet than the largest known for a stale (k, pattern) row (k = 11..17)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"proteinbench-atlas-ensemble-distribution","cat":"biology","t":"ProteinBench (ATLAS): beat the best published conformational-ensemble distribution metrics for proteins","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"lychrel-new-base-proof","cat":"number-hunts","t":"Prove Lychrel numbers exist in a new base (mechanical template-closure proof)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"psplib-j120-rcpsp-upper-bounds","cat":"optimization-benchmarks","t":"PSPLIB J120 (single-mode RCPSP): lower a best known heuristic makespan on an unproven instance","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"quark-gluon-pythia-tagging-auc-record","cat":"particle-physics","t":"Pythia quark-gluon jet tagging (Komiske-Metodiev-Thaler dataset): beat PELICAN's AUC 0.9252 with particle-ID inputs","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"binary-coefficient-apn-dimension-11","cat":"record-tables","t":"Quadratic APN functions with coefficients in F2 in dimension 11: a seventh CCZ class","k":"standard","tr":2,"cp":"laptop-days for a bound\u2026","cb":"days"},{"id":"quasi-symmetric-2-designs-open-feasible","cat":"record-tables","t":"Quasi-symmetric 2-designs: construct one for an open feasible parameter set with v <= 78 (smallest 2-(33,15,35), x=6, y=9)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"quaternary-hermitian-self-dual-largest-min-weight","cat":"record-tables","t":"Quaternary Hermitian self-dual codes: an extremal [32,16,12] code, or a better minimum weight at length 42, 48, 54 or 60","k":"standard","tr":2,"cp":"laptop-days for quasi-t\u2026","cb":"days"},{"id":"queens-domination-26","cat":"graphs-games-automata","t":"Queen domination of the 26 x 26 board: 13 or 14 queens? (first open value of OEIS A075458)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"qfo-swisstree-orthology-dominance","cat":"genomics","t":"Quest for Orthologs 2022 SwissTree benchmark: ortholog predictions that beat every public method on recall and precision at once","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"quoridor-4x7-7-walls-exact","cat":"graphs-games-automata","t":"Quoridor 4x7, 7 walls per player: exact initial outcome","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"schur-number-lower-bounds","cat":"graphs-games-automata","t":"Raise the lower bound on Schur numbers S(6) / S(7) or weak Schur WS(6)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"random-assignment-dec-ef-conjecture","cat":"graphs-games-automata","t":"Random assignments: a finite SD-EF assignment with no Dec-EF decomposition (counterexample to Li-He-Li Conjecture 1)","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"dream-random-promoter-yeast-expression","cat":"biology","t":"Random Promoter DREAM Challenge: beat the best published Pearson/Spearman score for predicting yeast expression from promoter sequence","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"randomized-list-update-partial-cost-bounds","cat":"algorithms","t":"Randomized list update (partial cost model): a lower bound above Ambuhl's 1.50115, or a 5-item algorithm certified below COMB's 1.6","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"rectangular-sliding-puzzle-gods-numbers","cat":"graphs-games-automata","t":"Rectangular sliding-tile puzzles: the first unknown God's numbers of the m x n table (OEIS A151944): 3x6, 2x9, 4x5","k":"harvest","tr":2,"cp":"needs cluster for an ex\u2026","cb":"cluster"},{"id":"boolean-degree-relevant-variables-c44","cat":"erdos-and-proofs","t":"Relevant variables of degree-d Boolean functions (C_44): beat the 3/2 lower bound with an explicit function","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"restricted-additive-2-bases-k48","cat":"record-tables","t":"Restricted additive 2-bases (restricted postage stamp, A006638): beat the Challis-Robinson symmetric-basis ranges for 48 <= k <= 82, or settle a(48)","k":"harvest","tr":2,"cp":"laptop-days for preambl\u2026","cb":"days"},{"id":"robbins-problem-minimal-expected-rank-bounds","cat":"wildcard","t":"Robbins' problem (full-information expected rank): a certified bound beating 1.908 <= V <= 2.32614","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"robustbench-cifar10-l2-beat-autoattack","cat":"ml-robustness","t":"RobustBench CIFAR-10 L2 (eps 0.5): lower a listed model's robust accuracy below the leaderboard value with a stronger L2 attack","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"robustbench-cifar10-linf-beat-autoattack","cat":"ml-robustness","t":"RobustBench CIFAR-10 Linf (eps 8/255): a stronger attack that lowers a listed model's robust accuracy below the leaderboard value","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"robustbench-imagenet-linf-beat-autoattack","cat":"ml-robustness","t":"RobustBench ImageNet Linf (eps 4/255): lower a listed model's robust accuracy below the best published value with a stronger attack","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"rupert-open-classical-solids","cat":"recreational-math","t":"Rupert's problem for the nine undecided classical solids: snub cube, snub dodecahedron, deltoidal and pentagonal hexecontahedra, Johnson solids J72-J75 and J77","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"r3-212-salem-spencer-unit-gap","cat":"number-hunts","t":"Salem-Spencer sets: settle r_3(212) in {43, 44}, or beat a Wr\u00f3blewski nonaveraging record a(n)","k":"standard","tr":2,"cp":"needs cluster for a com\u2026","cb":"cluster"},{"id":"sartori-buriol-pdptw-bks","cat":"optimization-benchmarks","t":"Sartori-Buriol real-road PDPTW instances (100-5000 locations): hierarchically beat a best known solution in the live GitHub table","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"sat-competition-2026-unknown-first-solve","cat":"optimization-benchmarks","t":"SAT Competition 2026: first certified solve of a Main-track instance whose result is unknown","k":"harvest","tr":2,"cp":"laptop-days per instance","cb":"days"},{"id":"sctab-cellxgene-donor-holdout-macro-f1","cat":"biology","t":"scTab cross-tissue cell-type annotation: beat macro F1 0.8441 on the CELLxGENE donor-held-out test split (164 cell types)","k":"standard","tr":2,"cp":"needs cluster or a GPU\u2026","cb":"cluster"},{"id":"saw-connective-constant-rigorous-bounds-2d","cat":"physics","t":"Self-avoiding walks: a certified bound on the square-lattice connective constant beating Couronne's upper bound 2.662342426 (2022) or Jensen's lower bound 2.625622 (2004)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"semigroups-order-10-up-to-isomorphism","cat":"wildcard","t":"Semigroups of order 10 up to isomorphism (OEIS A027851(10)), equivalently the self-converse semigroups of order 10, or the labeled count A023814(10)","k":"harvest","tr":2,"cp":"needs cluster for the f\u2026","cb":"cluster"},{"id":"hadamard-ingredient-sequences-smallest-open","cat":"record-tables","t":"Sequences behind Hadamard constructions: settle a smallest open case in Table 3 of arXiv:2610.27175 (T-sequences, base sequences, Williamson-type matrices, Golay pairs)","k":"harvest","tr":2,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"shannon-capacity-odd-cycles","cat":"record-tables","t":"Shannon capacity of odd cycles: larger independent sets in strong powers","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"superpermutations-n7-n8","cat":"record-tables","t":"Shorter superpermutations for n=7 (below 5905) or n=8 (below 46188)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"lucas-chain-cl51","cat":"number-hunts","t":"Shortest Lucas (differential addition) chains: compute C_L(51), the smallest n whose shortest Lucas chain has length 51 (OEIS A104892)","k":"standard","tr":2,"cp":"laptop-days to a week","cb":"days"},{"id":"triorthogonal-codes-shortest-k1","cat":"physics","t":"Shortest triorthogonal (transversal-T) codes [[n,1,d]] at d >= 7: beat the Jain-Albert table, e.g. distance 7 with fewer than 95 qubits","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"all-permutations-supersequence-karp","cat":"recreational-math","t":"Shortest word containing every permutation of 1..n as a subsequence (Karp's problem, OEIS A062714): settle n = 10, or circular n = 7","k":"standard","tr":2,"cp":"laptop-minutes to check\u2026","cb":"min"},{"id":"sic-povm-new-dimension-numerical","cat":"physics","t":"SIC-POVMs: the first publicly posted numerical Weyl-Heisenberg SIC fiducial in a dimension d >= 194 (outside known families)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"silesia-per-file-specialized-record","cat":"compression-and-golf","t":"Silesia corpus: beat the best per-file compressed size with a specialized open-source model","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"cubic-lattices-percolation-thresholds-digits","cat":"physics","t":"Simple cubic, bcc, fcc and diamond percolation thresholds: beat the Xu-Wang-Lv-Deng (2014) precision, e.g. sc site 0.31160768(15), sc bond 0.24881185(10)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"fewest-vertex-non-rupert-polyhedron","cat":"recreational-math","t":"Simplest non-Rupert polyhedron: certify a convex polyhedron with fewer than 60 vertices that is not Rupert (Zeng's 8-vertex stellated tetrahedron P_11/20 is the leading candidate)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"folding-ddg-s461-megascale-records","cat":"biology","t":"Single-point folding stability ddG: beat the published Pearson on the leak-controlled S461 blind set (and the Megascale split record)","k":"standard","tr":2,"cp":"laptop-hours for S461 i\u2026","cb":"hours"},{"id":"z3-site-percolation-rigorous-lower-bound","cat":"physics","t":"Site percolation on the cubic lattice Z^3: a certified lower bound on p_c above Georgakopoulos-Panagiotis's 0.2522 (2023)","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"z3-site-percolation-rigorous-upper-bound","cat":"physics","t":"Site percolation on the cubic lattice Z^3: an explicit certified upper bound on p_c below Campanino-Russo's 1/2 (1985)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"skempi2-binding-ddg-external-validation","cat":"biology","t":"SKEMPI 2.0 binding ddG: beat the published external-validation Pearson on the fixed S1131 and M1707 test sets","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"skew-hadamard-unknown-orders","cat":"record-tables","t":"Skew-Hadamard matrices: an order where none is known (smallest 356 = 4*89)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"small-steiner-3-designs-open","cat":"record-tables","t":"Small Steiner 3-designs: construct S(3,5,41), S(3,6,46) or S(3,5,50), the open cases with v <= 50","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"small-ramsey-lower-bounds","cat":"record-tables","t":"Small two-color Ramsey numbers: new lower bounds via explicit graphs","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"smallest-cubic-crossing-number-graphs","cat":"graphs-games-automata","t":"Smallest cubic graphs with crossing number 12-15: beat an upper bound in OEIS A110507 (a(12) <= 30, a(13) <= 30, a(14) <= 36, a(15) <= 40)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"snark-girth-7-smallest","cat":"graphs-games-automata","t":"Smallest snark of girth 7: find one below 298 vertices (none exist up to 42), or a cyclically 7-edge-connected snark","k":"standard","tr":2,"cp":"laptop-days for structu\u2026","cb":"days"},{"id":"qrac-qutrit-three-trits-smallest-open","cat":"physics","t":"Smallest unsolved quantum random access code: three trits into one qutrit (n = d = D = 3), best 0.69715 vs bounds 0.69853 (projective only) and about 0.699 (general POVMs, floatin\u2026","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"smtlib-quantified-uf-uflia-unknown-refutation","cat":"formal-proofs","t":"SMT-LIB quantified UF and UFLIA: a checked refutation or model for an unknown-status benchmark never decided at SMT-COMP","k":"harvest","tr":2,"cp":"laptop-hours per benchm\u2026","cb":"hours"},{"id":"social-golfer-design-table-gaps","cat":"optimization-benchmarks","t":"Social Golfer Problem (CSPLib 010): more rounds than the 2026 Miller-Valkov-Abel table for a (v,k) cell with at most 10 groups per round","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"tamam-shud-initialism","cat":"unbroken-ciphers","t":"Somerton Man (Tamam Shud) code: exact initialism source search","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"sparse-ruler-excess-zero-beyond-213","cat":"record-tables","t":"Sparse rulers (minimal difference bases): fewer marks than Pegg's best-known table at some length n >= 245","k":"harvest","tr":2,"cp":"laptop-hours for constr\u2026","cb":"hours"},{"id":"gsp-pure-nash-poa-conjecture","cat":"graphs-games-automata","t":"Sponsored-search GSP auction: a full-information pure Nash equilibrium (no overbidding) with welfare ratio above 1.259134, refuting the 2010 Lucier-Paes Leme conjecture (proven up\u2026","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"square-site-percolation-threshold-13th-digit","cat":"physics","t":"Square-lattice site percolation threshold: settle the 5-sigma clash between Yang-Zhou's 0.5927460507896(1) and Jacobsen's 0.59274605079016(1) (2024)","k":"standard","tr":2,"cp":"needs cluster","cb":"cluster"},{"id":"magic-state-stabilizer-rank-exponents","cat":"physics","t":"Stabilizer rank of magic states: an exact decomposition of |T>^{(x)m} or |F>^{(x)m} into fewer stabilizer states than the best published exponent allows","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"superbridge-index-jeon-jin-candidates","cat":"wildcard","t":"Superbridge index: a polygon realising superbridge index 3 for one of Jeon-Jin's nine candidates (5_2, 6_1, ..., 8_9), or 4 for a 9-10 crossing knot listed [4,5]","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"superpatterns-seven-exact-length","cat":"recreational-math","t":"Superpatterns: the shortest permutation containing all 5040 patterns of length 7 (OEIS A342474(7)), or the next row of A373778","k":"standard","tr":2,"cp":"laptop-hours for upper-\u2026","cb":"hours"},{"id":"swot-karin-noise-filtering-2022a","cat":"earth-and-sky","t":"SWOT KaRIn noise-filtering data challenge 2022a: beat the leaderboard's best vorticity or current RMSE on cycle 13","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"symmetric-rendezvous-records","cat":"graphs-games-automata","t":"Symmetric rendezvous search: a line strategy below Han et al.'s 4.2574 (unchanged since 2008) or a four-location strategy beating FSD","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"termcomp-tpdb-never-solved-certified","cat":"formal-proofs","t":"Termination Competition: a CeTA-certified termination or nontermination proof for a TPDB rewriting benchmark never solved at termCOMP 2023-2026","k":"harvest","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"ternary-self-dual-largest-min-weight-12m","cat":"record-tables","t":"Ternary self-dual codes: raise the largest known minimum weight at length 84, 108 or 120","k":"standard","tr":2,"cp":"laptop-days for structu\u2026","cb":"days"},{"id":"cryptocellar-truppenschluessel-1941","cat":"unbroken-ciphers","t":"The last 7 unbroken German Army Truppenschl\u00fcssel (TS) hand-cipher messages, 1941 (CryptoCellar)","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"r-sols-order-14-r-193","cat":"record-tables","t":"The last open case of the r-self-orthogonal Latin square spectrum: a 193-SOLS of order 14","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"adfgvx-1918-nine-open","cat":"unbroken-ciphers","t":"The still-open 1918 ADFGVX radiograms (Childs collection, Lasry/Schmeh 2017 challenge)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"three-agent-additive-chores-efx","cat":"graphs-games-automata","t":"Three agents dividing additive chores: does a complete EFX allocation always exist?","k":"standard","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"all-in-three-player-ruin-angel-holmes-conjecture","cat":"graphs-games-automata","t":"Three-player all-in betting game (Angel-Holmes): is being short-stacked always worse than tying your opponent? Prove or refute Conjecture 9","k":"standard","tr":2,"cp":"laptop-hours for a poin\u2026","cb":"hours"},{"id":"three-player-kuhn-equilibrium-completeness","cat":"graphs-games-automata","t":"Three-player Kuhn poker: does the Szafron-Gibson-Sturtevant family contain every Nash equilibrium (on the path of play)?","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"three-player-von-neumann-poker-equilibrium","cat":"graphs-games-automata","t":"Three-player von Neumann poker (Krityakierne-Thanatipanonda-Zeilberger 2024): is the conjectured threshold equilibrium a Nash equilibrium at bet size 2?","k":"standard","tr":2,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"slide-24-puzzle-lower-bound","cat":"graphs-games-automata","t":"Tighten God's number bounds for the 24-puzzle (5x5 sliding tiles, STM)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"revenge-gods-number-bounds","cat":"graphs-games-automata","t":"Tighten God's number bounds for the 4x4x4 cube (OBTM)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"tsb-ad-m-beat-leaderboard-vus-pr","cat":"machine-learning","t":"TSB-AD multivariate anomaly detection: beat the leaderboard's best average VUS-PR on the evaluation set","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"varbench-variational-energy-records","cat":"physics","t":"VarBench: a lower variational ground-state energy than every row of a VarBench table (e.g. J1-J2 10x10 at J2 = 0.8-1.0, pyrochlore, triangular, kagome)","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"tsp-vlsi-open-tours","cat":"optimization-benchmarks","t":"VLSI TSP collection (Bonn / Waterloo): a shorter tour for one of the 30 unsolved instances (14,233 to 744,710 cities)","k":"harvest","tr":2,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"vnncomp-verifier-holds-soundness-counterexample","cat":"ml-robustness","t":"VNN-COMP verifier soundness: a validated counterexample for an instance that a participating tool certified as 'holds'","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"voynich-generator-heldout-fingerprints","cat":"undeciphered-scripts","t":"Voynich: a manually executable generator that matches held-out structural fingerprints, or a decisive falsification of the Naibbe cipher","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"walshaw-graph-partitioning-archive","cat":"optimization-benchmarks","t":"Walshaw Graph Partitioning Archive: beat a best known edge cut (k = 2..64, 0/1/3/5% imbalance)","k":"harvest","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"s2s-ai-challenge-2020-rpss","cat":"earth-and-sky","t":"WMO S2S AI Challenge: beat the best RPSS for week 3-4 and 5-6 temperature and precipitation tercile forecasts in 2020","k":"standard","tr":2,"cp":"laptop-days","cb":"days"},{"id":"censorship-manual-steganograms","cat":"unbroken-ciphers","t":"WWII British censorship manual steganograms: locate the Morse code in the fashion drawing and recover the German text in the Amsterdam map","k":"standard","tr":2,"cp":"laptop-hours","cb":"hours"},{"id":"zarankiewicz-k33-k44-square-next-values","cat":"record-tables","t":"Zarankiewicz numbers for K_{3,3} and K_{4,4}: the exact values z(17;3,3) and z(14;4,4) (next terms of OEIS A001198 and A006616)","k":"harvest","tr":2,"cp":"laptop-days","cb":"days"},{"id":"magic-square-squares-7","cat":"number-hunts","t":"3x3 magic square with >= 7 square entries (second example) or nine squares","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"fourth-powers-three-ways-taxicab-4-2-3","cat":"number-hunts","t":"A number that is a sum of two fourth powers in three different ways (Taxicab(4,2,3))","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"abelian-difference-sets-open-ljcr","cat":"record-tables","t":"Abelian difference sets: settle an 'Open' group entry with v <= 1000 in Gordon's La Jolla Difference Set Repository","k":"harvest","tr":1,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"alphaevolve-analytic-constants","cat":"record-tables","t":"AlphaEvolve-family analytic constants: autocorrelation inequalities and Erdos minimum overlap","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"aac-second-counterexample","cat":"number-hunts","t":"Ankeny-Artin-Chowla after Reinhart's counterexample: a second prime p = 1 mod 4 with p | y, or an independent check below 3.4e14","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"antihydra-collatz-cryptid","cat":"number-hunts","t":"Antihydra (BB(6) Cryptid): prove non-halting (Collatz-like / Mahler 3/2 problem)","k":"moonshot","tr":1,"cp":"pure thought","cb":"thought"},{"id":"chinese-gold-bars","cat":"unbroken-ciphers","t":"Chinese gold bar cryptograms (Shanghai, 1933)","k":"standard","tr":1,"cp":"laptop-minutes","cb":"min"},{"id":"liber-primus-lp2","cat":"unbroken-ciphers","t":"Cicada 3301 Liber Primus: unsolved runic pages","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"quadratic-field-3-rank-record","cat":"number-hunts","t":"Class groups of quadratic fields with record 3-rank: an imaginary quadratic field of 3-rank 9 (record 8, Elkies), or a real one of 3-rank 8","k":"standard","tr":1,"cp":"laptop-days","cb":"days"},{"id":"conway-99-graph","cat":"graphs-games-automata","t":"Conway's 99-graph, srg(99,14,1,2)","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"cosmetic-crossing-conjecture-counterexample","cat":"wildcard","t":"Cosmetic crossing conjecture: a certified non-nugatory crossing change that preserves the knot type (KnotInfo lists 1,216 knots up to 13 crossings as open)","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"ultimate-enigma-challenge","cat":"unbroken-ciphers","t":"CryptoCellar 'Ultimate Enigma Challenge' (5 Sept 1941 messages, possibly non-standard machine)","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"cubic-aacm-hirakawa-shimizu","cat":"number-hunts","t":"Cubic Ankeny-Artin-Chowla-Mordell conjecture (Hirakawa-Shimizu): a prime p with p | beta for the fundamental unit of Q(p^(1/3)) or Q((2p)^(1/3)), or a certified verification for a\u2026","k":"moonshot","tr":1,"cp":"needs cluster for a cou\u2026","cb":"cluster"},{"id":"cunningham-wanted-composites","cat":"number-hunts","t":"Cunningham project: a new factor of a composite cofactor of b^n +- 1 (b = 2..12), above all from the wanted lists","k":"harvest","tr":1,"cp":"needs cluster for NFS o\u2026","cb":"cluster"},{"id":"cypro-minoan-signary-crossscript","cat":"undeciphered-scripts","t":"Cypro-Minoan: sign-inventory merges and Cypriot-syllabary value transfer tested on held-out inscriptions","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"dorabella-1897","cat":"unbroken-ciphers","t":"Dorabella cipher (Elgar, 1897)","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"sixth-powers-equal-sums","cat":"number-hunts","t":"Equal sums of sixth powers: 6.1.5 / 6.1.6 (Euler conjecture k=6) and 6.2.2","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-287-egyptian-gaps","cat":"erdos-and-proofs","t":"Erdos #287: unit-fraction representations of 1 must have a gap >= 3, for a full proof","k":"standard","tr":1,"cp":"pure thought","cb":"thought"},{"id":"erdos-993-tree-independence-unimodality","cat":"erdos-and-proofs","t":"Erdos #993: a tree (or forest) with non-unimodal independent-set sequence","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"fermat-catalan-new-solution-with-square","cat":"number-hunts","t":"Fermat-Catalan: an eleventh solution of a^m + b^n = c^k with 1/m + 1/n + 1/k < 1 (one exponent equal to 2)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"first-continuous-gw-signal-confirmed-candidate","cat":"sky-archives","t":"First continuous gravitational-wave signal: a candidate in public LIGO data confirmed in an independent observing run","k":"moonshot","tr":1,"cp":"needs cluster for broad\u2026","cb":"cluster"},{"id":"costas-order-32","cat":"graphs-games-automata","t":"First Costas array of order 32 or 33","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"gwosc-o4-subsolar-mass-binary-candidate","cat":"sky-archives","t":"First significant sub-solar-mass compact-binary candidate in public LIGO-Virgo strain (O1-O4b)","k":"moonshot","tr":1,"cp":"needs cluster for a ful\u2026","cb":"cluster"},{"id":"four-agent-additive-goods-efx-obstruction","cat":"graphs-games-automata","t":"Four additive agents: an exact finite counterexample to complete EFX existence","k":"moonshot","tr":1,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"willow-surface-code-d7-decoding","cat":"physics","t":"Google Willow surface-code memory (public data): decode the distance-7 experiment to a logical error per cycle below the neural decoder's 1.43e-3","k":"standard","tr":1,"cp":"laptop-days","cb":"days"},{"id":"goormaghtigh-new-solution","cat":"number-hunts","t":"Goormaghtigh conjecture: a third number that is a repunit ( > = 3 digits) in two bases","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"grundys-game-periodicity","cat":"graphs-games-automata","t":"Grundy's game: certify an eventual period (or that of 0.6111...), beyond Flammenkamp's 2^39 computation","k":"moonshot","tr":1,"cp":"needs cluster for a new\u2026","cb":"cluster"},{"id":"hadwiger-nelson-six-or-seven","cat":"erdos-and-proofs","t":"Hadwiger\u2013Nelson: does the plane require six colours or seven?","k":"moonshot","tr":1,"cp":"laptop-hours for bounde\u2026","cb":"hours"},{"id":"debosnys-1883","cat":"unbroken-ciphers","t":"Henry Debosnys cryptograms (1882-83)","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"vesuvius-first-letters-unread","cat":"herculaneum-scrolls","t":"Herculaneum papyri: first legible letters in one of the 21 still-unread Vesuvius Challenge First Letters scrolls (official credit only)","k":"standard","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"hofstadter-q-sequence-death","cat":"number-hunts","t":"Hofstadter's Q-sequence: does it die? Find an n where Q(n) is undefined, or push the existence frontier past 3*10^10","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"isthmian-family-bayes","cat":"undeciphered-scripts","t":"Isthmian (Epi-Olmec): reproducible language-family test and a check of the Justeson-Kaufman grid on texts it was not built from","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"jetclass-ten-class-accuracy-auc","cat":"particle-physics","t":"JetClass 10-class jet tagging: beat L-GATr's 0.866 accuracy and 0.9885 macro AUC on the 20M-jet test set","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"khitan-small-unread-graphemes","cat":"undeciphered-scripts","t":"Khitan small script: phonetic values for unread graphemes from Chinese loanwords and titles","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"kissing-number-low-dim","cat":"record-tables","t":"Kissing number lower bounds in dimensions 9-23","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"kryptos-k4-method","cat":"unbroken-ciphers","t":"Kryptos K4: recover the encryption METHOD (plaintext known only to Sanborn and archive owners)","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"fifth-powers-lps-5-2-2-or-5-1-3","cat":"number-hunts","t":"Lander-Parkin-Selfridge at k = 5: a solution of a^5 + b^5 = c^5 + d^5 (5.2.2) or a^5 + b^5 + c^5 = d^5 (5.1.3)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"langton-ant-highway","cat":"graphs-games-automata","t":"Langton's ant highway conjecture","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"cap-set-dim7-dim8","cat":"record-tables","t":"Larger cap sets in F_3^7 (beat 236) or F_3^8 (beat 512)","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"largest-small-even-polygons-area","cat":"packings-physics","t":"Largest small polygons: a convex n-gon of diameter 1 with larger area than Bingane-Mossinghoff's P_n* for some even n = 14..120","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"lehmer-totient","cat":"number-hunts","t":"Lehmer's totient problem: composite n with phi(n) | n - 1","k":"moonshot","tr":1,"cp":"pure thought","cb":"thought"},{"id":"lerch-primes-sixth","cat":"number-hunts","t":"Lerch primes: a sixth one beyond 2*10^8 (OEIS A197632)","k":"standard","tr":1,"cp":"laptop-days","cb":"days"},{"id":"linear-elamite-residual-signs","cat":"undeciphered-scripts","t":"Linear Elamite: values for the 4 undeciphered signs, and a predictive test of the 2022 grid","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"antichess-open-first-moves","cat":"graphs-games-automata","t":"Losing chess (antichess): solve one of White's six first moves still marked Unknown (1.a4, 1.b3, 1.c4, 1.g3, 1.g4, 1.Nh3)","k":"standard","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"matbench-large-mp-tasks","cat":"chemistry-materials","t":"Matbench v0.1 large tasks (mp_e_form, mp_gap, mp_is_metal): beat the best published Matbench-protocol score (JMP-L's 0.0101 eV/atom and 0.091 eV, CGCNN's 0.9520 balanced accuracy)","k":"standard","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"modded-nanogpt-track1-wallclock-record","cat":"machine-learning","t":"Modded-NanoGPT speedrun: train to 3.28 FineWeb val loss on 8xH100 faster than the 39.9 s README record (and the pending claims)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"fmm-4x4x4-rank47-3x3x3-rank22","cat":"algorithms","t":"MOONSHOT - 4x4 matrices with 47 multiplications in characteristic 0, or 3x3 matrices with 22","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"szilassi-12-face-neighborly-polyhedron","cat":"wildcard","t":"MOONSHOT - A 12-face Szilassi-type polyhedron: an embedded genus-6 polyhedron whose 12 faces pairwise share an edge","k":"moonshot","tr":1,"cp":"needs cluster for full\u2026","cb":"cluster"},{"id":"dujella-dn-quadruple-exceptional-n","cat":"number-hunts","t":"MOONSHOT - a D(n)-quadruple for n in {-3, 3, 5, 8, 12, 20} (disprove Dujella's conjecture)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"wilson-prime-beyond-2e13","cat":"number-hunts","t":"MOONSHOT - a fourth Wilson prime (p^2 | (p-1)! + 1) beyond 2*10^13","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"pg2-128-new-hyperoval","cat":"record-tables","t":"MOONSHOT - A hyperoval in PG(2,128) not equivalent to any known hyperoval","k":"moonshot","tr":1,"cp":"laptop-days for search","cb":"days"},{"id":"vandiver-euler-prime-beyond-1e11","cat":"number-hunts","t":"MOONSHOT - a ninth Vandiver (Euler) prime, p | E_(p-3), beyond 10^11 (OEIS A198245)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"rational-diophantine-septuple","cat":"number-hunts","t":"MOONSHOT - a rational Diophantine septuple","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"unitary-perfect-sixth-erdos-1052","cat":"number-hunts","t":"MOONSHOT - a sixth unitary perfect number (Erd\u0151s #1052, OEIS A002827)","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"wieferich-base-2-beyond-2-64","cat":"number-hunts","t":"MOONSHOT - a third Wieferich prime (p^2 | 2^(p-1) - 1) beyond 2^64","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"wolstenholme-prime-beyond-1e11","cat":"number-hunts","t":"MOONSHOT - a third Wolstenholme prime (p | B_(p-3) numerator, i.e. C(2p-1,p-1) == 1 mod p^4) beyond 10^11","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"wall-sun-sun-prime-beyond-2-64","cat":"number-hunts","t":"MOONSHOT - a Wall-Sun-Sun (Fibonacci-Wieferich) prime: p^2 | F_(p - (p/5)), beyond 2^64","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"four-nonnegative-cubes-dhl-counterexample","cat":"number-hunts","t":"MOONSHOT - an integer above 7373170279850 that is not a sum of four nonnegative cubes (Deshouillers-Hennecart-Landreau)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"burnside-b25-finite-presentation","cat":"wildcard","t":"MOONSHOT - Burnside group B(2,5): finite or infinite? (with Kourovka 11.48, Kostrikin's fifth-power question)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"chromatic-number-r3-7-chromatic-udg","cat":"erdos-and-proofs","t":"MOONSHOT - Chromatic number of 3-space: a finite unit-distance graph in R^3 that is not 6-colourable (lower bound 6, upper bound 15)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"chvatal-conjecture-ground-set-8","cat":"erdos-and-proofs","t":"MOONSHOT - Chv\u00e1tal's conjecture (Erd\u0151s #701): a downset whose largest intersecting subfamily beats every star, or a certified verification for ground sets of 8 elements","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"classical-ramsey-upper-bounds-certified","cat":"record-tables","t":"MOONSHOT - Classical Ramsey upper bounds with machine-checkable certificates: R(3,3,3,3) <= 60, R(3,10) <= 40, R(4,6) <= 39, R(5,5) <= 45, R(3,3,5) <= 56, R(3,4,4) <= 76","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"congruent-ellipsoids-densest-packing","cat":"packings-physics","t":"MOONSHOT - Congruent ellipsoids: a periodic packing denser than the Donev-Stillinger-Chaikin-Torquato SM2 crystal (0.770732, aspect ratios >= sqrt3)","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"davenport-rank-3-above-dstar","cat":"number-hunts","t":"MOONSHOT - Davenport constant in rank 3: a group C_n1 + C_n2 + C_n3 with D(G) > D*(G)","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"cohn-sphere-packing-density-table","cat":"record-tables","t":"MOONSHOT - denser sphere packing than Cohn's table in some dimension 10..48","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"cube-domino-tilings-a028446-8x8x8","cat":"graphs-games-automata","t":"MOONSHOT - Domino tilings of the 8 x 8 x 8 cube: the exact count A028446(4) (6 x 6 x 6 solved in March 2026)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"durer-convex-edge-unfolding-counterexample","cat":"wildcard","t":"MOONSHOT - D\u00fcrer's problem: a convex polyhedron with no edge unfolding to a net","k":"moonshot","tr":1,"cp":"laptop-days for candida\u2026","cb":"days"},{"id":"earth-moon-biplanar-10-chromatic","cat":"erdos-and-proofs","t":"MOONSHOT - Earth-Moon problem: a biplanar (thickness-2) graph with chromatic number 10","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"etp-finite-magma-677-255","cat":"formal-proofs","t":"MOONSHOT - Equational Theories Project: settle the last 2 finite-magma implications (Eq677 \u21d2 Eq255, Eq2910 \u21d2 Eq47)","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-107-happy-ending-n7","cat":"erdos-and-proofs","t":"MOONSHOT - Erdos #107 (Happy Ending): 33 points with no convex heptagon","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"erdos-7-odd-covering-system","cat":"erdos-and-proofs","t":"MOONSHOT - Erdos #7 / Selfridge: a covering system with distinct odd moduli","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"erdos-723-projective-plane-order-12","cat":"erdos-and-proofs","t":"MOONSHOT - Erdos #723: a projective plane of order 12 (fallback: 6 MOLS of order 12)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"egz-odd-exponent-rank3-9n-8","cat":"number-hunts","t":"MOONSHOT - Erd\u0151s\u2013Ginzburg\u2013Ziv constant for odd n: refute s(C_n^3) = 9n-8 (smallest open n = 7) or beat 20n-19 in rank 4","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"eternity-ii-480-edge-board","cat":"recreational-math","t":"MOONSHOT - Eternity II: the full 480-edge solution, or a board beating the 470/480 record (or the 465 five-clue record)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"euclid-mullin-a52","cat":"number-hunts","t":"MOONSHOT - Euclid-Mullin sequence: the 52nd term (least prime factor of a 335-digit number)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"mub-dimension-six-four-bases","cat":"physics","t":"MOONSHOT - Four mutually unbiased bases in C^6 (only three known), or a checkable proof that none exist","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"gerstenhaber-commuting-triples","cat":"erdos-and-proofs","t":"MOONSHOT - Gerstenhaber problem: three commuting d x d matrices generating an algebra of dimension > d (or reducibility of C(3,d) for some 11 <= d <= 28)","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"goldbach-verification-beyond-4e18","cat":"number-hunts","t":"MOONSHOT - Goldbach verification beyond 4 x 10^18 (Oliveira e Silva, Herzog and Pardi, 2012/2014)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"graceful-tree-conjecture-beyond-35","cat":"graphs-games-automata","t":"MOONSHOT - Graceful tree (Ringel-Kotzig) conjecture: a tree with no graceful labeling, a formal proof, or the first verification past Fang's 35 vertices","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"helium-ground-state-energy-digits","cat":"physics","t":"MOONSHOT - Helium atom nonrelativistic ground-state energy: more correct digits than Schwartz's 2006 record","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"hilbert-16-quadratic-fifth-limit-cycle","cat":"wildcard","t":"MOONSHOT - Hilbert's 16th problem for quadratic systems: a quadratic vector field with five limit cycles (H(2) >= 4 since Shi 1980)","k":"moonshot","tr":1,"cp":"laptop-hours per candid\u2026","cb":"hours"},{"id":"home-prime-hp49","cat":"number-hunts","t":"MOONSHOT - home prime HP(49) = HP(77): factor the c251 at step 119 and continue to a prime","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"henon-classical-parameters-sink","cat":"physics","t":"MOONSHOT - Is the Henon attractor a sink? A certified attracting periodic orbit at exactly (a, b) = (1.4, 0.3), or a sink closer than Galias-Tucker's","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"kurepa-left-factorial-beyond-2-40","cat":"number-hunts","t":"MOONSHOT - Kurepa's left factorial conjecture: an odd prime p dividing !p = 0!+1!+...+(p-1)!, beyond 2^40","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"hamming-cube-l1-poincare-c11a-lower-bound","cat":"erdos-and-proofs","t":"MOONSHOT - L1 Poincare constant of the Hamming cube (C_11a): a function on {-1,1}^n with ratio above sqrt(pi/2)","k":"moonshot","tr":1,"cp":"laptop-hours per candid\u2026","cb":"hours"},{"id":"marcus-de-oliveira-determinantal-conjecture","cat":"erdos-and-proofs","t":"MOONSHOT - Marcus-de Oliveira determinantal conjecture: normal A, B with det(A + B) outside the convex hull of the n! eigenvalue products","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"matbench-discovery-cps-f1-kappa","cat":"physics","t":"MOONSHOT - Matbench Discovery: beat the live best Combined Performance Score (0.912) with an openly released interatomic potential (the F1 0.931 and \u03ba_SRME 0.0648 records are part\u2026","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"neumann-lara-planar-2-dicolouring","cat":"graphs-games-automata","t":"MOONSHOT - Neumann-Lara conjecture: a planar oriented graph that cannot be split into two acyclic sets, or verification beyond 26 vertices","k":"moonshot","tr":1,"cp":"laptop-days for extendi\u2026","cb":"days"},{"id":"hypercube-q8-perfect-matchings","cat":"graphs-games-automata","t":"MOONSHOT - Perfect matchings of the 8-cube: the exact count A005271(8)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"planet-nine-distant-tno-archival-moonshot","cat":"sky-archives","t":"MOONSHOT - Planet Nine or a new extreme distant TNO candidate in public archival survey images","k":"moonshot","tr":1,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"posets-topologies-17-unlabeled-20-labeled","cat":"wildcard","t":"MOONSHOT - Posets and topologies: unlabeled counts on 17 points (A000112, A001930) or labeled counts on 20 points (A001035, A000798)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"post-tag-00-1101-problem","cat":"graphs-games-automata","t":"MOONSHOT - Post's 1921 tag problem (00, 1101; delete 3): a word that never halts or cycles, or a proof that none exists","k":"moonshot","tr":1,"cp":"needs cluster for exhau\u2026","cb":"cluster"},{"id":"regular-heptagon-densest-packing","cat":"packings-physics","t":"MOONSHOT - Regular heptagons in the plane: a packing of congruent regular heptagons denser than the Kuperberg double lattice (0.8926906861...)","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"regular-tetrahedra-densest-packing","cat":"packings-physics","t":"MOONSHOT - Regular tetrahedra: a packing of congruent regular tetrahedra denser than the Chen-Engel-Glotzer dimer double lattice 4000/4671 = 0.856347...","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"riemann-hypothesis-verification-height","cat":"number-hunts","t":"MOONSHOT - Riemann hypothesis verified beyond Platt-Trudgian's height 3.0001753328 x 10^12, or a rigorous window above it","k":"moonshot","tr":1,"cp":"needs cluster for a new\u2026","cb":"cluster"},{"id":"rubiks-cube-qtm-distance-25-26","cat":"graphs-games-automata","t":"MOONSHOT - Rubik's Cube in the quarter-turn metric: a new position at distance 26, or a third distance-25 position","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"kochen-specker-minimum-r3","cat":"physics","t":"MOONSHOT - Smallest Kochen-Specker vector system in R^3: find one with at most 30 vectors (known range 24..31)","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"srg-open-parameter-existence","cat":"record-tables","t":"MOONSHOT - Strongly regular graphs: construct an srg for an open parameter set in Brouwer's table","k":"moonshot","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"n-queens-q28","cat":"graphs-games-automata","t":"MOONSHOT - The 28-queens count Q(28) (OEIS A000170(28), open since the Q27 project in 2016)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"groups-of-order-2048-count","cat":"wildcard","t":"MOONSHOT - The exact number of groups of order 2048","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"lehmer-five-aliquot","cat":"number-hunts","t":"MOONSHOT - the Lehmer five: decide the fate of the aliquot sequence of 276, 552, 564, 660 or 966","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"dedekind-number-d10","cat":"number-hunts","t":"MOONSHOT - The tenth Dedekind number D(10) (OEIS A000372(10)) or inequivalent monotone Boolean functions of 10 variables (A003182(10))","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"three-mols-order-10","cat":"record-tables","t":"MOONSHOT - Three mutually orthogonal Latin squares of order 10 (is N(10) >= 3?)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"torquato-jiao-centrosymmetric-polyhedra","cat":"packings-physics","t":"MOONSHOT - Torquato-Jiao conjecture: a non-lattice packing of a centrally symmetric Platonic or Archimedean solid denser than its optimal lattice packing","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"hanoi-five-peg-frame-stewart","cat":"recreational-math","t":"MOONSHOT - Tower of Hanoi with five or more pegs: a move sequence shorter than Frame-Stewart, or an extension of the exhaustive verification beyond Hinz-Petr's frontier","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"world-tsp-shorter-tour","cat":"optimization-benchmarks","t":"MOONSHOT - World TSP (1,904,711 cities): a tour shorter than Nagata's 7,515,755,912","k":"moonshot","tr":1,"cp":"laptop-days to weeks","cb":"days"},{"id":"ecpp-famous-unproven-prps","cat":"number-hunts","t":"MOONSHOT: an ECPP proof of a famous probable prime: Wagstaff (2^267017+1)/3, Lucas L(344293) or Fibonacci F(397379)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"indus-decipherment","cat":"undeciphered-scripts","t":"MOONSHOT: Indus script, sign values or meanings that predict held-out seals","k":"moonshot","tr":1,"cp":"laptop-days / pure thou\u2026","cb":"days"},{"id":"linear-a-language-identification","cat":"undeciphered-scripts","t":"MOONSHOT: Linear A, identifying the Minoan language with predictive translations","k":"moonshot","tr":1,"cp":"laptop-days / pure thou\u2026","cb":"days"},{"id":"voynich-plaintext","cat":"undeciphered-scripts","t":"MOONSHOT: Voynich manuscript, a key that decrypts held-out folios into meaningful text","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"sudoku-minimal-puzzle-41-clues","cat":"recreational-math","t":"Most clues in a minimal 9 x 9 Sudoku: a minimal puzzle with 41 clues (only two 40-clue minimal puzzles are known)","k":"moonshot","tr":1,"cp":"laptop-days","cb":"days"},{"id":"moustier-altar-inscriptions","cat":"unbroken-ciphers","t":"Moustier altar inscriptions (two 19th-century coded inscriptions, St Martin's Church, Belgium)","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"cyclotomic-norm-euclidean-open-cases","cat":"number-hunts","t":"Norm-Euclidean cyclotomic rings Z[zeta_m]: decide one of the open class-number-one cases (m = 17, 19, 25, 27, 28, 33, 35, 36, 40, 44, 45, 48, 60, 84)","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"octal-games-unsettled-periodicity","cat":"graphs-games-automata","t":"Octal games: certify the period of one unsettled octal game with at most three code digits in Flammenkamp's table","k":"moonshot","tr":1,"cp":"laptop-days per game","cb":"days"},{"id":"oracle-bone-undeciphered-chars","cat":"undeciphered-scripts","t":"Oracle bone script: identifications of undeciphered characters validated by held-out prediction","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"perfect-cuboid","cat":"number-hunts","t":"Perfect cuboid (perfect Euler brick)","k":"moonshot","tr":1,"cp":"pure thought","cb":"thought"},{"id":"perfect-triangle","cat":"number-hunts","t":"Perfect triangle: integer sides, rational medians, integer area","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"rational-distance-unit-square","cat":"number-hunts","t":"Rational distance problem for the unit square (four-distance problem)","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"alternating-prm-plus-ergodic-convergence","cat":"algorithms","t":"Regret matching+ inside CFR+/PCFR+: does alternating predictive RM+ converge ergodically? Prove RM+ non-convergence on the 3x3 counterexample game","k":"standard","tr":1,"cp":"pure thought plus a for\u2026","cb":"thought"},{"id":"reinhart-unusual-orders-d-divides-y","cat":"number-hunts","t":"Reinhart's open problem: squarefree d = pq or 2pq with h(d) = 2 and d | y (orders with unusual sets of distances)","k":"standard","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"ccd-water-clusters-tip4p-tip5p","cat":"packings-physics","t":"Rigid-water clusters (TIP4P, TIP5P): lower a putative global minimum for (H2O)_N, N <= 21 on the CCD, or beyond against published values","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"self-dual-quantum-codes-13-qubits-count","cat":"physics","t":"Self-dual quantum codes on 13 qubits: count the LC orbits of connected 13-vertex graphs (next term of OEIS A090899, known to n = 12)","k":"standard","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"z-channel-single-error-codes","cat":"record-tables","t":"Single-error-correcting codes for the Z-channel: beat 112, 198 or 379 (Sloane's 1zc challenge graphs), or certify a tighter upper bound","k":"standard","tr":1,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"extremal-doubly-even-self-dual-72","cat":"record-tables","t":"Sloane's 1973 question: an extremal doubly-even self-dual binary [72,36,16] code","k":"moonshot","tr":1,"cp":"needs cluster for any s\u2026","cb":"cluster"},{"id":"sums-of-three-cubes-114","cat":"number-hunts","t":"Sums of three cubes: k = 114, 390, 627, 633, 732, 921, 975, and a fourth representation of 3","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"kerdock-set-ternary-m6","cat":"record-tables","t":"Ternary Kerdock set of 6x6 matrices: 243 skew-symmetric matrices over GF(3) with all pairwise differences nonsingular","k":"moonshot","tr":1,"cp":"needs cluster for search","cb":"cluster"},{"id":"moore-graph-57","cat":"graphs-games-automata","t":"The missing Moore graph (degree 57, diameter 2)","k":"moonshot","tr":1,"cp":"pure thought","cb":"thought"},{"id":"gamblers-ruin-scaling-conjecture","cat":"graphs-games-automata","t":"Three-player gambler's ruin (the final-table ICM problem): a counterexample to the Diaconis-Ethier 0.0004 scaling conjecture","k":"standard","tr":1,"cp":"laptop-hours","cb":"hours"},{"id":"turan-tetrahedron-k4-3-density-upper-bound","cat":"erdos-and-proofs","t":"Tur\u00e1n's tetrahedron problem (Erd\u0151s #500): a certified upper bound on pi(K4^(3)) below 0.55733, or a K4^(3)-free construction above 5/9","k":"moonshot","tr":1,"cp":"needs cluster","cb":"cluster"},{"id":"modular-hadamard-128-open-orders","cat":"record-tables","t":"128-modular Hadamard matrix at an order with no known Hadamard matrix (smallest 2396), or a first explicit 64-modular one there","k":"standard","tr":null,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"av1324-exact-counts-beyond-n50","cat":"recreational-math","t":"1324-avoiding permutations: the exact count |Av_51(1324)| (first term beyond Conway-Guttmann-Zinn-Justin's n = 50)","k":"moonshot","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"roman-microlensing-data-challenge-2018-planet-recovery","cat":"planetary-science","t":"2018 WFIRST/Roman Microlensing Data Challenge: one automated pipeline that recovers more planetary (s, q) solutions than all four entries","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"esicup-nesting-sparrow-strip-length-records","cat":"optimization-benchmarks","t":"2D irregular strip packing (nesting, ESICUP and Gardeyn instances): a shorter strip than a record in sparrow's live records folder","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"five-gdd-type-gu-possible-exceptions","cat":"record-tables","t":"5-GDDs of type g^u: settle a possible exception in Forbes' 2023 theorem (smallest 2^15, then 10^7)","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"asteroid-yorp-detection-beyond-twelve","cat":"planetary-science","t":"A new YORP detection: significant change in an asteroid's rotation rate measured from decades of public lightcurves","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"type-2-cubic-graph-girth-5","cat":"graphs-games-automata","t":"A Type 2 cubic graph of girth at least 5 (total chromatic number 5), open since Cavicchioli et al. 2003","k":"standard","tr":null,"cp":"laptop-days for constru\u2026","cb":"days"},{"id":"alternating-sign-hypermatrices-a144017-n7","cat":"recreational-math","t":"Alternating sign hypermatrices: the number of 7 x 7 x 7 ASHMs, A144017(7) (a(6) found in Feb 2026)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"andrews-curtis-ak3-trivialisation","cat":"wildcard","t":"Andrews-Curtis: an AC-trivialisation of AK(3), or of one of the last two open length-14 Miller-Schupp classes","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"anuraset-multilabel-macro-f1","cat":"ecology","t":"AnuraSet neotropical frog calls: beat the best published test macro F1 (60.8, Mixture of Mixups) for 42-species multi-label classification","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"hjelmslev-plane-arcs-chain-rings-16-25","cat":"record-tables","t":"Arcs in projective Hjelmslev planes over chain rings of order 16 and 25: raise a lower bound in the Honold-Kiermaier-Landjev tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"pure-quartic-norm-euclidean-61-116","cat":"number-hunts","t":"Are the pure quartic fields Q(13^(1/4)), Q(61^(1/4)) and Q(116^(1/4)) norm-Euclidean? (last open cases of Lemmermeyer's classification)","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"go1-final-event-scopf-best-scores","cat":"optimization-benchmarks","t":"ARPA-E GO Competition Challenge 1 (continuous SCOPF): beat the best Final Event score on a public synthetic scenario","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"decipherment-cognate-matching-tamburini-benchmarks","cat":"ancient-texts","t":"Automatic decipherment on known scripts: beat CSA_OptMatcher's mean cognate-matching accuracy on the seven Tamburini 2025 benchmarks (Ugaritic, Linear B, Cypriot, Phoenician, Luvi\u2026","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"random-edit-distance-constant-c91-bounds","cat":"erdos-and-proofs","t":"Average edit distance of two random binary strings (C_91): a certified bound beating 0.216276 <= alpha_2 <= 0.315514","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"bci-iv-ds4-ecog-finger-flexion-strict","cat":"neuroscience","t":"BCI Competition IV dataset 4 (ECoG finger flexion): beat the best published mean correlation (0.69, DTCNet 2025) on the official test labels under a strict no-test-tuning protocol","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ccd-binary-lennard-jones-clusters","cat":"packings-physics","t":"Binary Lennard-Jones clusters: lower a putative global minimum in the Doye-Meyer table (N <= 100, size ratios 1.05-1.30) or its published improvements","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"biomassters-finnish-agb-test-rmse","cat":"earth-and-sky","t":"BioMassters (Finnish forest biomass from Sentinel-1/2 time series): beat the best published whole-test average RMSE (27.43, TESSERA) on the released test labels","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"blanking-beeping-beaver-small-domains","cat":"graphs-games-automata","t":"Blanking and Beeping Busy Beavers: beat a small-domain champion (BLB(2,4), BLB(2,5), BBB(2,4)) or settle BLB(4)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"glm-bolide-not-in-nasa-catalog","cat":"earth-and-sky","t":"Bolide in public GOES GLM lightning-mapper data absent from the NASA GLM bolide catalog","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"borsuk-finite-counterexample-below-63","cat":"erdos-and-proofs","t":"Borsuk's conjecture: a finite counterexample in dimension 62 or less (finite record 63, Grinsztajn 2026)","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"brier-number-smaller-than-clavier","cat":"number-hunts","t":"Brier numbers (both Sierpi\u0144ski and Riesel): one smaller than Clavier's 3316923598096294713661, or a missing small one","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"brun-constant-unconditional-upper-bound","cat":"number-hunts","t":"Brun's constant (C_81): an unconditional upper bound below Platt-Trudgian's 2.288513","k":"standard","tr":null,"cp":"pure thought","cb":"thought"},{"id":"bush-type-hadamard-odd-n-196","cat":"record-tables","t":"Bush-type Hadamard matrices of order 4n^2 with n odd: the first open case n = 7 (order 196)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"post-tag-busy-beaver-bbpt","cat":"graphs-games-automata","t":"Busy Beaver for 2-tag systems: settle BB_PT(8) (7 holdouts) or beat a size 8-11 champion","k":"harvest","tr":null,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"cyclic-tag-busy-beaver-bbct","cat":"graphs-games-automata","t":"Busy Beaver for cyclic tag systems: settle BBCT(8) or beat a size 8-14 champion","k":"harvest","tr":null,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"fractran-busy-beaver-bbf","cat":"graphs-games-automata","t":"Busy Beaver for FRACTRAN: beat a BBf(22..24) champion, decide BBf(23)'s or BBf(24)'s holdouts, or settle a Fenrir cryptid","k":"harvest","tr":null,"cp":"laptop-hours for enumer\u2026","cb":"hours"},{"id":"butson-hadamard-small-catalogue-unknown-cells","cat":"record-tables","t":"Butson Hadamard catalogue n <= 21, q <= 17: settle an unknown cell (BH(15,12), BH(16,15), BH(17,12), BH(17,15), BH(19,15))","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"caffe-calving-front-mean-distance-error","cat":"earth-and-sky","t":"CaFFe glacier calving fronts in SAR: beat the best published mean distance error on the out-of-sample Mapple and Columbia test set","k":"standard","tr":null,"cp":"laptop-days on a GPU wo\u2026","cb":"days"},{"id":"caid3-disorder-binding-average-precision","cat":"disease-research","t":"CAID3 (Critical Assessment of Intrinsic Disorder): beat the published best average precision on the frozen CAID3 reference","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"calms21-mouse-social-behavior-f1","cat":"neuroscience","t":"CalMS21 mouse social behaviour classification: beat the best test F1 on Task 1 (0.878), Task 2 (0.809) or Task 3 (0.363)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"camelyon16-test-froc-and-slide-auc","cat":"disease-research","t":"CAMELYON16 lymph-node metastasis detection: beat the best lesion-level FROC on the public 129-slide test reference","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"cami2-genome-binning-recovered-genomes","cat":"genomics","t":"CAMI II genome binning: recover more near-complete genomes from the gold-standard co-assembly than any binner on the CAMI Benchmarking Portal (marine, strain-madness, plant-associ\u2026","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"care-enzyme-reaction-retrieval-hard","cat":"biology","t":"CARE benchmark: beat the best published accuracy for retrieving the enzyme class (EC number) of an unseen reaction","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"flusight-ed-visits-beat-ensemble-wis","cat":"disease-research","t":"CDC FluSight emergency-department visits: beat the FluSight-ensemble's season WIS on the newer ED-visit target","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"flusight-retrospective-beat-ensemble-wis","cat":"disease-research","t":"CDC FluSight hub: beat the FluSight-ensemble's season-average WIS retrospectively on a completed season","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"centered-maximal-c47-lower-bound","cat":"erdos-and-proofs","t":"Centred Hardy-Littlewood maximal constant for squares in the plane (C_47): a measure beating Lin's 1.6855099933","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"chc-comp-2026-unknown-status-first-solve","cat":"optimization-benchmarks","t":"CHC-COMP 2026: first validated model or refutation for a Horn-clause task no solver answered and whose verdict is only a placeholder","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"jarvis-chipsff-umlip-defect-surface-elastic-mae","cat":"chemistry-materials","t":"CHIPS-FF on JARVIS-Leaderboard: a universal force field with lower MAE than all 16 listed for vacancy energy, surface energy, C11, bulk modulus or formation energy (104 materials)","k":"harvest","tr":null,"cp":"laptop-hours to evaluat\u2026","cb":"hours"},{"id":"chvatal-sankoff-binary-lcs-constant-bounds","cat":"erdos-and-proofs","t":"Chvatal-Sankoff constant (C_31a): a certified bound on the expected LCS of two random binary strings beating 0.792665992 <= gamma_2 <= 0.821963","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"cifar10-speedrun-94-single-a100","cat":"machine-learning","t":"CIFAR-10 speedrun: 94% mean test accuracy on one A100 faster than Hiverge (1.98 s) and Fulcrum's Fable-5 E1 recipe (1.828 s), or 96% under 27.3 s","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"classic-online-bin-packing-asymptotic-ratio","cat":"algorithms","t":"Classic online bin packing: a deterministic lower bound above Balogh-Bekesi-Dosa-Epstein-Levin's 1.54278, or an algorithm at most 1.57821 (Advanced Harmonic, retuned by Martin in\u2026","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"code-test-ecg-abnormality-f1","cat":"disease-research","t":"CODE-test 12-lead ECG: beat the published per-abnormality F1 on the 827-exam annotated test set","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"sigtyp2022-cognate-reflex-prediction-surprise","cat":"ancient-texts","t":"Cognate reflex prediction (SIGTYP 2022 surprise data): beat FeVeT and CogTran on normalized edit distance and B-Cubed F at the 0.10, 0.30 and 0.50 test proportions","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"main-belt-asteroid-new-activity-archival","cat":"sky-archives","t":"Cometary activity in archival survey images of a main-belt asteroid with no cometary designation and no reported activity","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"top-tagging-landscape-rejection-record","cat":"particle-physics","t":"Community top-tagging dataset (Kasieczka et al.): beat OmniLearned-l's background rejection 3486 at 30% signal efficiency","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"condorcet-dimension-four-profile","cat":"wildcard","t":"Condorcet dimension 4: an election in which no three candidates form a Condorcet winning set (refutes Charikar et al. Conjecture 1)","k":"moonshot","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"cpap-consecutive-primes-ap-records","cat":"number-hunts","t":"Consecutive primes in arithmetic progression (CPAP-k, k = 3..10): beat a largest, smallest or largest-difference known record","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"rings-of-order-32","cat":"wildcard","t":"Count the rings of order 32: the smallest unknown value of OEIS A027623 (only a(32) > 18,590 is known)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"life-nxn-still-life-and-vanishing-counts","cat":"graphs-games-automata","t":"Counting n x n Life configurations: still lifes in the 16 x 16 square (A136278 a(16)) and patterns that vanish in one step in the 15 x 15 square (A134963 a(15))","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"covering-array-living-table-upper-bounds","cat":"record-tables","t":"Covering arrays CA(N;t,k,v), t = 2..6, v = 2..25: fewer rows than the best known in the living covering-array table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ecf-cubature-fewer-points","cat":"record-tables","t":"Cubature: a positive-interior (PI) rule with fewer points than the best known for a standard region and degree","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"cvrplib-vrptw-gh-dimacs-bks","cat":"optimization-benchmarks","t":"CVRPLIB VRPTW (Gehring-Homberger, DIMACS truncated-distance objective): beat an open best-known solution","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"cvrplib-x-xl-xxl-bks","cat":"optimization-benchmarks","t":"CVRPLIB: beat a best-known solution on an open X, XL or Arnold-XXL CVRP instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"darkmachines-unsupervised-median-total-improvement","cat":"particle-physics","t":"Dark Machines unsupervised anomaly detection: beat the best median total improvement (15.0, spline-flow likelihood) over the 19 BSM signals","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"jarvis-ocp10k-is2re-adsorption-energy-mae","cat":"physics","t":"Data-efficient catalysis on Open Catalyst (JARVIS ocp10k): predict OC20 relaxed adsorption energies on the 24,943 val-ID systems from 10,000 training systems with MAE below ALIGNN\u2026","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"de-bruijn-newman-upper-bound-certified","cat":"number-hunts","t":"de Bruijn-Newman constant: a certified upper bound below every claim on Tao's C_21 page (refereed record 0.2; unrefereed claims down to 0.107964910079)","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"bb6-holdout-certificates","cat":"number-hunts","t":"Decide official BB(6) holdout machines with independently checkable certificates","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"gw-memory-20-mode-stacked-bayes-factor","cat":"earth-and-sky","t":"Decisive stacked evidence for the (l=2, m=0) memory-carrying mode across all GWTC-4.0 and GWTC-5.0 binary black holes","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"deepvariant-case-study-accuracy-records","cat":"genomics","t":"DeepVariant case-study accuracy: beat DeepVariant 1.10's documented F1 on its own public held-out inputs, above all ONT R10.4.1 indels (0.9302) and RNA-seq","k":"harvest","tr":null,"cp":"laptop-hours for a chr2\u2026","cb":"hours"},{"id":"perm4-determinantal-complexity-below-15","cat":"algorithms","t":"Determinantal complexity of the 4x4 permanent: a determinantal expression smaller than Grenet's 15 x 15","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"diagonal-latin-square-spectra-vatutin","cat":"record-tables","t":"Diagonal Latin squares (Vatutin's proving lists): fewer transversals, fewer or more diagonal transversals, or fewer intercalates than the best known for n = 10..28","k":"harvest","tr":null,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"mint-digital-nets-lower-t","cat":"record-tables","t":"Digital (t,m,s)-nets: a smaller quality parameter t than MinT's best known digital net (bases 2-9)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"dimacs-colouring-open-upper-bounds","cat":"optimization-benchmarks","t":"DIMACS graph colouring: a proper colouring with fewer colours than the best known for an open benchmark graph (DSJC, flat1000_76_0, latin_square_10, C2000/C4000)","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"directed-percolation-square-lattice-threshold-digits","cat":"physics","t":"Directed percolation on the square lattice: more digits of p_c than Jensen's series values 0.644700185(5) (bond) and 0.70548522(4) (site)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"dna-codes-gc-king-table","cat":"biology","t":"DNA codes with constant GC-content: beat a lower bound in the Gaborit-King A_4^GC(n,d,w) table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"dna-codes-gc-rc-king-table","cat":"biology","t":"DNA codes with GC-content and reverse-complement constraint: beat a lower bound in the A_4^GC,RC(n,d,w) table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"queens-graph-domatic-numbers","cat":"graphs-games-automata","t":"Domatic, idomatic and total domatic numbers of the n x n queens graph for n = 10..12 (close Lauri's gaps)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"domineering-12x12","cat":"graphs-games-automata","t":"Domineering on the 12x12 board (largest solved square board is 11x11, Uiterwijk 2016)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"doubling-construction-subspace-codes","cat":"record-tables","t":"Doubling construction for mixed dimension subspace codes: decide whether A_q(2k+1,2k-1) = 2q^(k+1)+2 for (q,k) = (3,3) or (2,4)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"earthquakenpp-beat-etas-test-loglik","cat":"earth-and-sky","t":"EarthquakeNPP: beat the ETAS benchmark's per-event test log-likelihood on a real California catalog","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"edit-metric-dna-codes-gc","cat":"biology","t":"Edit-distance DNA codes with GC/homopolymer constraints: beat a published lower bound","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"checkers-perft-ply-30","cat":"graphs-games-automata","t":"English checkers from the start: the number of move sequences of 30 plies (OEIS A133046 a(30))","k":"standard","tr":null,"cp":"needs cluster, or sever\u2026","cb":"cluster"},{"id":"eaqecc-qutrit-codetables-gaps","cat":"physics","t":"Entanglement-assisted qutrit codes [[n,k,d;c]]_3 with c >= 1: raise a lower bound in Grassl's EAQECC qutrit table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"eslp-min-terms-k7-to-k32","cat":"number-hunts","t":"Equal sums of like powers for k = 7..32: a k.m.n solution with fewer terms than Meyrignac's EulerNet records","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"equiangular-lines-dims-18-20-42","cat":"record-tables","t":"Equiangular lines: more equiangular lines in R^18, R^19, R^20 or R^42 than the best known","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"equidistant-subspace-codes-b2-8-1-4","cat":"record-tables","t":"Equidistant subspace codes: more than 40 four-dimensional subspaces of F_2^8 pairwise meeting in exactly a point (B_2(8,1;4))","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-1033-triangle-degree-sum-constant","cat":"erdos-and-proofs","t":"Erdos #1033 (Bollobas-Erdos): a construction below 1.463877226961 n, or a certified lower bound of at least 1.453 n, for the forced triangle degree sum","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-1063-binomial-divisibility-nk-next-terms","cat":"erdos-and-proofs","t":"Erdos #1063 (Erdos-Selfridge): n_k for k >= 76 (OEIS A389360 beyond the forum's k = 75)","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"erdos-213-integral-8-points-general-position","cat":"erdos-and-proofs","t":"Erdos #213: eight points in the plane, no three on a line, no four on a circle, all distances integers","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-513-maximum-term-constant","cat":"erdos-and-proofs","t":"Erdos #513 (maximum-term constant C_51): a transcendental entire function with liminf mu(r)/M(r) above the record","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-580-efls-small-cases","cat":"erdos-and-proofs","t":"Erdos #580 (Erdos-Furedi-Loebl-Sos n/2-n/2-n/2 conjecture): a counterexample, or certified verification for n = 20","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"erdos-156-saturated-sidon-next-terms","cat":"erdos-and-proofs","t":"Erd\u0151s #156 small cases: minimum size of a maximal (saturated) Sidon set in {1..n}: settle a(189) in {9, 10}, and the nine-mark threshold","k":"standard","tr":null,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"erdos-20-sunflower-numbers-small","cat":"erdos-and-proofs","t":"Erd\u0151s #20 small cases (Erd\u0151s-Rado sunflower numbers): beat Abbott et al.'s 38 three-sets with no 4-sunflower, 54 four-sets with no 3-sunflower, or 88 three-sets with no 5-sunflowe\u2026","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-203-two-dimensional-sierpinski","cat":"erdos-and-proofs","t":"Erd\u0151s #203: an m coprime to 6 with every 2^k 3^l m + 1 composite (a two-dimensional Sierpi\u0144ski number)","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"erdos-21-cover-number-q6","cat":"erdos-and-proofs","t":"Erd\u0151s #21 small cases (Erd\u0151s-Lov\u00e1sz): an intersecting 6-uniform family with cover number 6 and at most 17 edges (best known 18, lower bound 14)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"erdos-23-triangle-free-bipartite-deletion","cat":"erdos-and-proofs","t":"Erd\u0151s #23: a triangle-free graph on 5n vertices needing more than n^2 deletions to be bipartite, or a certified extension of Ferudun's n <= 40 range","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"erdos-273-covering-moduli-p-minus-1","cat":"erdos-and-proofs","t":"Erd\u0151s #273: a covering system with distinct moduli of the form p - 1, p >= 5 prime","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"erdos-313-primary-pseudoperfect-new","cat":"number-hunts","t":"Erd\u0151s #313: a new primary pseudoperfect number (1/p_1 + ... + 1/p_k = 1 - 1/m), beyond the 11 known","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"erdos-366-two-full-three-full-pair","cat":"number-hunts","t":"Erd\u0151s #366: a 2-full n with n+1 3-full (or two consecutive 3-full integers)","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"erdos-773-sidon-squares-next-term","cat":"erdos-and-proofs","t":"Erd\u0151s #773 small cases: largest Sidon subset of the first n squares, a(72) and beyond (OEIS A390813)","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"friedman-mathmagic-archive-records","cat":"recreational-math","t":"Erich Friedman's Math Magic archive: beat a best-known entry on a monthly-problem page (non-packing categories)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"gtopx-interplanetary-trajectory-records","cat":"engineering","t":"ESA GTOP / GTOPX interplanetary trajectory benchmarks: beat a best-known Delta-v, mass or mission time (Messenger full 1.9579 km/s, Cassini2 8.3830 km/s, Rosetta 1.34334 km/s, GTO\u2026","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"mertens-function-exact-values-next-terms","cat":"number-hunts","t":"Exact Mertens function values: M(10^24) (A084237) or M(2^76) (A084236), with new terms of A084235 (first k with |M(k)| = 2^n) as partial wins","k":"harvest","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"square-grid-lattice-gas-exact-counts-oeis","cat":"physics","t":"Exact partition functions of lattice gases on n x n boards: the next term of OEIS A028420 (monomer-dimer), A006506 (hard squares), A063443 (kings/1x1-2x2 tilings), A054759 (square\u2026","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"extremal-doubly-even-self-dual-96-120-128","cat":"record-tables","t":"Extremal doubly-even self-dual binary codes at lengths 96, 120 and 128 (beyond the famous 72)","k":"moonshot","tr":null,"cp":"needs cluster for a sea\u2026","cb":"cluster"},{"id":"fault-free-domino-tilings-a124997-n13","cat":"graphs-games-automata","t":"Fault-free domino tilings of the 2n x 2n square: the next term A124997(13) (the 26 x 26 board), open since 2016","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"feigenbaum-constants-and-accumulation-point-digits","cat":"physics","t":"Feigenbaum constants and the period-doubling accumulation point: more verified digits than the published records","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"fibonacci-lucas-composite-factors","cat":"number-hunts","t":"Fibonacci and Lucas numbers F_n, L_n (n < 10,000): a new factor of a listed composite cofactor","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ccd-finnis-sinclair-mo-fe-clusters","cat":"packings-physics","t":"Finnis-Sinclair molybdenum and iron clusters (N = 3..100): lower a putative global minimum in the Elliott-Shibuta-Wales tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"five-voter-tournaments-n5","cat":"graphs-games-automata","t":"Five voters: a tournament on at most 21 alternatives that no five voters can induce by majority (13 <= N(5) <= 22, Chindelevitch-Harutyunyan Question 1)","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"bipartite-ramsey-b5-quadrilateral","cat":"graphs-games-automata","t":"Five-colour bipartite Ramsey number b5(2) (26-28): a rectangle-free 5-colouring of the 26 x 26 grid, or a proof that none exists","k":"standard","tr":null,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"fixed-polyominoes-a001168-n71","cat":"graphs-games-automata","t":"Fixed polyominoes: the exact count of 71-cell polyominoes (next term of OEIS A001168 after Barequet and Ben-Shachar's n = 70)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"fjsplib-flexible-jobshop-open-ub","cat":"optimization-benchmarks","t":"Flexible job shop (FJSPLib: Brandimarte mk10, Dauzere-Peres-Paulli, Behnke-Geiger, Hurink): lower the best known makespan of an open instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"fc-graffiti-oeis-solved-sorries","cat":"formal-proofs","t":"Formal Conjectures WrittenOnTheWallII (Graffiti) and OEIS collections: research-solved conjectures without any Lean proof","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"fc-finite-witness-sorries","cat":"formal-proofs","t":"Formal Conjectures: research-solved sorries closable by an explicit finite witness (R(5,5) > 42 graph, small Hadamard orders, ...)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"three-heap-wythoff-fraenkel-a1-11","cat":"graphs-games-automata","t":"Fraenkel's N-heap Wythoff conjectures: prove the three-heap case with smallest heap 11 (Sun-Zeilberger stopped at 10)","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"turan-k4-minus-3-graph-density","cat":"erdos-and-proofs","t":"Frankl-F\u00fcredi K4^- problem: a certified upper bound on pi(K4^-) below 0.286504, or a K4^--free 3-graph denser than 2/7","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"free-polyforms-catch-up-with-fixed-counts","cat":"graphs-games-automata","t":"Free polyominoes, polyhexes and polyiamonds: close the gap to the fixed counts (A000105 beyond n = 59, A000228 beyond 36, A000577 beyond 52)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"full-flag-codes-binary-a2f-5-2","cat":"record-tables","t":"Full flag codes over F_2: beat A^f_2(5,2) >= 3120 (upper bound 3255) or A^f_2(6,6) >= 224","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"fullerene-isomer-counts-beyond-c400","cat":"chemistry-materials","t":"Fullerene isomer counts: the number of fullerenes (OEIS A007894) or IPR fullerenes (A046880) with 402 carbon atoms or more","k":"standard","tr":null,"cp":"laptop-days via the pub\u2026","cb":"days"},{"id":"jet-tagging-fundamental-limit-gpt-jets-gap","cat":"particle-physics","t":"Fundamental limit of jet tagging (GPT-generated top/QCD jets with known likelihood ratio): beat the best tagger's rejection 553 at 50% top efficiency","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"furstenberg-sarkozy-c4b-lower-bound","cat":"erdos-and-proofs","t":"Furstenberg-Sarkozy exponent C_4b: a larger square-difference-free set exponent","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"life-smaller-orphan","cat":"graphs-games-automata","t":"Game of Life orphan with a smaller bounding box","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"life-still-life-counts-35-cells","cat":"graphs-games-automata","t":"Game of Life still-life enumeration: the number of strict and pseudo still lifes with 35 cells (A019473, A056613), or quasi still lifes with 23 cells (A330283)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"gcw-cullen-woodall-composites","cat":"number-hunts","t":"Generalized Cullen and Woodall numbers n*a^n +- 1 (a <= 12, n <= 1000): factor a listed composite cofactor","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"generalized-offdiagonal-schur-s3-stu","cat":"number-hunts","t":"Generalized off-diagonal Schur numbers S(3; s,t,u): refute Ahmed\u2013Schaal's S = stu - tu - u - 1 or settle a new cell with a certificate","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"generalized-wilson-primes-open-orders","cat":"number-hunts","t":"Generalized Wilson primes: the first prime of order n for the 24 orders n < 100 with none known (OEIS A128666)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"genernib-grn-inference-beat-leaderboard","cat":"biology","t":"geneRNIB: beat the best listed gene-regulatory-network inference scores on a perturbation dataset","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"massbalancemachine-norway-test-glaciers-rmse","cat":"earth-and-sky","t":"Glacier point mass balance in Norway: beat the Mass Balance Machine RMSE on the 14 withheld test glaciers","k":"standard","tr":null,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"go-small-rectangular-boards","cat":"graphs-games-automata","t":"Go on small rectangular boards: an exact first-player score for a blank or ' > =6' cell of van der Werf's m x n table (3x10, 2x12, 4x8, 5x7, 6x6, ...)","k":"harvest","tr":null,"cp":"laptop-days for the 24-\u2026","cb":"days"},{"id":"graph-design-spectra-possible-exceptions","cat":"record-tables","t":"Graph-design spectra: decompose K_16 into 12 copies of a 6-vertex 10-edge graph, K_21 into 7 icosahedra, or settle another listed possible exception","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"long-run-gray-code-r8","cat":"algorithms","t":"Gray codes with long bit runs: an 8-bit Gray code whose bit runs all have length at least 6, or a proof that r(8) = 5","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"grothendieck-kg3-werner-locality-bounds","cat":"physics","t":"Grothendieck constant of order 3 / two-qubit Werner nonlocality threshold: improve 1.43670 <= K_G(3) <= 1.4546","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"ccd-gupta-murrell-mottram-metal-clusters","cat":"packings-physics","t":"Gupta and Murrell-Mottram metal clusters (Zn, Cd <= 125; Pb <= 150; Na <= 379/380): lower a putative global minimum in the Doye tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ccd-gupta-cobalt-clusters-n200","cat":"packings-physics","t":"Gupta cobalt clusters (N = 2..200): lower a putative global minimum on the Cambridge Cluster Database cobalt table or its posted improvements","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"guy-hill-cycle-complement-crossing","cat":"graphs-games-automata","t":"Guy-Hill conjecture for the complement of a cycle: determine cr(complement of C_11) (conjectured 36)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"torus-grid-crossing-c8-c8","cat":"graphs-games-automata","t":"Harary-Kainen-Schwenk conjecture: is cr(C_8 x C_8) = 48? (smallest open toroidal grid)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"hard-square-critical-activity-digits","cat":"physics","t":"Hard-square lattice gas: more digits of the critical activity z_c = 3.7962551739... (Guo-Blote 2002) or of the negative-activity singularity -0.1193388818... (Todo 1999)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"vesuvius-ink9um-validation-masks-buffered","cat":"herculaneum-scrolls","t":"Herculaneum 9 \u00b5m ink detection within a scroll: beat every public model's average precision on the three official ink_9um validation masks (384 px buffer rule)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"vesuvius-frag4-ink-f05-holdout","cat":"herculaneum-scrolls","t":"Herculaneum fragment ink detection: beat the 2023 Kaggle winners' own weights on the released hidden-test Fragment 4 (PHercParis1Fr39) under one pinned full-fragment F0.5 protocol\u2026","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"vesuvius-profilometer-ink-dice","cat":"herculaneum-scrolls","t":"Herculaneum optical-profilometry ink segmentation: beat the Sci. Rep. 2026 nnU-Net held-out Dice on the shipped 5-fold splits of scrollprize/profilometer, topography only","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"hex-10x10-opening-moves","cat":"graphs-games-automata","t":"Hex 10x10: solve a second opening move (only the central f5/e6 pair is solved, since 2013)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"hexadecimal-games-unsolved-periodicity","cat":"graphs-games-automata","t":"Hexadecimal games: certify the (arithmetic) periodicity of one game on Nowakowski's unsolved list (.f6, .7f, .9, .e, .b6, ...)","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"hg002-ont-read-correction-gqc-error-rate","cat":"genomics","t":"HG002 nanopore read correction scored against the Q100 genome: corrected ONT reads with fewer errors per megabase than HERRO's 88 (GQC readbench)","k":"standard","tr":null,"cp":"needs cluster or a GPU\u2026","cb":"cluster"},{"id":"symmetric-polyomino-holeless-tetrad","cat":"graphs-games-automata","t":"Holeless tetrad from a symmetric polyomino with at most 33 cells (record: 34-ominoes, Rubin and Scherer)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"homfam-msa-total-column-score","cat":"biology","t":"HomFam multiple sequence alignment: beat learnMSA2's best 66.92% mean total-column score over the 94 HomFam families","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"homogeneous-cunningham-composites","cat":"number-hunts","t":"Homogeneous Cunningham numbers a^n +- b^n: a new factor of one of the 565 listed composites","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"iccad2022-3d-placement-d2d-wirelength","cat":"engineering","t":"ICCAD 2022 CAD Contest Problem B (3D placement with D2D vertical connections): a shorter legal 3D placement than the best published","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"iccad2023-3d-mixed-size-placement-score","cat":"engineering","t":"ICCAD 2023 CAD Contest Problem B (3D placement with macros): a lower HPWL + 10 x HBT score than the best published","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"iea37-cs4-borssele-81-turbine-layout","cat":"engineering","t":"IEA Wind Task 37 case study 4 (Borssele III/IV, 81 x 10 MW): a feasible layout with higher AEP than DEBO's 2,913,220.604 MWh","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"inatsounds-test-map","cat":"ecology","t":"iNatSounds 2024: beat the best published test mAP (65.4) for file-level species ID across 1,212 species of birds, frogs, insects and mammals","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"integer-complexity-conjecture-a","cat":"number-hunts","t":"Integer complexity Conjecture A: ||2^a 3^b 5^c|| = 2a + 3b + 5c for c < 6 (Selfridge's ||2^a|| = 2a); a counterexample, or a proof beyond Altman's a <= 48","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"integer-complexity-smallest-complexity-90","cat":"number-hunts","t":"Integer complexity: the smallest number of complexity 90, A005520(90), beyond the 10^12 computation of Iraids et al.","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"isic2017-part3-melanoma-sk-mean-auc","cat":"disease-research","t":"ISIC 2017 Part 3 (melanoma and seborrheic keratosis): beat the challenge-best mean AUC of 0.911 on the public 600-image test labels","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"isic2018-lesion-segmentation-thresholded-jaccard","cat":"disease-research","t":"ISIC 2018 skin-lesion segmentation: beat the challenge-winning thresholded Jaccard on the public test ground truth","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"isic2018-task3-lesion-diagnosis-balanced-accuracy","cat":"disease-research","t":"ISIC 2018 Task 3 (HAM10000 diagnosis, 7 classes): beat the best balanced multiclass accuracy on the 1,512-image public test ground truth","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"itc2007-exam-timetabling-bks","cat":"optimization-benchmarks","t":"ITC-2007 examination timetabling (track 1): beat the best known penalty on one of the 12 competition instances","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"itc2021-sports-timetabling-ub","cat":"optimization-benchmarks","t":"ITC2021 sports timetabling: lower the best known penalty of an open instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"iwls2026-aig-delay-area-pareto","cat":"algorithms","t":"IWLS 2026 Programming Contest: an AIG off the virtual-best delay/area Pareto frontier for one of the 100 released truth tables (ex200-ex299)","k":"harvest","tr":null,"cp":"laptop-hours per benchm\u2026","cb":"hours"},{"id":"jarvis-single-entry-perovskite-mxene-phonon-dos","cat":"chemistry-materials","t":"JARVIS-Leaderboard single-entry materials tasks: halide perovskites (5 properties), MXene formation energy and phonon DOS spectra: beat the only listed model","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"kalah-6-6-standard-exact-value","cat":"graphs-games-automata","t":"Kalah(6,6) under standard capture rules: the exact perfect-play margin (proven only 'first player wins by at least 4')","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"knights-tour-counts-10x10-closed-9x9-open","cat":"graphs-games-automata","t":"Knight's tour enumeration: the number of closed tours on the 10 x 10 board (A001230(5)) or open tours on the 9 x 9 board (A165134(9))","k":"moonshot","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"knotinfo-mosaic-number-twelve-crossing","cat":"wildcard","t":"Knot mosaics: the first mosaic, or a 7-mosaic, for one of the 854 11- and 12-crossing knots with no known mosaic in KnotInfo","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-bridge-index-13-crossing","cat":"wildcard","t":"KnotInfo bridge index: settle one of the 536 13-crossing knots listed [3,4] by a 3-bridge diagram or a rank-4 Coxeter quotient","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-concordance-genus-unknown","cat":"wildcard","t":"KnotInfo concordance genus: a certified concordance to a lower-genus knot for one of the 208 11- and 12-crossing knots listed as intervals (incl. the Conway knot 11n_34 at [1,3])","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"knotinfo-nonorientable-4genus-bounds","cat":"wildcard","t":"KnotInfo smooth 4D crosscap numbers: a nonorientable band certificate beating an upper bound for an 11-13 crossing knot (3,525 intervals)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-turaev-genus-twelve-crossing","cat":"wildcard","t":"KnotInfo Turaev genus: a Turaev-genus-1 diagram for one of the 25 non-alternating knots (11n_118 and 24 at 12 crossings) listed [1,2]","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-smooth-4genus-slice-unknown","cat":"wildcard","t":"KnotInfo: close one of the last interval-valued smooth 4-genus entries (13 crossings) by an explicit ribbon disk or genus-1 cobordism","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"knotinfo-unknotting-number-unknown","cat":"wildcard","t":"KnotInfo: determine an unknotting number currently listed as an interval","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"kotzig-nim-tan-ward-conjectures","cat":"graphs-games-automata","t":"Kotzig's Nim: refute a Tan-Ward periodicity conjecture or extend its verified range (G(1,5;n) beyond n = 140, G(3,5;n) beyond 111, ...)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"perfect-1-factorisation-open-orders","cat":"graphs-games-automata","t":"Kotzig's perfect 1-factorisation conjecture: a perfect 1-factorisation of K_64 (or K_66, 70, 76, 78, 88, 96, 100)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"kourovka-20-21-isomorphic-normal-subgroups-c12-a4","cat":"wildcard","t":"Kourovka 20.21 (Verret/Conder): isomorphic normal subgroups K and L of index 12 with G/K = C12 and G/L = A4","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"burnside-b34-fewer-fourth-powers","cat":"wildcard","t":"Kourovka 20.36 (Havas-Newman): define B(3,4) with fewer than a million fourth powers","k":"standard","tr":null,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"vandiver-beyond-2-31","cat":"number-hunts","t":"Kummer-Vandiver conjecture: extend the verified range past 2^31 (Hart-Harvey-Ong, 2016)","k":"harvest","tr":null,"cp":"needs cluster for the f\u2026","cb":"cluster"},{"id":"landau-constant-lower-bound","cat":"erdos-and-proofs","t":"Landau's constant L (C_57b): a certified lower bound above Wikstrom's 0.51 (covering radius 0.51003; upper bound 0.5433)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"langford-skolem-pairings-next-counts","cat":"recreational-math","t":"Langford's problem: the number of Langford pairings L(2,31) or L(2,32), or the next Nickerson-Skolem (V(2,32), V(2,33)) or planar (P(43), P(44)) counts","k":"harvest","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"rk-ap-free-next-terms-k4-k5-k6","cat":"number-hunts","t":"Largest k-AP-free subsets of [1..n] for k = 4, 5, 6: the next exact terms of A003003 (n = 143), A003004 (n = 116) and A003005 (n = 148)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"latin-no-disjoint-transversals-no-pinned-small-even","cat":"record-tables","t":"Latin squares of even order 10..26, or odd order, whose transversals pairwise intersect yet share no common cell (Ghafari-Wanless Conjecture 3 small orders)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"lattice-animals-hypercubic-d4-plus-exact-counts","cat":"physics","t":"Lattice animals in 4 to 9 dimensions: the next exact count of fixed polycubes beyond Luther and Mertens (OEIS A151830-A151835, unchanged since 2011)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"ppi-bernett-gold-standard-auprc","cat":"biology","t":"Leakage-free protein-protein interaction prediction: beat the best published AUPR on the Bernett gold-standard human dataset","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"lennard-jones-ccd-doye-table","cat":"packings-physics","t":"Lennard-Jones clusters: lower a putative global minimum in the Cambridge Cluster Database / Doye tables (N = 3..150, 310..1000)","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"linear-trimer-coverings-a139772-24x24","cat":"graphs-games-automata","t":"Linear trimer (I-tromino) tilings of the 3n x 3n square: the next term A139772(8), the 24 x 24 board","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"local-cyclicity-centers-m3-thirteen","cat":"wildcard","t":"Local cyclicity M(n): 13 small-amplitude limit cycles from one cubic equilibrium, or beat M(4) >= 21, M(5) >= 33, M(6) >= 48, M(7) >= 61, M(8) >= 76, M(9) >= 88","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"uncrossed-knight-path-10x10","cat":"recreational-math","t":"Longest uncrossed knight's path: settle the open 10 x 10 value (OEIS A003192, best known 61) or the closed 11 x 11 value (A157416, best known 70)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"mnk-game-five-in-a-row-9x9","cat":"graphs-games-automata","t":"m,n,k-games: settle five-in-a-row (k = 5) on 9x9 or another board between 8x8 (draw) and 15x15 (win)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"m3-competition-beat-best-published-smape","cat":"machine-learning","t":"M3 competition (3,003 series): an out-of-sample average sMAPE below the best published 12.37","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"mahler-problem-littlewood-large-measure-records","cat":"record-tables","t":"Mahler's problem for Littlewood polynomials: beat the skew-symmetric record Mahler measure at an even degree 32-60 in Mossinghoff's tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"masser-gramain-constant-certified-bracket","cat":"number-hunts","t":"Masser-Gramain constant delta: a certified bracket narrower than Melquiond-Nowak-Zimmermann's 1.819776 < delta < 1.819833 (2013)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"matbench-medium-structure-tasks-cpu","cat":"physics","t":"Matbench v0.1 medium tasks (phonons, dielectric, expt_is_metal, log_gvrh, log_kvrh, perovskites): beat the verified leaderboard score with CPU-trained models","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"matbench-small-data-tasks","cat":"physics","t":"Matbench v0.1: beat the per-task leaderboard on a small-data task (steels, jdft2d, expt_gap, glass) with CPU-only models","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"meanders-semimeanders-next-terms","cat":"graphs-games-automata","t":"Meanders and semi-meanders: the next exact term of OEIS A005316 (open meanders, known to n = 58) or A000682 (semi-meanders, known to n = 49)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"meunier-stable-kneser-odd-s-small-n","cat":"graphs-games-automata","t":"Meunier's s-stable Kneser conjecture: certify chi = n - sk + s for open small cases with odd s (e.g. all of (k, s) = (3, 5), n = 16..21)","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"sinitic-protoform-reconstruction-wikihan","cat":"ancient-texts","t":"Middle Chinese protoform reconstruction (WikiHan, WikiHan-aug, H\u00f3u): beat the Lu-Wang-Mortensen 2024 reranked systems on accuracy and token edit distance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"sloane-hard-sphere-clusters-second-moment","cat":"packings-physics","t":"Minimal-energy clusters of hard spheres: N unit spheres in R^3 (N <= 99) or R^4 (N <= 32) with smaller second moment than the Sloane-Hardin-Duff-Conway table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"min-comparison-sorting-s23-s24","cat":"algorithms","t":"Minimum-comparison sorting: settle S(23) in {75, 76} or S(24) in {80, 81} (OEIS A036604), or raise the n = 28 lower bound","k":"moonshot","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"miplib2017-open-primal-bound","cat":"optimization-benchmarks","t":"MIPLIB 2017: improve the best known objective of an open collection instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"mlgwsc1-dataset3-sensitive-distance","cat":"earth-and-sky","t":"MLGWSC-1 gravitational-wave search challenge: beat the best published sensitive distance at a false-alarm rate of 1 per month on dataset 3","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"moabb-within-session-benchmark-cells","cat":"neuroscience","t":"MOABB EEG-BCI benchmark: one pipeline that beats the published best within-session score on at least three datasets of a paradigm table","k":"harvest","tr":null,"cp":"laptop-hours per dataset","cb":"hours"},{"id":"mondrian-art-problem-defect-records","cat":"recreational-math","t":"Mondrian Art Problem: a smaller defect than the best known for some n = 67..96 (OEIS A276523), or the exact a(67)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"mint-net-below-digital-bound","cat":"record-tables","t":"MOONSHOT - A (t,m,s)-net that beats every digital net: t below MinT's proven digital lower bound, e.g. a (2,8,7)-net in base 2","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"truncated-tetrahedra-snub-solids-packing","cat":"packings-physics","t":"MOONSHOT - Archimedean solids without central symmetry: beat 207/208 for truncated tetrahedra (Jiao-Torquato), or the lattice records 0.787699 / 0.788640 for the chiral snub cube\u2026","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"beckett-gray-code-n9","cat":"algorithms","t":"MOONSHOT - Beckett-Gray codes: does a 9-bit Beckett-Gray code exist? (open for every n >= 9)","k":"moonshot","tr":null,"cp":"needs cluster for exhau\u2026","cb":"cluster"},{"id":"polycube-genus0-edge-unfolding-counterexample","cat":"recreational-math","t":"MOONSHOT - Edge-unfolding polycubes (TOPP Problem 64): a genus-0 polycube with no edge unfolding along cube edges","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"odd-weird-primitive-weird-erdos-470","cat":"number-hunts","t":"MOONSHOT - Erd\u0151s #470: an odd weird number, or primitive weird numbers with more than 16 prime factors or a cubed odd prime factor","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"erdos-straus-beyond-1e18","cat":"number-hunts","t":"MOONSHOT - Erd\u0151s\u2013Straus conjecture (Erd\u0151s #242): 4/n with no 3-term Egyptian fraction, or verification beyond 10^18","k":"moonshot","tr":null,"cp":"laptop-days for a range\u2026","cb":"days"},{"id":"eulerian-synchronizing-szykula-vorel-bound","cat":"graphs-games-automata","t":"MOONSHOT - Eulerian synchronizing automata: a reset threshold above floor((n^2-3)/2) (refuting the Szyku\u0142a-Vorel conjecture), or binary Eulerian records","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"firing-squad-five-state-minimal-time","cat":"graphs-games-automata","t":"MOONSHOT - Firing squad synchronization: a 5-state minimal-time solution, or a certified proof that none exists (Mazoyer's 6 states have stood since 1987)","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"harmonious-tree-conjecture-beyond-31","cat":"graphs-games-automata","t":"MOONSHOT - Graham-Sloane harmonious tree conjecture: a tree that is not harmonious, a formal proof, or the first verification past Fang's 31 vertices","k":"moonshot","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"leanapap-kelley-meka-integer-bound","cat":"formal-proofs","t":"MOONSHOT - LeanAPAP: formal proof of the Kelley-Meka bound for 3AP-free sets of integers (corrected form of theorem `int`)","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"ore-harmonic-number-conjectures","cat":"number-hunts","t":"MOONSHOT - Ore's harmonic numbers: an odd one (Ore's conjecture), or a counterexample to the practical, Mersenne-factor or completeness conjectures recorded in OEIS A001599","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"hypercubic-percolation-1-over-d-series-next-term","cat":"physics","t":"MOONSHOT - Percolation threshold of Z^d in powers of 1/(2d-1): the first coefficient beyond Mertens-Moore's 119077/96 (site) and 4855/12 (bond)","k":"moonshot","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"ps-minus-ground-state-energy-digits","cat":"physics","t":"MOONSHOT - Positronium negative ion Ps- (e- e+ e-): a variational ground-state energy below Frolov's 2023 record -0.26200507023298010777040211998","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"binary-q-fano-plane-s2-2-3-7","cat":"record-tables","t":"MOONSHOT - The binary q-analog of the Fano plane S_2[2,3,7] (fallback: a (7,4;3)_2 subspace code with more than 333 planes)","k":"moonshot","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"moonstone-lunar-benchmark-beat-mg-mae","cat":"planetary-science","t":"Moonstone lunar benchmark: beat MG-MAE on crater segmentation, mare segmentation or geologic-unit classification on the fixed split","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"mrs-perkins-quilt-large-sides","cat":"recreational-math","t":"Mrs Perkins's quilt: a coprime squared square with at most n squares and a larger side than the best known (OEIS A089047/A089046, n >= 19)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"multicolour-cycle-ramsey-small","cat":"record-tables","t":"Multicolour Ramsey numbers of short cycles: close R5(C4) 27-29, R6(C4) 34-38, R4(C6) 18-20, R(C3,C3,C4,C4) 30-36, R(C4,C4,K4) 20-21 or a similar DS1 cell","k":"harvest","tr":null,"cp":"laptop-hours for lower\u2026","cb":"hours"},{"id":"antipodal-gray-code-n10","cat":"algorithms","t":"n-antipodal Gray codes: is there a 10-bit Gray code in which every word's complement is exactly 10 steps away? (Killian-Savage, open for even n >= 10)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"nanogpt-slowrun-100m-token-val-loss","cat":"machine-learning","t":"NanoGPT Slowrun: lowest FineWeb val loss from a fixed 100M-token training set (1-hour track 3.183, unlimited 2.987)","k":"harvest","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"ccmc-flare-scoreboard-m-bss-2023-2024","cat":"earth-and-sky","t":"NASA CCMC Flare Scoreboard: a reproducible 24-hour M-class flare forecast that beats every scoreboard model's Brier skill score over 2023-2024","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"nasa-tropical-storm-wind-speed-rmse","cat":"earth-and-sky","t":"NASA/Radiant Earth tropical-storm wind-speed challenge: beat the winning RMSE from GOES infrared imagery on the released test labels","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"tsp-national-bm33708-ch71009","cat":"optimization-benchmarks","t":"National TSPs: a shorter tour for Burma (bm33708) or China (ch71009), the two unsolved Waterloo country instances","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"near-extremal-self-dual-weight-enumerators","cat":"record-tables","t":"Near-extremal self-dual codes with new weight enumerators: realize an admissible ternary (lengths 36-72) or quaternary Hermitian (lengths 24-36) enumerator not yet known to exist","k":"harvest","tr":null,"cp":"laptop-hours: negacircu\u2026","cb":"hours"},{"id":"kamada-near-repdigit-sequences-without-prime","cat":"number-hunts","t":"Near-repdigit-related sequences with no known prime (Kamada): 298...89, 25...567, 45...529, 54...427, 454...41","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"nlb21-released-test-cobps","cat":"neuroscience","t":"Neural Latents Benchmark '21 (test data now public): beat the final EvalAI leaderboard's top co-smoothing bits/spike on an NLB dataset split","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"kepler-eb-circumbinary-transit-candidate","cat":"sky-archives","t":"New circumbinary transit candidate in a Kepler eclipsing binary (Villanova EB catalog)","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"xmm-chandra-archival-new-xray-periodicity","cat":"sky-archives","t":"New coherent X-ray periodicity in an archival XMM-Newton or Chandra source (5XMM-DR15 / CSC 2.2), confirmed independently and absent from period catalogues","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"gwosc-o4-missed-cbc-candidate","cat":"earth-and-sky","t":"New compact-binary merger candidate in public O4a/O4b LIGO-Virgo strain that GWTC-4.1, GWTC-5.0 and the community catalogs do not list","k":"standard","tr":null,"cp":"laptop-days for one mon\u2026","cb":"days"},{"id":"apollo-moonquake-missed-vs-pds-catalog","cat":"earth-and-sky","t":"New deep moonquake or impact in open Apollo Passive Seismic Experiment data, absent from the PDS expanded lunar event catalogue","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"tess-exocomet-dip-candidate","cat":"sky-archives","t":"New exocomet-transit candidate (asymmetric single dip) in public TESS light curves","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"degree-diameter-table","cat":"graphs-games-automata","t":"New largest known (Delta,D) graph in the degree-diameter table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"kmtnet-2024-2025-planetary-anomaly-candidate","cat":"sky-archives","t":"New planetary-anomaly candidate in public KMTNet 2024-2025 microlensing light curves, absent from the KMTNet planet list and the archives","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"small-body-satellite-archival-not-in-johnston","cat":"planetary-science","t":"New satellite of a TNO, Centaur, Jupiter Trojan or asteroid resolved in public archival HST, JWST or adaptive-optics images, absent from Johnston's Archive","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"kepler-tess-single-transit-long-period-candidate","cat":"sky-archives","t":"New single-/duo-transit long-period candidate in Kepler or TESS light curves","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"gaia-stellar-stream-not-in-galstreams","cat":"sky-archives","t":"New stellar stream in Gaia DR3 absent from the galstreams library (v1.2.1) and the STREAMFINDER atlas","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"wd-debris-transit-new-candidate","cat":"sky-archives","t":"New white dwarf with transiting planetary debris in public ZTF or TESS light curves","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"nim-dimension-clobber-amazons","cat":"graphs-games-automata","t":"Nim-dimension of Amazons: a position equal to *8 (only *4 is known)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"nogo-fraction-one-sixteenth","cat":"graphs-games-automata","t":"NoGo: a position on a Go board with value 1/16 (only 1, 1/2, 1/4 and 1/8 are known)","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"kings-hard-core-entropy-a247413-digits","cat":"physics","t":"Non-attacking kings (hard-core gas with diagonal exclusion) at unit activity: more correct digits of the entropy constant OEIS A247413","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"sprouts-normal-play-63-spots","cat":"graphs-games-automata","t":"Normal-play Sprouts: settle the 63-spot game or another open n <= 105 (SPOTS frontier, 2026)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"chess-legal-positions-upper-bound","cat":"recreational-math","t":"Number of legal chess positions: a provable upper bound well below Tromp's 8.7279e45 ranking","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"games-born-by-day-4-count","cat":"graphs-games-automata","t":"Number of short games born by day 4: tighten Suetsugu's bounds 10^28.2 < |G4| < 4.0e184 (OEIS A065401 a(4))","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"obelix-li-electrolyte-ionic-conductivity-mae","cat":"physics","t":"OBELiX experimental Li solid-electrolyte ionic conductivity: beat the published best test MAE of 1.59 log10(S/cm) on the official 121-entry test split","k":"harvest","tr":null,"cp":"laptop-minutes","cb":"min"},{"id":"ssh-mapping-ose-2021a-resolution","cat":"earth-and-sky","t":"Ocean data challenge 2021a (SSH mapping OSE): beat the leaderboard effective resolution or RMSE score on real altimetry","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"odd-graceful-trees-beyond-12","cat":"graphs-games-automata","t":"Odd-graceful tree conjecture (Gnanajothi): extend the verification past 12 vertices, or a tree that is not odd-graceful","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ogbg-molpcba-beat-leaderboard-ap","cat":"drug-discovery","t":"OGB ogbg-molpcba: beat the leaderboard's top test AP (0.3204) on 128 PubChem bioassays","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"ogbg-ppa-beat-leaderboard-accuracy","cat":"machine-learning","t":"OGB ogbg-ppa: beat the leaderboard's top test accuracy (0.8258) for classifying protein-association graphs by taxonomic group","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"ogbl-vessel-beat-leaderboard-roc-auc","cat":"machine-learning","t":"OGB ogbl-vessel: beat the leaderboard's top test ROC-AUC (0.9838) for mouse-brain vessel link prediction","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ogbn-arxiv-no-ext-beat-leaderboard-accuracy","cat":"machine-learning","t":"OGB ogbn-arxiv: beat the top no-external-data test accuracy (0.7611) for arXiv CS subject classification","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ogbn-mag-beat-leaderboard-venue-accuracy","cat":"machine-learning","t":"OGB ogbn-mag: beat the leaderboard's top test accuracy (0.5801) for heterogeneous-graph paper venue prediction","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"s2-cloud-cover-challenge-private-jaccard","cat":"earth-and-sky","t":"On Cloud N (Sentinel-2 cloud cover challenge): beat the winning 0.8974 Jaccard on the released private test split","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"online-bin-stretching-computer-lower-bounds","cat":"algorithms","t":"Online bin stretching: a computer-certified adversary tree beating the best lower bound for some m in 3..12 (41/30, 19/14, 15/11 cells), with randomized and upper-bound cells as p\u2026","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"aliquot-open-sequence-termination","cat":"number-hunts","t":"Open aliquot sequences below 5,000,000: terminate one (reach a prime) or close it into a cycle","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"openproblems-predict-modality-cite-rmse","cat":"biology","t":"Open Problems predict modality: beat the best listed RMSE for predicting protein abundance from RNA (and RNA from ATAC) on NeurIPS 2021/2022 data","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"openproblems-scrna-denoising-beat-leaderboard","cat":"biology","t":"Open Problems single-cell denoising: beat every listed method on the molecular-cross-validation leaderboard","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"openproblems-spatial-decomposition-r2","cat":"biology","t":"Open Problems spatial decomposition: beat the best listed R^2 for cell-type proportions on a benchmark dataset","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"openkbp-dose-prediction-test-dose-dvh-score","cat":"disease-research","t":"OpenKBP radiotherapy dose prediction: beat the challenge winner's dose score 2.429 Gy or DVH score 1.478 Gy on the 100 released test patients","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"orientable-sequences-binary-n17-and-kary","cat":"record-tables","t":"Orientable sequences: a binary orientable cycle of order 18-20 longer than the best claimed period, or a k-ary period beating the Mitchell-Wild tables","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"packomania-hyperspheres-hsp4-hsp6","cat":"packings-physics","t":"Packomania: equal 4D/5D/6D hyperspheres in a hypersphere (hsp4, hsp5, hsp6), beat a per-N record radius","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"packomania-cci-equal-circles-in-circle","cat":"packings-physics","t":"Packomania: equal circles in a circle (cci), beat a per-N record radius","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"packomania-csq-equal-circles-in-square","cat":"packings-physics","t":"Packomania: equal circles in a square (csq), beat a per-N record radius","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"pannuke-three-fold-mpq","cat":"disease-research","t":"PanNuke pan-cancer nucleus segmentation and classification: beat the best published three-split mPQ (0.5123, PromptNucSeg-H)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"parameter-golf-16mb-fineweb-bpb","cat":"machine-learning","t":"Parameter Golf (finished): a 16 MB language-model artifact trained in 10 min on 8xH100 that beats 1.0565 bits per byte on FineWeb val","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"pcam-patchcamelyon-from-scratch-accuracy","cat":"disease-research","t":"PatchCamelyon (lymph-node metastasis patches): beat 89.8% accuracy / 0.963 AUC on the official test split without external pretraining","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"involutions-avoiding-1324-4231-next-terms","cat":"recreational-math","t":"Pattern-avoiding involutions: the next exact count of involutions avoiding 1324 (n = 35) or 4231 (n = 41)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"penetrable-disks-continuum-percolation-discrepancy","cat":"physics","t":"Penetrable disks in the plane: settle the 3-sigma clash between Mertens-Moore's eta_c = 1.12808737(6) and the critical-polynomial 1.12808706(8)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"obtuse-triangle-billiards-periodic-beyond-112-3","cat":"wildcard","t":"Periodic billiard paths in obtuse triangles: extend the 112.3-degree theorem (Tokarsky-Garber-Marinov-Moore 2018)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"permutation-snark-6-mod-8","cat":"graphs-games-automata","t":"Permutation snarks: a first one of order 6 mod 8 (at least 54 vertices) or a first one of girth at least 6","k":"standard","tr":null,"cp":"laptop-days for cycle-p\u2026","cb":"days"},{"id":"two-stack-series-sortable-count-n20","cat":"recreational-math","t":"Permutations sortable by two stacks in series: the exact count for n = 20 (first term beyond Elvey Price-Guttmann)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"petersen-colouring-smallest-counterexample","cat":"graphs-games-automata","t":"Petersen colouring conjecture (refuted 2026): a counterexample on fewer than 52 vertices (minimum is in [40, 52]) or a cyclically 5-edge-connected one","k":"standard","tr":null,"cp":"laptop-days for gadget/\u2026","cb":"days"},{"id":"pglib-opf-v2307-ac-cheaper-dispatch","cat":"optimization-benchmarks","t":"PGLib-OPF v23.07: an AC-feasible dispatch cheaper than the published baseline on a large case with an open relaxation gap","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"plant-genomic-benchmark-agront-expression-strength","cat":"biology","t":"Plants Genomic Benchmark (AgroNT): beat the published R^2 for plant gene expression on held-out gene families or for promoter and terminator strength","k":"harvest","tr":null,"cp":"laptop-hours for promot\u2026","cb":"hours"},{"id":"polaris-novartis-cyp3a4-aafe","cat":"drug-discovery","t":"Polaris novartis/adme-novartis-cyp3a4-reg: beat the listed absolute-average-fold-error on 368 test compounds","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"polaris-pkis2-kinase-small-leaderboards","cat":"drug-discovery","t":"Polaris PKIS2/PKIS1 kinase benchmarks (EGFR, KIT, RET, LOK-SLK): beat shallow leaderboards on 74-144 test compounds","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"polaris-tdcommons-mirror-admet-leaderboards","cat":"drug-discovery","t":"Polaris tdcommons/* ADMET mirrors: beat the top listed score on a single-fold public split (offline-scorable)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"tetromino-multiples-next-terms","cat":"graphs-games-automata","t":"Polyomino number theory: the next count of free polyominoes tiled by n copies of a tetromino (I: A397019, T: A397020, L: A397021, S: A397022)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"polyomino-oddities-open-cells","cat":"graphs-games-automata","t":"Polyomino oddities (Sillke figures): settle a '?' or 'Unsolved' cell, or beat a minimal known tile count on George Sicherman's oddity tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"polyomino-order-6-or-odd","cat":"graphs-games-automata","t":"Polyomino of order 6, or of odd order 5 or more","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"posebusters-redock-pb-valid-rate","cat":"drug-discovery","t":"PoseBusters benchmark set (428 complexes): raise the PB-valid RMSD<=2A redocking rate above the published classical-docking rate","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"spherical-quadrature-s2-positive-fewest-nodes","cat":"packings-physics","t":"Positive-weight quadrature on the sphere S^2: exact to degree t with fewer nodes than Graef's and Lebedev-Laikov's rules","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"precisionfda-truth-challenge-v2-difficult-mhc","cat":"genomics","t":"precisionFDA Truth Challenge V2 (finished, answers released): beat the best submission's F1 in difficult-to-map regions or the MHC for HG003/HG004 from the challenge reads","k":"harvest","tr":null,"cp":"laptop-days per sample\u2026","cb":"days"},{"id":"prime-gap-list-merit-improvement","cat":"recreational-math","t":"Prime Gap List: improve the record merit for some gap size","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"prime-counting-pi-10-30-and-siblings","cat":"number-hunts","t":"Prime-counting records: pi(10^30) (A006880), or a new pi(2^n), pi(e^n), pi(10^(n/2)) or 10^n-th prime value beyond Baugh and Walisch","k":"harvest","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"primes-between-consecutive-powers-legendre-cubes-frontier","cat":"number-hunts","t":"Primes between consecutive squares and cubes: extend Legendre's conjecture past n = 7.05 x 10^13 or the cube result past n^3 = 1.649 x 10^40","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"property-b-m5-upper-bound","cat":"erdos-and-proofs","t":"Property B: a non-2-colourable 5-uniform hypergraph with at most 50 edges (m(5) <= 51 since 1969)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"protein-engineering-tournament-supervised-spearman","cat":"biology","t":"Protein Engineering Tournament pilot (supervised track): beat the best team Spearman on a released enzyme property","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"protein-engineering-tournament-zeroshot-spearman","cat":"biology","t":"Protein Engineering Tournament pilot (zero-shot track): beat the best team score on an unseen enzyme","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"proteingym-clinical-substitutions-auc","cat":"disease-research","t":"ProteinGym clinical substitutions (ClinVar benign/pathogenic): beat the leaderboard's best average AUC","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"proteingym-per-assay-zero-shot","cat":"biology","t":"ProteinGym zero-shot substitutions: beat every listed model's Spearman on a single DMS assay","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ptbxl-ecg-macro-auc-fold10","cat":"disease-research","t":"PTB-XL ECG classification: beat the best published macro-AUC on the fixed fold-10 test set","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"pythagorean-triples-three-colour-record","cat":"erdos-and-proofs","t":"Pythagorean triples with three colours: a triple-free 3-colouring of {1..N} for N above 25,000,000","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"qaplib-open-instances-bkv","cat":"optimization-benchmarks","t":"QAPLIB: a permutation beating the best known value of one of the 28 unsolved instances (tai a/b, tai256c, sko, tho, wil)","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"qoblib-network-design-max-flow","cat":"optimization-benchmarks","t":"QOBLIB network design (Bienstock-Gunluk demands): a 2-in/2-out digraph and routing with lower maximum edge load for an open instance network11..network24","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"c4-versus-star-ramsey-open-values","cat":"record-tables","t":"Quadrilateral versus star (and wheel): settle an open value of R(C4, K_{1,n}) such as n = 39 (46-47) or n = 51-54, 71, 72","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"quantum-chromatic-orthogonal-rank-separation-under-21","cat":"physics","t":"Quantum chromatic number vs rank-1 quantum chromatic number: a graph on at most 20 vertices with chi_q(G) < chi_q^(1)(G) (smallest known: Lalonde's 21-vertex G21)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"quaternary-hadamard-bh-n-4-open-orders","cat":"record-tables","t":"Quaternary Hadamard matrices BH(n,4): settle an open even order below 2000 (smallest 334, then 438, 446, 478)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"racks-quandles-next-order","cat":"wildcard","t":"Racks and quandles: count those of order 14 (OEIS A181770/A181769), or the connected quandles of order 48 (A181771)","k":"harvest","tr":null,"cp":"laptop-days for the kei\u2026","cb":"days"},{"id":"ramsey-complete-bipartite-small-cells","cat":"record-tables","t":"Ramsey numbers of small complete bipartite graphs R(K_{m,n}, K_{p,q}): close a gap in DS1 Tables IVb/IVc (R(K3,5,K3,4) 25-29, R(K2,10,K2,7) 29-31, R(K2,2,K2,19) 28-29, R(K4,4,K4,4\u2026","k":"harvest","tr":null,"cp":"laptop-hours for lower\u2026","cb":"hours"},{"id":"randomized-metric-distortion-lower-bound","cat":"wildcard","t":"Randomized metric distortion: certify a lower bound above Charikar-Ramakrishnan's 2.11264 (current window [2.11264, 2.13713])","k":"moonshot","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"rectilinear-crossing-kn","cat":"graphs-games-automata","t":"Rectilinear crossing number of K_n: resolve n=28 (7233 vs 7234) or beat a best-known drawing","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"regular-hadamard-order-8836","cat":"record-tables","t":"Regular Hadamard matrix (Menon design) of order 4u^2 with u = 47 (order 8836), the first unknown order","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"asteroid-rotation-period-not-in-lcdb","cat":"sky-archives","t":"Reliable rotation periods for asteroids with no entry in the Asteroid Lightcurve Database, from public survey photometry","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"rnagym-ncrna-fitness-zero-shot-macro","cat":"biology","t":"RNAGym ncRNA fitness: beat the top signed-Spearman macro score on the live zero-shot leaderboard","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"romanoff-constant-c45-upper-bound","cat":"erdos-and-proofs","t":"Romanoff's constant C_45: a smaller certified upper bound for the density of odd n = p + 2^k","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"rubiks-cube-htm-distance-distribution","cat":"graphs-games-automata","t":"Rubik's Cube, half-turn metric: the exact number of positions at distance 16 (next term of OEIS A080601), or new distance-20 positions","k":"moonshot","tr":null,"cp":"needs cluster for the d\u2026","cb":"cluster"},{"id":"sage-global-sdm-test-auroc","cat":"ecology","t":"SAGE global species distribution benchmark: beat the best overall test AUROC (85.9, random forest) on sPlotOpen presence-absence plots","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"satbird-usa-encounter-rates","cat":"ecology","t":"SatBird USA-summer bird encounter rates: one model that beats every published test metric (top-10, top-30, top-k, MAE, MSE)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"scholz-brauer-unrepaired-non-hansen","cat":"number-hunts","t":"Scholz-Brauer conjecture: an addition chain for 2^n - 1 of length n - 1 + l(n) at one of the six unrepaired non-Hansen numbers (33167549, 33247629, 33573479, 33580601, 33626279, 4\u2026","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"schwartz-teq-counterexample-below-24","cat":"graphs-games-automata","t":"Schwartz's conjecture: a tournament on at most 23 alternatives with two minimal TEQ-retentive sets (the smallest known has 24)","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"saw-hypercubic-exact-enumeration","cat":"physics","t":"Self-avoiding walks: an exact count c_n beyond the published record on the 4D/5D hypercubic, bcc, fcc or simple cubic lattice","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"addition-chain-c48-d46","cat":"number-hunts","t":"Shortest addition chains: compute c(48), the smallest n with l(n) = 48, or d(46) (Clift's c(r)/d(r) tables)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"shorthand-universal-tori-permutations-n7","cat":"algorithms","t":"Shorthand universal tori for permutations of [7]: an R x C torus with 2x3 windows for some R >= 3 (only 2-row tori are known)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"nea-yarkovsky-detection-not-in-sbdb-neocc","cat":"planetary-science","t":"Significant Yarkovsky drift for a near-Earth asteroid that neither the JPL SBDB nor ESA NEOCC orbit solves for","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"single-deletion-codes-length-12","cat":"record-tables","t":"Single-deletion-correcting binary codes of length 12: is the Varshamov-Tenengolts code (316 words) optimal? (bounds 316-320)","k":"standard","tr":null,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"sintef-lilim-pdptw-bks","cat":"optimization-benchmarks","t":"SINTEF Li & Lim PDPTW benchmark: hierarchically beat a best-known solution on a 600/800/1000-task instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"sintef-vrptw-gh-hierarchical-bks","cat":"optimization-benchmarks","t":"SINTEF VRPTW (Gehring-Homberger, hierarchical objective): fewer vehicles, or equal vehicles and shorter distance, on a 200-1000 customer instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"square-site-percolation-rigorous-bounds","cat":"physics","t":"Site percolation on the square lattice Z^2: a certified lower bound on p_c above van den Berg-Ermakov's 0.556 (1996) or an upper bound below Wierman-Oberly's 0.666894 (2024)","k":"standard","tr":null,"cp":"laptop-minutes to lapto\u2026","cb":"min"},{"id":"prime-ktuple-skewes-numbers-next","cat":"number-hunts","t":"Skewes numbers for prime k-tuples: A210439(10), A332493(9), or the sexy-prime (p, p+6) Skewes number","k":"harvest","tr":null,"cp":"laptop-days for the sex\u2026","cb":"days"},{"id":"hypercube-edge-slicing-s-n","cat":"record-tables","t":"Slicing the hypercube: fewer hyperplanes than ceil(4n/5) cutting every edge of Q_n (e.g. 5 for Q_7), or new S(n,k) edge records","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"binary-sink-automata-reset-threshold-record","cat":"graphs-games-automata","t":"Slowly synchronizing binary automata with a sink: beat Ananichev-Vorel's n^2/4 + 2n - 9 reset threshold (n = 16, 28) or the best known value for another n","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"turan-3-graph-density-table-lidicky-volec","cat":"record-tables","t":"Small 3-graph Tur\u00e1n and codegree-squared densities: beat a bound in the Lidick\u00fd-Volec 2026 table (K6, K7, K5^-, K5^=, K5^ < , J4, J5, F4,2, F4^-,2)","k":"harvest","tr":null,"cp":"laptop-days for the low\u2026","cb":"days"},{"id":"small-t-designs-unknown-existence","cat":"record-tables","t":"Small simple t-designs of unknown existence: 3-(20,5,2), 3-(21,7,15), 4-(16,8,15), 4-(18,9,14), 4-(19,9,21), 5-(16,7,5), 5-(17,8,20), 2-(55,10,3) and kin","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"pg2q-smallest-complete-arcs","cat":"record-tables","t":"Smallest complete arcs in PG(2,q), q >= 37: beat a smallest known size in the Bartoli-Davydov-Faina-Kreshchuk-Marcugini-Pambianco tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"edge-ununfoldable-polyhedra-smallest-records","cat":"recreational-math","t":"Smallest edge-ununfoldable polyhedra in restricted classes: triangulated with fewer than 20 vertices, convex-faced with fewer than 13 faces, or stacked with acute triangles","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"hypohamiltonian-smallest-planar-and-girth","cat":"graphs-games-automata","t":"Smallest hypohamiltonian graphs with extra properties: a planar one below Tsai's 34 vertices, a planar one of order 35, a planar cubic one below 70, or a first one of girth 8","k":"harvest","tr":null,"cp":"laptop-days for planar\u2026","cb":"days"},{"id":"smallest-k-chromatic-girth-g-table","cat":"graphs-games-automata","t":"Smallest k-chromatic graphs of given girth: beat an upper bound in the Exoo-Goedgebeur n_g(k) table (incl. the triangle-free 6-chromatic gap 32..40)","k":"harvest","tr":null,"cp":"laptop-days for structu\u2026","cb":"days"},{"id":"mertens-smallest-counterexample-upper-bound","cat":"number-hunts","t":"Smallest Mertens counterexample: a certified bound below exp(3.485 x 10^18) (2026 claim under review), or below Kim-Nguyen's published exp(1.96 x 10^19)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"multimagic-squares-smaller-orders","cat":"recreational-math","t":"Smallest multimagic squares and cubes: a tetramagic square below order 243, a pentamagic below 729, a hexamagic below 4096, a trimagic of order 13 or 15, or a bimagic cube below o\u2026","k":"harvest","tr":null,"cp":"pure thought","cb":"thought"},{"id":"rbibd-45-5-1-smallest-open-resolvable","cat":"record-tables","t":"Smallest open resolvable Steiner 2-designs: a resolvable S(2,5,45) (also v = 345, 465, 645) or a resolvable S(2,6,66)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"strong-pseudoprime-psi14-zhang","cat":"number-hunts","t":"Smallest strong pseudoprime to the first 14 prime bases: beat Zhang's conjectured psi_14 = 6003094289670105800312596501 (OEIS A014233)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"smtlib-qf-nia-unknown-certificates","cat":"optimization-benchmarks","t":"SMT-LIB nonlinear integer arithmetic (QF_NIA): a checked answer for an unknown-status benchmark no SMT-COMP solver ever decided","k":"harvest","tr":null,"cp":"laptop-hours per benchm\u2026","cb":"hours"},{"id":"sokoban-max-moves-small-boards","cat":"graphs-games-automata","t":"Sokoban maximum moves: a board with n floor squares and k boxes whose shortest solution beats the DeStefano-qqwref archive","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"higher-dimensional-partitions-next-terms","cat":"recreational-math","t":"Solid and higher-dimensional partitions: the next term of A000293 (solid, n = 73) or A000334 (4D, n = 41), or of the 5- to 8-dimensional counts","k":"harvest","tr":null,"cp":"needs cluster for A0002\u2026","cb":"cluster"},{"id":"spherical-codes-cohn-table","cat":"packings-physics","t":"Spherical codes (Tammes problem and higher dimensions): beat an entry in Cohn's spherical-codes.org table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"sloane-cohn-spherical-coverings-s2","cat":"packings-physics","t":"Spherical coverings: N points on the sphere with a smaller covering radius than the Hardin-Sloane-Smith table (N = 4..130, kept by Henry Cohn)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"spherical-designs-s2-fewest-points","cat":"packings-physics","t":"Spherical t-designs on S^2 with fewer points: beat the smallest known N for a degree t (Hardin-Sloane, Graef-Potts and Womersley tables)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"elliptic-quadric-q7-3-spread","cat":"record-tables","t":"Spread of the elliptic quadric Q^-(7,3): 82 generator planes partitioning its 1066 points, or a rerunnable nonexistence proof","k":"moonshot","tr":null,"cp":"laptop-days to needs cl\u2026","cb":"days"},{"id":"squared-rectangle-census-next-order","cat":"recreational-math","t":"Squared-rectangle census: the next complete count of perfect squared rectangles (order 27), squared squares (order 38) or compound perfect squares (order 40)","k":"harvest","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"jarvis-ssub-experimental-formation-enthalpy-mae","cat":"chemistry-materials","t":"SSUB experimental formation enthalpies on JARVIS-Leaderboard (1,726 compounds, composition only): beat ElemNet2-TL's test MAE of 0.0924","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"steiner-tree-bcr-integrality-gap-lower-bound","cat":"algorithms","t":"Steiner tree bidirected cut relaxation: an explicit instance with integrality gap above Vicari's 6/5 (hypergraphic 8/7 and BCR+ 36/31 as partial wins)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"strongly-regular-configurations-open","cat":"record-tables","t":"Strongly regular configurations: construct a (v_k; lambda, mu) configuration marked '?' in the Abreu-Funk-Krcadinac-Labbate table (smallest (41_5; 9,10))","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"sudoku-x-11-clues","cat":"recreational-math","t":"Sudoku-X with 11 clues: beat the 12-clue minimum (known since 2007; 558,981 12-clue puzzles known, 552,952 public)","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"ccd-sutton-chen-clusters","cat":"packings-physics","t":"Sutton-Chen metal clusters (12-6, 9-6, 10-8; N <= 80): lower a putative global minimum in the Doye-Wales tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"swot-error-calibration-2022c-gulf-stream","cat":"earth-and-sky","t":"SWOT correlated-error calibration data challenge 2022c (Gulf Stream OSSE): beat the leaderboard's best on-swath RMSE","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"symmetric-hadamard-undecided-orders","cat":"record-tables","t":"Symmetric Hadamard matrices: an order 4v where none is known (smallest 428 = 4*107, then 476, 652, 668, 716)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"t2t-human-genome-compression-record","cat":"biology","t":"T2T human genome compression: beat the best bits-per-base entry in the public human-genome compression table","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"tabarena-v01-per-dataset-best-error","cat":"machine-learning","t":"TabArena-v0.1: beat the best mean test error of all 94 leaderboard entries on one of the 51 curated tabular datasets","k":"harvest","tr":null,"cp":"laptop-hours per small\u2026","cb":"hours"},{"id":"tdc-docking-drd3-oracle-budgeted-generation","cat":"drug-discovery","t":"TDC Docking Benchmark Group (DRD3, 5,000-call docking oracle): beat the Graph-GA top-100/top-10/top-1 records","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"det3-tensor-rank-17-or-18","cat":"algorithms","t":"Tensor rank of the 3x3 determinant as a 9x9x9 tensor: 17 or 18? (Shitov's Question 11.1)","k":"moonshot","tr":null,"cp":"laptop-days","cb":"days"},{"id":"fermi-gbm-offline-tgf-missed","cat":"earth-and-sky","t":"Terrestrial gamma-ray flash in public Fermi GBM TTE data, absent from the GBM TGF catalog","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"tgb-dynamic-link-mrr-leaderboards","cat":"machine-learning","t":"TGB dynamic link prediction (tgbl-wiki-v2, review-v2, coin-v2, comment, flight-v2): beat a leaderboard's top test MRR","k":"harvest","tr":null,"cp":"laptop-hours for tgbl-w\u2026","cb":"hours"},{"id":"maximal-prime-gap-86th","cat":"number-hunts","t":"The 86th maximal prime gap: the first gap above 1854 (rank 85 confirmed at 1.0141 x 10^20 in May 2026)","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"equal-circle-coverings-square-disk","cat":"packings-physics","t":"Thinnest coverings by n equal circles: cover the unit square (Nurmela-Ostergard table, n <= 30) or a disk (Tan, n = 21..25) with smaller circles","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"thomson-problem-live-tables","cat":"packings-physics","t":"Thomson problem: lower the best known Coulomb energy for some N (Deeter / Cambridge Cluster Database / Riesz s=1 tables)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"three-colour-rado-numbers-ax-by-cz","cat":"number-hunts","t":"Three-colour Rado numbers R_3(ax + by = cz): refute an Ahmed\u2013Zaman\u2013Bright conjecture or settle a cell beyond the SAT tables","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"ghz-nonlocality-robustness-below-049143","cat":"physics","t":"Three-qubit GHZ nonlocality robustness: a certified Bell violation at white-noise visibility below 0.49143 (Designolle-Vertesi-Pokutta)","k":"harvest","tr":null,"cp":"laptop-days","cb":"days"},{"id":"turan-tight-5-cycle-3-graph-density","cat":"erdos-and-proofs","t":"Tight 5-cycle C5^(3) (Mubayi-R\u00f6dl conjecture): a certified upper bound on pi(C5^(3)) below 0.46503, or a C5^(3)-free construction above 2*sqrt(3)-3","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"timpasslib-integrated-timetabling-routing","cat":"optimization-benchmarks","t":"TimPassLib: a periodic timetable with lower total passenger travel time than the best known for an open integrated timetabling-and-routing instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"toads-and-frogs-erickson-conjecture-5","cat":"graphs-games-automata","t":"Toads and Frogs: values of T^a [ ]^b F^a beyond Thanatipanonda's table, or a counterexample to Erickson's Conjecture 5","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"tptp-unknown-rating-1-problems","cat":"formal-proofs","t":"TPTP: prove (or refute) a problem with status Unknown/Open or rating 1.00, with an independently checked proof","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"plmfit-trastuzumab-cdrh3-binding-mcc","cat":"biology","t":"Trastuzumab CDR-H3 variant binding (PLMFit herH3 one-vs-rest): beat the scoreboard MCC of 0.3898","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"robinx-ttp-traveling-tournament-ub","cat":"optimization-benchmarks","t":"Traveling Tournament Problem (RobinX repository): shorter total travel for an open NL, NFL, GAL, CIRC, SUP, BRA or CON instance","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"triangular-peg-solitaire-shortest-11-12","cat":"graphs-games-automata","t":"Triangular peg solitaire: shorter single-vacancy solutions on Triangle(11) and Triangle(12) (OEIS A127500 bounds 19..28 and 21..29)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"tribone-tilings-triangle-a334875-n45","cat":"graphs-games-automata","t":"Tribone (T_2 stone) tilings of the triangle T_n (Conway-Lagarias, Propp's Problem 20): the next nonzero term A334875(45), unknown since 2020","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"tsp-art-bosch-five-instances","cat":"optimization-benchmarks","t":"TSP Art (Bosch): a shorter tour for vangogh120K, venus140K, pareja160K, courbet180K or earring200K","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"tsptw-lopez-ibanez-open-cells","cat":"optimization-benchmarks","t":"TSPTW makespan (Lopez-Ibanez collection): beat the best-known makespan 917.83 of rc_204.1, the last open makespan cell","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"turan-pure-power-sum-c42-upper-bound","cat":"erdos-and-proofs","t":"Turan's pure power-sum constant (C_42, Erdos #519): a certified upper bound below 0.6873358063 or an explicit lower bound above 1/2","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"turan-k5-3-graph-density","cat":"erdos-and-proofs","t":"Tur\u00e1n's K5^(3) conjecture: a certified upper bound on pi(K5^(3)) below 0.757017, or a K5^(3)-free construction above 3/4","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"},{"id":"hcp-fcc-ice-diamond-percolation-twins","cat":"physics","t":"Twin-lattice percolation: are the hcp and fcc bond thresholds equal (both 0.120164 within 1e-6), and how far apart are ice Ih and diamond?","k":"standard","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"univalent-bloch-constant-upper-bound","cat":"erdos-and-proofs","t":"Univalent Bloch-Landau constant B_u (C_57c): a slit domain with certified inradius/conformal-radius ratio below van Staden's 0.65628589","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"regular-graph-counts-next-order","cat":"graphs-games-automata","t":"Unlabeled regular graph counts: the next unknown term for cubic, quintic, sextic or 7-regular graphs (A002851, A006821, A006822, A014377), or quartic beyond order 50","k":"harvest","tr":null,"cp":"laptop-hours to laptop-\u2026","cb":"hours"},{"id":"heesch-polyform-hc5","cat":"graphs-games-automata","t":"Unmarked polyform with Heesch number 5 or more","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"uranus-neptune-coorbital-unrecognised","cat":"sky-archives","t":"Unrecognised Uranus or Neptune co-orbital (Trojan, horseshoe or quasi-satellite) among catalogued small bodies, shown by clone integration","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"soho-ccor-archival-sungrazer-comet","cat":"earth-and-sky","t":"Unreported sungrazing comet in archival SOHO/LASCO or GOES-19 CCOR coronagraph images, absent from Sungrazer lists","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"brouwer-binary-unrestricted-a-n-d","cat":"record-tables","t":"Unrestricted binary codes A(n,d), n <= 28: new lower bound in Brouwer's table","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"usgs-oaf-aftershock-1week-m4-brier-2024-2025","cat":"earth-and-sky","t":"USGS operational aftershock forecasts 2024-2025: lower Brier score than USGS for 'at least one M4+ aftershock within a week'","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"vertex-minor-ramsey-rvm5","cat":"graphs-games-automata","t":"Vertex-minor Ramsey numbers: a 13-vertex graph with no 5-vertex edgeless vertex-minor (R_vm(5) >= 14), or beat Bae's explicit bounds for k = 6..9","k":"standard","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"random-fibonacci-viswanath-embree-trefethen-digits","cat":"number-hunts","t":"Viswanath's random Fibonacci constant 1.1319882487943...: a rigorous enclosure to 17 or more decimals","k":"standard","tr":null,"cp":"laptop-days","cb":"days"},{"id":"volcano-thermal-unrest-not-in-gvp","cat":"earth-and-sky","t":"Volcanic thermal anomaly in open Sentinel-2 imagery at a volcano with no corresponding Smithsonian GVP eruption record","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"magic-square-water-retention-records","cat":"recreational-math","t":"Water retention of magic squares (Knecht): a normal magic square of order 10-15 retaining more water than the OEIS A201126 lower bounds, or better order 16-28, semi-magic and asso\u2026","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"integer-square-dissections-count-a045846","cat":"recreational-math","t":"Ways to cut an n x n square into integer squares: the next term a(26) of OEIS A045846, or new terms of the inequivalent count A224239","k":"standard","tr":null,"cp":"laptop-days for A224239\u2026","cb":"days"},{"id":"rectangle-dissections-square-a182275-n13","cat":"recreational-math","t":"Ways to divide an n x n square into integer-sided rectangles: the next term A182275(13) (known to n = 12 since Butler 2014)","k":"harvest","tr":null,"cp":"laptop-hours","cb":"hours"},{"id":"wheel-and-fan-ramsey-small","cat":"record-tables","t":"Wheels and fans: close a gap in DS1 Table VIII (R(W7,W8) 19-21, R(W8,W8) 22-25, R(W4,W8) 22-26, ...) or R(F4,F4) 18-24","k":"harvest","tr":null,"cp":"laptop-hours for lower\u2026","cb":"hours"},{"id":"wilf-conjecture-verification-beyond-genus-100","cat":"number-hunts","t":"Wilf's conjecture on numerical semigroups: extend the computer verification beyond genus 100, or find a counterexample","k":"standard","tr":null,"cp":"needs cluster","cb":"cluster"}],"plain":{"f":{"bigger-codes":"Error-correcting codes where every codeword has equal weight: pushing the limits on how many words fit.","biggest-graphs":"How big can a network get if every node has few links and any node is a few hops from any other?","codetables-binary-linear":"Codes that catch and fix errors in data. More space between codewords means more errors can be fixed.","codetables-qubit-upper-bounds-n101-256":"Quantum codes protect fragile qubits from errors. These results lower the ceiling on how good they can be.","eaqecc-qutrit-codetables-gaps":"Quantum codes boosted by shared entanglement, built on qutrits instead of qubits. Better codes fix more.","erdos-699-binomial-gcd":"An Erd\u0151s puzzle about Pascal's triangle: do entries in the same row always share a big enough prime?","faster-matrix-multiplication":"Recipes that multiply grids of numbers, the math inside AI and graphics, using fewer steps.","group-testing-separable-designs":"Pooled testing designs: mix samples so cleverly that you can still pinpoint which ones are positive.","hadamard-maxdet-records":"A classic puzzle: fill a square grid with plus and minus signs to make its determinant as big as possible.","lennard-jones-ccd-doye-table":"Find the lowest-energy way for atoms to clump into a cluster: a classic test of how matter takes shape.","ncbi-pathogen-ast-ecoli-genotype-phenotype-f1":"Reading a germ's genes to predict whether an antibiotic still works on it. Superbugs are a growing threat.","packomania-hyperspheres-hsp4-hsp6":"Fit equal balls inside a bigger ball in higher dimensions and make them as large as possible.","packomania-scu-spheres-in-cube":"Pack a set number of equal spheres into a cube, as big as they can be. Like stacking oranges, but hard.","qoblib-market-split-and-portfolio":"Hard money-allocation puzzles from a benchmark library built to test quantum and classical solvers.","risk-or-safety-exact-optimal-play":"Exact winning odds in a coin-tossing game where players bank points or risk them, with perfect play.","robust-forecast-aggregation-bounds":"How well can you blend forecasts from several experts without knowing how they work? Mapping the limits.","stable-marriage-max-stable-matchings":"Nobel-winning matchmaking math: how many stable ways can a group be matched so nobody wants to elope?","sunflower-free-capacity-lower-bound":"Pick as many small sets as you can without any of them forming a 'sunflower'. Tied to famous open problems.","thomson-problem-live-tables":"Arrange charged particles on a sphere so they repel each other as little as possible. Classic physics.","vnncomp-2026-unsolved-instances":"Find inputs that trick a neural network into breaking a safety rule, in cases verifier tools left open."},"c":{"algorithms":"Faster recipes for core computing tasks, like multiplying matrices in fewer steps.","ancient-texts":"Piecing together broken clay tablets and papyri, and restoring lost signs, scored against hidden answers.","biology":"Protein, DNA and evolution puzzles with public scorecards, from designing RNA to reading individual cells.","chemistry-materials":"Molecules and materials by computer: beat reference energies and structure records on fixed benchmarks.","compression-and-golf":"Squeezing files smaller than anyone has, and writing the shortest possible programs for public tables.","crypto-math":"Public challenges built to be attacked, and the maths behind the building blocks of encryption.","disease-research":"Cancer, rare diseases, superbugs and outbreaks: computer predictions on public data, never medical advice.","drug-discovery":"Predicting how molecules behave and stick to their targets, scored on public drug-discovery leaderboards.","earth-and-sky":"Missed quakes, meteors and solar flares hiding in open science archives, checked against official catalogs.","ecology":"Telling animals apart by sound and in camera-trap photos, and mapping where species live.","engineering":"Chips, wind farms and optical devices: beat the best published designs on contests with fixed scorers.","erdos-and-proofs":"Open questions from mathematician Paul Erd\u0151s: find counterexamples, settle small cases, check proofs.","formal-proofs":"Statements waiting for a computer-checked proof, where the Lean proof checker is the referee.","genomics":"Reading genomes right: call the variants and assemble the DNA, scored against known true answers.","graphs-games-automata":"Networks, puzzles, tilings and simple rule-based worlds like the Game of Life.","herculaneum-scrolls":"Scrolls burned by Vesuvius: find the ink in scans so the papyri can be read without unrolling them.","machine-learning":"Small AI leaderboards and efficiency records a laptop can top, using open models run on your own machine.","ml-robustness":"Showing AI models are easier to fool than their scores say, or that safety checkers miss cases.","neuroscience":"Finding single neurons in brain recordings and predicting brain activity, checked against ground truth.","number-hunts":"Hunting special numbers and hard limits by computer, from huge exact searches to Busy Beaver machines.","optimization-benchmarks":"Better delivery routes, schedules and plans on public benchmark sets that solvers compete on.","packings-physics":"Packing circles and spheres, and finding the lowest-energy shapes of atom clusters, against live tables.","particle-physics":"Sorting particle jets and spotting oddities in collider data, scored against released answers.","physics":"Exact counts, tight limits and precise constants in physics, from magnets and lattices to quantum info.","planetary-science":"New moons in old telescope images, spinning asteroids and alien worlds, checked against published answers.","record-tables":"Codes, designs and packings that beat the best entries in public tables kept by experts.","recreational-math":"Puzzle records: magic squares, dissections, number sequences and other curiosities with public tables.","sky-archives":"Spotting new variable stars and possible planet transits hiding in public telescope data. Candidates only.","unbroken-ciphers":"Secret messages and cipher challenges nobody has cracked yet, from wartime machines to puzzle setters.","undeciphered-scripts":"Ancient writing nobody can read, like Linear A and the Indus script. Wins are testable predictions.","wildcard":"Open problems a computer can check, from fields none of the other categories cover."}}}