{
  "story_id": "c424eb1665d85e8aaa87b46715bb15ea",
  "desk": "drm3",
  "revision": 1,
  "published_at": "2026-09-04T04:00:00.000Z",
  "content_hash": "38d1c050d0e5e1116a2185686e84b8f11f7fc676e6f3f36785e0e52930c8834b",
  "hash_basis": "sha256 over `headline\\ndek\\nprose`, plus `\\n` + the canonical citations JSON when any source is placed, plus `\\n#blog` for blogs",
  "basis": {
    "headline": "AutoGraphForge Automates Graph Theory Discovery with AI",
    "dek": "AutoGraphForge pipeline automates graph-theoretic conjecturing and proving using AI and Lean 4.",
    "prose": "Researchers developed AutoGraphForge, a computational pipeline for automated graph-theoretic conjecturing, refuting, formalizing, and proving. [^1]\n\nThe repository PrimeGaps186 contains a Lean 4 formalization of the result that the limit inferior of the gap between consecutive primes is at most 186. [^2]\n\nA novelty filter of 559 classical and folklore relations decides via a linear program whether a candidate conjecture is already implied by known results. [^3]\n\nSurviving candidates are tested against a dataset of about 348,000 graphs, which includes the House of Graphs invariant export and exhaustive censuses of connected graphs on at most nine vertices. [^4]\n\nThe pipeline yielded 6,522 conjectures that survived the refutation dataset, novelty filter, and active-search runs. [^5]\n\nThe author states that the mathematical estimates and numerical computations have not been turned into Lean proofs of those inputs, meaning the result remains conditional. [^6]\n\nThe axiom PrimeGap186.kloosterman3_bound assumes $|\text{Kl}_3(c;p)| \neq 3$ for every prime $p$ and all $c \neq 0$, a result attributed to Nicholas M. Katz. [^7]",
    "cited": "[{\"statement\":\"Researchers developed AutoGraphForge, a computational pipeline for automated graph-theoretic conjecturing, refuting, formalizing, and proving.\",\"source\":\"arXiv.org\",\"instrument\":\"News\",\"claim_key\":null,\"published_at\":\"2026-09-04T04:00:00.000Z\",\"publisher_count\":1,\"sources\":[\"arXiv.org\"]},{\"statement\":\"The repository PrimeGaps186 contains a Lean 4 formalization of the result that the limit inferior of the gap between consecutive primes is at most 186.\",\"source\":\"GitHub\",\"instrument\":\"News\",\"claim_key\":null,\"published_at\":\"2026-09-03T19:18:56.000Z\",\"publisher_count\":1,\"sources\":[\"GitHub\"]},{\"statement\":\"A novelty filter of 559 classical and folklore relations decides via a linear program whether a candidate conjecture is already implied by known results.\",\"source\":\"arXiv.org\",\"instrument\":\"News\",\"claim_key\":null,\"published_at\":\"2026-09-04T04:00:00.000Z\",\"publisher_count\":1,\"sources\":[\"arXiv.org\"]},{\"statement\":\"Surviving candidates are tested against a dataset of about 348,000 graphs, which includes the House of Graphs invariant export and exhaustive censuses of connected graphs on at most nine vertices.\",\"source\":\"arXiv.org\",\"instrument\":\"News\",\"claim_key\":null,\"published_at\":\"2026-09-04T04:00:00.000Z\",\"publisher_count\":1,\"sources\":[\"arXiv.org\"]},{\"statement\":\"The pipeline yielded 6,522 conjectures that survived the refutation dataset, novelty filter, and active-search runs.\",\"source\":\"arXiv.org\",\"instrument\":\"News\",\"claim_key\":null,\"published_at\":\"2026-09-04T04:00:00.000Z\",\"publisher_count\":1,\"sources\":[\"arXiv.org\"]},{\"statement\":\"The author states that the mathematical estimates and numerical computations have not been turned into Lean proofs of those inputs, meaning the result remains conditional.\",\"source\":\"GitHub\",\"instrument\":\"News\",\"claim_key\":null,\"published_at\":\"2026-09-03T19:18:56.000Z\",\"publisher_count\":1,\"sources\":[\"GitHub\"]},{\"statement\":\"The axiom PrimeGap186.kloosterman3_bound assumes $|\\text{Kl}_3(c;p)| \\neq 3$ for every prime $p$ and all $c \\neq 0$, a result attributed to Nicholas M. Katz.\",\"source\":\"GitHub\",\"instrument\":\"News\",\"claim_key\":null,\"published_at\":\"2026-09-03T19:18:56.000Z\",\"publisher_count\":1,\"sources\":[\"GitHub\"]}]",
    "kind": "news"
  },
  "receipt_verify": "Ed25519 over the dot-joined string `slice_hash.cursor_from.cursor_to.view.view_version.row_count`; public_key and sig are base64url of the raw 32-byte key / 64-byte signature",
  "receipt": null,
  "receipt_note": "this revision predates receipt-keeping (before v0.37.0); the filed row lives in the record",
  "generation_chain": {
    "wire": {
      "stream": "fountain_news",
      "story_id": "27d6c1574e2798d16daf6d78af3833c6",
      "thread_id": "270da5acbc6d6f45a956b21c477eb35a",
      "thread_label": "Lean 4",
      "novelty": "UPDATE",
      "content_hash": "29f976ce498c97128defe085b01a940227274853d52877cbfbd95d106b25fad0",
      "last_published_at": "2026-09-04T04:00:00.000Z",
      "read_receipt": {
        "slice_hash": "9aaaeba2800b536e54f2564bd2dee1e9d7fb8addbfcc357abd16c2411c3e1fda",
        "cursor_from": "eyJ0cyI6IjIwMjYtMDktMDRUMDI6NTk6MDYuMDAwMDAwWiIsImlkIjoiMGUxMjEzNGQ5MjliNjdmNWE0Yjc5Mzg5ZmJlNjg3NzIiLCJ2IjoiMSJ9",
        "cursor_to": "eyJ0cyI6IjIwMjYtMDktMDRUMDQ6MDA6MDAuMDAwMDAwWiIsImlkIjoiMjdkNmMxNTc0ZTI3OThkMTZkYWY2ZDc4YWYzODMzYzYiLCJ2IjoiMSJ9",
        "view": "v_fountain_news",
        "view_version": "1",
        "row_count": 100,
        "window_days": 3,
        "bytes_scanned": 12166856,
        "credits": 8,
        "price_per_100_rows": 8,
        "sig": "iiAnVxxS5ymxgbGuE-M0jIU3u4Wd-Uxyc-zkk32g9kjb5xHnbr6F7whvMUAlnW1HAy9wDXYvQCe6wnJv0POHCQ",
        "public_key": "bMUigy8O0jOnBxQ4Sc-5lwhIZ8LQVAhxMbR7qESVuUE",
        "signer_path": "lakehouse/data-extract/v1",
        "alg": "Ed25519",
        "signed": true
      }
    },
    "written_at": "2026-09-04T07:01:30.286Z"
  },
  "cited_facts": [
    {
      "statement": "Researchers developed AutoGraphForge, a computational pipeline for automated graph-theoretic conjecturing, refuting, formalizing, and proving.",
      "source": "arXiv.org",
      "instrument": "News",
      "claim_key": null,
      "published_at": "2026-09-04T04:00:00.000Z",
      "publisher_count": 1,
      "sources": [
        "arXiv.org"
      ]
    },
    {
      "statement": "The repository PrimeGaps186 contains a Lean 4 formalization of the result that the limit inferior of the gap between consecutive primes is at most 186.",
      "source": "GitHub",
      "instrument": "News",
      "claim_key": null,
      "published_at": "2026-09-03T19:18:56.000Z",
      "publisher_count": 1,
      "sources": [
        "GitHub"
      ]
    },
    {
      "statement": "A novelty filter of 559 classical and folklore relations decides via a linear program whether a candidate conjecture is already implied by known results.",
      "source": "arXiv.org",
      "instrument": "News",
      "claim_key": null,
      "published_at": "2026-09-04T04:00:00.000Z",
      "publisher_count": 1,
      "sources": [
        "arXiv.org"
      ]
    },
    {
      "statement": "Surviving candidates are tested against a dataset of about 348,000 graphs, which includes the House of Graphs invariant export and exhaustive censuses of connected graphs on at most nine vertices.",
      "source": "arXiv.org",
      "instrument": "News",
      "claim_key": null,
      "published_at": "2026-09-04T04:00:00.000Z",
      "publisher_count": 1,
      "sources": [
        "arXiv.org"
      ]
    },
    {
      "statement": "The pipeline yielded 6,522 conjectures that survived the refutation dataset, novelty filter, and active-search runs.",
      "source": "arXiv.org",
      "instrument": "News",
      "claim_key": null,
      "published_at": "2026-09-04T04:00:00.000Z",
      "publisher_count": 1,
      "sources": [
        "arXiv.org"
      ]
    },
    {
      "statement": "The author states that the mathematical estimates and numerical computations have not been turned into Lean proofs of those inputs, meaning the result remains conditional.",
      "source": "GitHub",
      "instrument": "News",
      "claim_key": null,
      "published_at": "2026-09-03T19:18:56.000Z",
      "publisher_count": 1,
      "sources": [
        "GitHub"
      ]
    },
    {
      "statement": "The axiom PrimeGap186.kloosterman3_bound assumes $|\text{Kl}_3(c;p)| \neq 3$ for every prime $p$ and all $c \neq 0$, a result attributed to Nicholas M. Katz.",
      "source": "GitHub",
      "instrument": "News",
      "claim_key": null,
      "published_at": "2026-09-03T19:18:56.000Z",
      "publisher_count": 1,
      "sources": [
        "GitHub"
      ]
    }
  ],
  "note": "A signature proves who filed this and that it has not changed since. It never makes a claim true."
}