{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:W6JSEYBNNVYH2Y6MOLI5SL3KYG","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":"3eb39d2e00213c76efa3e30c40d45793575788a61f039fe5799260ef49f61f38","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-09-15T15:05:56Z","title_canon_sha256":"7bb4eb06c85bcfa5868c663ee95162dd582aa2185b33e94d2bb20a32cbcae7b1"},"schema_version":"1.0","source":{"id":"2509.12025","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.12025","created_at":"2026-05-20T00:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"2509.12025v3","created_at":"2026-05-20T00:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.12025","created_at":"2026-05-20T00:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"W6JSEYBNNVYH","created_at":"2026-05-20T00:05:33Z"},{"alias_kind":"pith_short_16","alias_value":"W6JSEYBNNVYH2Y6M","created_at":"2026-05-20T00:05:33Z"},{"alias_kind":"pith_short_8","alias_value":"W6JSEYBN","created_at":"2026-05-20T00:05:33Z"}],"graph_snapshots":[{"event_id":"sha256:ed93c5bf2515c43466dbaa01c7a6712a895fc0ffbfdfa0d8b2f40466d5b28c8a","target":"graph","created_at":"2026-05-20T00:05:33Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Folkman's theorem (or Hindman's theorem) can be applied to suitably chosen colorings or subsets of the natural numbers in a way that directly forces the set of primes to be infinite."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Two new proofs of the infinitude of primes are derived from Folkman's theorem."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Folkman's theorem yields two new proofs that there are infinitely many prime numbers."}],"snapshot_sha256":"b7fccaa3723d0aede0f01a8d8801a83e9f57c2a5bfb41057d46b23cbc95a0fe4"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"c5d5247154d5a265401a7d5b58128a0b49da0d3e854d9bbe6aaea26a74ce5194"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.12025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem (alternatively, one can think of these proofs as using Hindman's theorem). This adds to the existing literature deriving the infinitude of primes from Ramsey-type theorems.","authors_text":"David J. Fern\\'andez-Bret\\'on","cross_cats":["math.CO"],"headline":"Folkman's theorem yields two new proofs that there are infinitely many prime numbers.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-09-15T15:05:56Z","title":"Folkman's theorem and the primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.12025","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-18T16:01:22.114939Z","id":"03136fcf-b29e-4be7-9edb-718ffecfc36c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Two new proofs of the infinitude of primes are derived from Folkman's theorem.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Folkman's theorem yields two new proofs that there are infinitely many prime numbers.","strongest_claim":"We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem.","weakest_assumption":"Folkman's theorem (or Hindman's theorem) can be applied to suitably chosen colorings or subsets of the natural numbers in a way that directly forces the set of primes to be infinite."}},"verdict_id":"03136fcf-b29e-4be7-9edb-718ffecfc36c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4f35865d4258d18e1ea2ba086c6fdb5f283f0920231fae956189ef51ebe33e08","target":"record","created_at":"2026-05-20T00:05:33Z","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":"3eb39d2e00213c76efa3e30c40d45793575788a61f039fe5799260ef49f61f38","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-09-15T15:05:56Z","title_canon_sha256":"7bb4eb06c85bcfa5868c663ee95162dd582aa2185b33e94d2bb20a32cbcae7b1"},"schema_version":"1.0","source":{"id":"2509.12025","kind":"arxiv","version":3}},"canonical_sha256":"b79322602d6d707d63cc72d1d92f6ac1bc49f191421aab44b2c8592bd0f1b707","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b79322602d6d707d63cc72d1d92f6ac1bc49f191421aab44b2c8592bd0f1b707","first_computed_at":"2026-05-20T00:05:33.381790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:33.381790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NtK5eNH7b8rcI5Zq/pKTU7rEggwkmflUj4FBMeBRVxAnc0I0XBGxsO3id+KEgz/MGboPq9L8MKC7CB/PSWsgDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:33.382666Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.12025","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f35865d4258d18e1ea2ba086c6fdb5f283f0920231fae956189ef51ebe33e08","sha256:ed93c5bf2515c43466dbaa01c7a6712a895fc0ffbfdfa0d8b2f40466d5b28c8a"],"state_sha256":"1901f7c2a92d7b42a476661a22e7be90018974c3319226aad34df818e922b78b"}