Source authenticated

Probabilistic Automatic Complexity Is At Most Three

Registry resolution: resolved. 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-co-developed. 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: Probabilistic Automatic Complexity Is At Most Three · Prob. automatic complexity

Confidence: Not scored

Registry verification: unreviewed · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Bjørn Kjos-Hanssen
human · human collaborator

Claude Fable 5
model · ai model contributor · Anthropic

Lineage and corrections

Corrects Probabilistic Automatic Complexity Is At Most Three →

Supersedes Probabilistic Automatic Complexity Is At Most Three →

This event attributed to Bjørn Kjos-Hanssen

Probabilistic Automatic Complexity Is At Most Three parent of this event

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

Probabilistic Automatic Complexity Is At Most Three evidence for this event

VibeMathed record: Probabilistic Automatic Complexity Is At Most Three evidence for this event

This event attributed to Claude Fable 5

Act on this frontier

Verify, challenge, or extend the result.

Probabilistic Automatic Complexity Is At Most Three — Mathematical Frontier Network