Every claim on this site, with a link to check it
This page lists every result Tyler Orden claims from his research. Each one links to a place outside this site where you can check it, and shows how far it has been checked and when. Where there is no public link yet, the row says so. The full write-ups are on the main site.
43
Contributions credited in the OEIS, the online database of integer sequences
19 authored / 21 extended / 2 corrected / 1 commented or linked · as of 2026-10-22
2
Papers accepted as posters at NeurIPS 2026 workshops
8
Code and data archives with a permanent DOI
CLAIMS
AS OF 3 OCTOBER 2026
| CLAIM | CHECK IT HERE | ||
|---|---|---|---|
| In July 2026, computed the values of the unsolved take-away game 0.007 out to 2^30 heap sizes, four times further than the published tableThe table it extended had stood since 2021. It is not the current record: the table’s maintainer has since gone further himself (his page, checked 2026-09-04, lists 2^31).full write-up → | LIVE | 5/5 | OEIS A395248 |
| In July 2026, extended the published tables of eleven more unsolved take-away games two to four times further; the tables’ maintainer, Achim Flammenkamp, reviewed the code and reran parts of the work on his own machines with his own programsTwelve games in all, counting 0.007 in the row above. These are not the current records: Flammenkamp updated his tables on 2026-09-03 and has since taken every game further. His page still credits this work.full write-up → | LIVE | 5/5 | octal-games tables |
| Checked an open Erdős conjecture on every one of roughly 110 billion trees up to a new size limit, with no exceptions; Terence Tao merged an OEIS cross-reference citing the result into his Erdős problems databaseThe number of trees checked at every size matched the known count exactly, so none was skipped. A merge into the database records the link; it is not an endorsement.full write-up → | LIVE | 4/5 | erdosproblems.com/993 |
| Links from seven Erdős problems (308, 634, 939, 942, 943, 1140, 1161) to their matching OEIS sequences, merged into the Erdős problems database Terence Tao maintainsMerged on 2026-09-18. The sequences already existed; the contribution is connecting each problem to its sequence. The second such merge, after the row above. | LIVE | 4/5 | erdosproblems pull 399 |
| Five terms added to a shape-counting sequence the OEIS had marked as hard to extend | LIVE | 4/5 | OEIS A385028 |
| Counts of the possible structures of a Bayesian network when each variable may depend directly on only a limited number of others (labeled DAGs with bounded in-degree), where I found no earlier count | LIVE | 4/5 | OEIS A397711 |
| Counts of the shapes built from cells of the sphenoid honeycomb, a space-filling pattern with no earlier counts I could find; the published entry includes the argument that it is the only such honeycomb when every cell is attached by the same rule | LIVE | 4/5 | OEIS A397708 |
| Counts of the shapes built by gluing Josehedron cells (a solid that fills space) face to face, which the OEIS had none of before, in all three standard ways of counting them, published as A398957, A398958 and A398959The last of the three, A398957, was published on 2026-08-27.full write-up → | LIVE | 4/5 | OEIS A398958 |
| Found and corrected a dropped digit that had sat in a published OEIS entry for 14 years, after checking the right value with independent code | LIVE | 4/5 | OEIS A202182 |
| A paper the Journal of Integer Sequences asked to have revised (a major revision); the referee compiled and ran the codeThe revised version went back on 2026-08-25. No decision yet as of 2026-10-01; a revision is not an acceptance. | IN REVISION | 5/5 | no public link yet |
| Extended a published count of benzenoid molecules (shapes made of fused hexagonal rings) by two sizes, after reproducing the whole original count and documenting six errors in its tables; being prepared for another journalEvery new total matches the published counts in OEIS A018190. The original authors have the corrections. The data and code are archived with a DOI (see the last row). | IN PREPARATION | · | no public link yet |
| A proof that a common growth-plus-margin score for software companies cannot rank them consistently; being prepared for another journalReturned by its journal on 2026-09-17 as outside its scope, without review. Not yet published anywhere. | IN PREPARATION | · | no public link yet |
| A proposal for an article on how this program checks its own work, sent to a data-science journal on 2026-08-29A proposal, not a full article. The journal decides by about mid-October; it is not named while the decision is pending. | SENT | · | no public link yet |
| Two workshop papers accepted as posters at NeurIPS 2026 workshops"Rediscover Before You Discover" at the MATH-AI workshop, and "How Far a Wrong Claim Travels Before It Is Caught" at the AI-Native Academia workshop. Both workshops meet in December. | ACCEPTED | · | no public link yet |
| Eight results archived on Zenodo, each with a permanent DOI so it can be cited and foundEach archive holds the code or data behind one result. | LIVE | · | Zenodo records |
The dots show how far each claim has been checked, using the five steps described below. Five dots means an outside expert reproduced it. A blank means no specific check is recorded yet. Every number on this site is stored in one place, so a claim reads the same here as everywhere else on the site.
HOW CLAIMS ARE CHECKED: FIVE STEPS
AS OF 3 OCTOBER 2026
Reviews of the work behind this site have not found errors in the computed numbers. The problems they found were in the wording around the numbers: descriptions, credits, and accounts of how things were checked. For that reason every number here is stored once, with its source, and every claim goes through these steps in order.
- 1The author checks itRead it again and work it out again.Every claim above passed this step first.
- 2It agrees with itselfResults checked against each other and against facts that must hold.Related numbers are compared with each other before any one of them is used.
- 3A second program agreesA separately written program, sharing no code, gets the same numbers.A result is recorded as computed only after a second program reproduces it.
- 4An outside source agreesPublished values, standard databases, or live public data.109,972,410,221 trees verified for Erdős Problem #993, matching the published count exactly.
- 5An outside expert agreesA specialist with no stake in the result reviews and reproduces it.Achim Flammenkamp, who held the earlier record and maintains the field’s reference tables of octal games, reviewed the code, reran parts of the computation on his own machines with his own programs, and credits the work by name.
HOW STATUS WORDS ARE USED: A PAPER IS CALLED ACCEPTED OR PUBLISHED ONLY AFTER A VENUE HAS SAID SO. A LINK MERGED INTO SOMEONE ELSE’S DATABASE IS LISTED AS A LINK, NOT AS AN ENDORSEMENT.