{ "schema": "stegverse.site.tidc.pilot_events.v0.1", "generated": "2026-07-25", "public_posture": "RESEARCH_NOTE", "research_state": "PILOT_NOT_CONFIRMATORY", "authority_boundary": "Site publication is a public research mirror and does not establish the hypothesis as proof.", "coding_rules": { "dependency_classes": ["Necessary", "Material", "Supportive", "Incidental", "Unresolved"], "orientations": ["Self-capability", "External", "Mixed"], "confidence": ["High", "Medium", "Low"], "missing_dates": "null values are retained; dates are not inferred without evidence" }, "summary": { "event_count": 10, "source_count": 10, "high_confidence": 7, "medium_confidence": 3, "self_capability": 2, "external": 8 }, "events": [ { "event_id": "COMP-001", "event_name": "Four-Color Theorem computer-assisted proof", "technology_wave": "Classical computer", "mechanism": "Computer-assisted proof / finite case checking", "field": "Graph theory", "advance_type": "Complete proof", "candidate_generation_date": "1976", "candidate_date_precision": "year", "verification_date": null, "publication_date": "1977", "acceptance_date": null, "recognition_date": null, "dependency_class": "Necessary", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Computer checking of reducible configurations plus human proof components", "coding_confidence": "Medium", "source_id": "SRC-001", "open_questions": ["Locate original 1977 papers and archival computation records", "Separate proof completion, publication, acceptance, and later formal verification"] }, { "event_id": "COMP-002", "event_name": "Nonexistence of a finite projective plane of order 10", "technology_wave": "Classical computer", "mechanism": "Exhaustive computational search", "field": "Combinatorics / finite geometry", "advance_type": "Nonexistence result", "candidate_generation_date": "1988", "candidate_date_precision": "approximate year", "verification_date": null, "publication_date": "1991-04", "acceptance_date": null, "recognition_date": null, "dependency_class": "Necessary", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Large exhaustive search with case reduction", "coding_confidence": "Medium", "source_id": "SRC-002", "open_questions": ["Retrieve original computational reports", "Code later certificate verification as a separate event"] }, { "event_id": "COMP-003", "event_name": "Solution of the Robbins problem by EQP", "technology_wave": "Classical computer", "mechanism": "Automated theorem proving", "field": "Universal algebra / logic", "advance_type": "Complete proof", "candidate_generation_date": "1996-10", "candidate_date_precision": "month", "verification_date": null, "publication_date": "1997", "acceptance_date": null, "recognition_date": null, "dependency_class": "Necessary", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Automated theorem prover generated a proof; simplified proofs followed", "coding_confidence": "High", "source_id": "SRC-003", "open_questions": ["Retrieve exact journal publication date", "Separate machine proof from later human-readable simplifications"] }, { "event_id": "NET-001", "event_name": "Density Hales-Jewett Polymath proof", "technology_wave": "Internet collaboration", "mechanism": "Open online collective proof", "field": "Ramsey theory / combinatorics", "advance_type": "New proof and quantitative bound", "candidate_generation_date": "2010-02-18", "candidate_date_precision": "submission date proxy", "verification_date": "2011-07-02", "publication_date": "2012-05-01", "acceptance_date": null, "recognition_date": null, "dependency_class": "Material", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Open blog/wiki collaboration followed by conventional peer review", "coding_confidence": "High", "source_id": "SRC-004", "open_questions": ["Reconstruct public collaboration start date", "Record participant and contribution trace"] }, { "event_id": "NET-002", "event_name": "Polymath8 bounded-gaps improvements", "technology_wave": "Internet collaboration", "mechanism": "Open online optimization and synthesis", "field": "Number theory", "advance_type": "Improved bounds and collective results", "candidate_generation_date": "2013-06", "candidate_date_precision": "approximate month", "verification_date": null, "publication_date": "2014-10-17", "acceptance_date": null, "recognition_date": null, "dependency_class": "Material", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Online collaborative derivation, public computation, and conventional publication", "coding_confidence": "Medium", "source_id": "SRC-005", "open_questions": ["Split Polymath8a bound reductions, Maynard-Tao integration, and final published results into distinct events"] }, { "event_id": "AI-001", "event_name": "AlphaTensor matrix-multiplication algorithms", "technology_wave": "AI capability", "mechanism": "Reinforcement-learning search plus exact verification", "field": "Applied mathematics / algorithms", "advance_type": "New algorithms and improved bounds", "candidate_generation_date": "2021-10-02", "candidate_date_precision": "paper received proxy", "verification_date": "2022-08-02", "publication_date": "2022-10-05", "acceptance_date": null, "recognition_date": null, "dependency_class": "Necessary", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Exact tensor-decomposition verification and runtime benchmarking", "coding_confidence": "High", "source_id": "SRC-006", "open_questions": ["Decide whether each improved tensor size is a separate subevent", "Record independent reproductions and superseded bounds"] }, { "event_id": "AI-002", "event_name": "AlphaDev faster sorting algorithms", "technology_wave": "AI capability", "mechanism": "Reinforcement-learning program search", "field": "Computer science / algorithms", "advance_type": "New algorithms with production adoption", "candidate_generation_date": "2022-07-25", "candidate_date_precision": "paper received proxy", "verification_date": "2023-03-23", "publication_date": "2023-06-07", "acceptance_date": null, "recognition_date": null, "dependency_class": "Necessary", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Correctness tests, hardware benchmarks, and LLVM review", "coding_confidence": "High", "source_id": "SRC-007", "open_questions": ["Retrieve LLVM merge dates", "Separate algorithm discovery from library integration"] }, { "event_id": "AI-003", "event_name": "FunSearch cap-set and bin-packing results", "technology_wave": "AI capability", "mechanism": "LLM-guided evolutionary program search", "field": "Combinatorics / optimization", "advance_type": "Improved constructions and heuristics", "candidate_generation_date": "2023", "candidate_date_precision": "year proxy", "verification_date": null, "publication_date": "2023-12-14", "acceptance_date": null, "recognition_date": null, "dependency_class": "Necessary", "orientation": "External", "problem_origin_type": "Inherited problem", "verification_method": "Systematic evaluator verified generated programs and measured results", "coding_confidence": "High", "source_id": "SRC-008", "open_questions": ["Establish exact candidate-generation dates", "Split cap-set and bin-packing into separate events"] }, { "event_id": "QNT-001", "event_name": "Application-motivated full-stack quantum benchmarking", "technology_wave": "Quantum computing", "mechanism": "Self-capability benchmarking", "field": "Quantum computing", "advance_type": "Benchmark framework and empirical characterization", "candidate_generation_date": "2020-06", "candidate_date_precision": "preprint month proxy", "verification_date": null, "publication_date": "2021-03-22", "acceptance_date": null, "recognition_date": null, "dependency_class": "Material", "orientation": "Self-capability", "problem_origin_type": "Newly formulated by technology", "verification_method": "Application-motivated circuits, classical sampling, compiler and device comparison", "coding_confidence": "High", "source_id": "SRC-009", "open_questions": ["Code benchmark adoption, replications, and downstream use as separate events"] }, { "event_id": "QNT-002", "event_name": "Learning logical Pauli noise in quantum error correction", "technology_wave": "Quantum computing", "mechanism": "Self-capability characterization / error correction", "field": "Quantum information", "advance_type": "Method and theorem for logical-noise estimation", "candidate_generation_date": "2022-10-21", "candidate_date_precision": "received date", "verification_date": "2023-04-10", "publication_date": "2023-05-15", "acceptance_date": null, "recognition_date": null, "dependency_class": "Material", "orientation": "Self-capability", "problem_origin_type": "Newly formulated by technology", "verification_method": "Theoretical proof that logical error channels can be estimated from syndrome data", "coding_confidence": "High", "source_id": "SRC-010", "open_questions": ["Assess theoretical infrastructure versus empirical capability status", "Identify subsequent experimental use"] } ], "sources": [ {"source_id":"SRC-001","event_id":"COMP-001","citation":"Appel and Haken, Every Planar Map is Four Colorable","publisher":"American Mathematical Society","source_type":"authoritative primary exposition","url":"https://bookstore.ams.org/conm-98/","limitations":"Retrospective book; original 1976–77 papers still required"}, {"source_id":"SRC-002","event_id":"COMP-002","citation":"C. W. H. Lam, The Search for a Finite Projective Plane of Order 10","publisher":"American Mathematical Monthly / CECM archive","source_type":"primary author account","url":"https://www.cecm.sfu.ca/organics/papers/lam/index.html","limitations":"Exact run dates and independent verification require archival work"}, {"source_id":"SRC-003","event_id":"COMP-003","citation":"William McCune, Robbins Algebras Are Boolean / Solution of the Robbins Problem","publisher":"University of New Mexico author archive / Journal of Automated Reasoning","source_type":"primary author archive","url":"https://www.cs.unm.edu/~mccune/papers/robbins/","limitations":"Exact journal issue date remains to be recorded"}, {"source_id":"SRC-004","event_id":"NET-001","citation":"D. H. J. Polymath, A new proof of the density Hales-Jewett theorem","publisher":"Annals of Mathematics","source_type":"primary published paper","url":"https://annals.math.princeton.edu/2012/175-3/p06","limitations":"Public collaboration start and participant trace require blog archives"}, {"source_id":"SRC-005","event_id":"NET-002","citation":"D. H. J. Polymath, Variants of the Selberg sieve, and bounded intervals containing many primes","publisher":"Research in the Mathematical Sciences","source_type":"primary published paper","url":"https://doi.org/10.1186/s40687-014-0012-7","limitations":"Project phases and exact bound changes must be separated"}, {"source_id":"SRC-006","event_id":"AI-001","citation":"Fawzi et al., Discovering faster matrix multiplication algorithms with reinforcement learning","publisher":"Nature","source_type":"primary published paper","url":"https://www.nature.com/articles/s41586-022-05172-4","limitations":"Independent reproductions and superseded results pending"}, {"source_id":"SRC-007","event_id":"AI-002","citation":"Mankowitz et al., Faster sorting algorithms discovered using deep reinforcement learning","publisher":"Nature","source_type":"primary published paper","url":"https://www.nature.com/articles/s41586-023-06004-9","limitations":"LLVM merge timeline should be added"}, {"source_id":"SRC-008","event_id":"AI-003","citation":"Romera-Paredes et al., Mathematical discoveries from program search with large language models","publisher":"Nature","source_type":"primary published paper","url":"https://www.nature.com/articles/s41586-023-06924-6","limitations":"Exact generation and independent verification dates pending"}, {"source_id":"SRC-009","event_id":"QNT-001","citation":"Mills et al., Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack","publisher":"Quantum","source_type":"primary published paper","url":"https://quantum-journal.org/papers/q-2021-03-22-415/","limitations":"Adoption impact requires downstream use study"}, {"source_id":"SRC-010","event_id":"QNT-002","citation":"Wagner et al., Learning Logical Pauli Noise in Quantum Error Correction","publisher":"Physical Review Letters","source_type":"primary published paper","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.130.200601","limitations":"Subsequent experimental uptake pending"} ], "next_release_gate": "Independent second coding pass and agreement report" }