Counting Linear Extensions Below the $2^n$ Barrier

Registry resolution: candidate. Reported result type: proved. The registry record and named primary source provide the statement and scope.

Exact FrontierDelta

proved→proved

Scope and record

Occurred: Oct 29, 2026

Delta type: REGISTRY REVISION

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Counting Linear Extensions Below the $2^n$ Barrier · Linear extensions, $2^n$ barrier

Confidence: Not scored

Registry verification: unreviewed · preprint · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Keigo Oka
human · human collaborator

Claude Opus 5
model · ai model contributor · Anthropic

ChatGPT 5.6 Sol
model · ai model contributor · OpenAI

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record: Counting Linear Extensions Below the $2^n$ Barrier

specialist registry · passed

Checked by this site on 21 August 2026 against the paper (arXiv:2608.19505v1): the disclosure is verbatim as quoted and Koivisto's Dagstuhl 2013 question is cited in the abstract. This is an exact deterministic algorithm with a proved worst-case bound, not a heuristic, so it clears the methodology's exclusion. The ancillary Python script cross-checks correctness against brute force on small posets and does not certify the running time; it was not re-run here. Days-old preprint, no independent review.

Source ↗

Counting Linear Extensions Below the $2^n$ Barrier

preprint · pending

Primary source named by the VibeMathed record. Presence in this import is not an independent mathematical verification.

Source ↗

Lineage and corrections

Corrects Counting Linear Extensions Below the $2^n$ Barrier →

Supersedes Counting Linear Extensions Below the $2^n$ Barrier →

This event attributed to Claude Opus 5

Counting Linear Extensions Below the $2^n$ Barrier parent of this event

This event attributed to ChatGPT 5.6 Sol

Registry resolution: candidate. Reported result type: proved. The registry record and named primary source provide the statement and scope. parent of this event

This event attributed to Keigo Oka

VibeMathed record: Counting Linear Extensions Below the $2^n$ Barrier evidence for this event

Counting Linear Extensions Below the $2^n$ Barrier evidence for this event

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem Explore evidence graph