{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CSIMSWCIBES3XCVOFF733M2X6B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f1abe38766102e1a8bb00fcccfe5fad108c142edc7a5c50bbd1d27934454afd1","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-01T23:29:20Z","title_canon_sha256":"653558586dcadebb55793273f5ff318825ea9d2cede9f9bd3092118d291fe572"},"schema_version":"1.0","source":{"id":"2205.00580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00580","created_at":"2026-07-05T09:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00580v2","created_at":"2026-07-05T09:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00580","created_at":"2026-07-05T09:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"CSIMSWCIBES3","created_at":"2026-07-05T09:35:45Z"},{"alias_kind":"pith_short_16","alias_value":"CSIMSWCIBES3XCVO","created_at":"2026-07-05T09:35:45Z"},{"alias_kind":"pith_short_8","alias_value":"CSIMSWCI","created_at":"2026-07-05T09:35:45Z"}],"graph_snapshots":[{"event_id":"sha256:164cc60cc4727311f0729a712850ba1f8d2a753084590c109aee29550a511a53","target":"graph","created_at":"2026-07-05T09:35:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.00580/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let us call a simple graph on $n\\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\\geq 2$ if we assume the Riemann hypothesis. Moreover, an infinite sequence of prime gap graphs can be generated by the so-called degree preserving growth process. This is the first time a naturally occurring infinite sequence of positive integers is identified as graphic. That is, we show the existence of an interesting, and so far unique, infinite combinatorial object.","authors_text":"Gergely Harcos, P\\'eter L. Erd\\H{o}s, P\\'eter Maga, Shubha R. Kharel, Tam\\'as R. Mezei, Zolt\\'an Toroczkai","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-01T23:29:20Z","title":"The sequence of prime gaps is graphic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00580","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2b246c53fdc6f7166c7eaa6c79fa1bf7179c7e21710c738c6bc7fca069983d3c","target":"record","created_at":"2026-07-05T09:35:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f1abe38766102e1a8bb00fcccfe5fad108c142edc7a5c50bbd1d27934454afd1","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-01T23:29:20Z","title_canon_sha256":"653558586dcadebb55793273f5ff318825ea9d2cede9f9bd3092118d291fe572"},"schema_version":"1.0","source":{"id":"2205.00580","kind":"arxiv","version":2}},"canonical_sha256":"1490c958480925bb8aae297fbdb357f051c65dd4756bfcfe896fb55d33d65219","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1490c958480925bb8aae297fbdb357f051c65dd4756bfcfe896fb55d33d65219","first_computed_at":"2026-07-05T09:35:45.136522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:35:45.136522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oaJ1I8+hcjVEou6BRP8Ju4Aqjb3mTCPE52OujbBbxjSRLP8cE7E3ghj8i8qEXZUt/UyGj8ppmemLxrQiVIVmAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:35:45.136957Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.00580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b246c53fdc6f7166c7eaa6c79fa1bf7179c7e21710c738c6bc7fca069983d3c","sha256:164cc60cc4727311f0729a712850ba1f8d2a753084590c109aee29550a511a53"],"state_sha256":"38d78b13b741faa9537eebeb047add368f37392e3e203dd64a8884a4b18777c0"}