{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:W6JSEYBNNVYH2Y6MOLI5SL3KYG","short_pith_number":"pith:W6JSEYBN","schema_version":"1.0","canonical_sha256":"b79322602d6d707d63cc72d1d92f6ac1bc49f191421aab44b2c8592bd0f1b707","source":{"kind":"arxiv","id":"2509.12025","version":3},"attestation_state":"computed","paper":{"title":"Folkman's theorem and the primes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Folkman's theorem yields two new proofs that there are infinitely many prime numbers.","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"David J. Fern\\'andez-Bret\\'on","submitted_at":"2025-09-15T15:05:56Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2509.12025","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-09-15T15:05:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7bb4eb06c85bcfa5868c663ee95162dd582aa2185b33e94d2bb20a32cbcae7b1","abstract_canon_sha256":"3eb39d2e00213c76efa3e30c40d45793575788a61f039fe5799260ef49f61f38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:33.382666Z","signature_b64":"NtK5eNH7b8rcI5Zq/pKTU7rEggwkmflUj4FBMeBRVxAnc0I0XBGxsO3id+KEgz/MGboPq9L8MKC7CB/PSWsgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b79322602d6d707d63cc72d1d92f6ac1bc49f191421aab44b2c8592bd0f1b707","last_reissued_at":"2026-05-20T00:05:33.381790Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:33.381790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Folkman's theorem and the primes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Folkman's theorem yields two new proofs that there are infinitely many prime numbers.","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"David J. Fern\\'andez-Bret\\'on","submitted_at":"2025-09-15T15:05:56Z","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."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Two new proofs of the infinitude of primes are derived from Folkman's theorem.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Folkman's theorem yields two new proofs that there are infinitely many prime numbers.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b7fccaa3723d0aede0f01a8d8801a83e9f57c2a5bfb41057d46b23cbc95a0fe4"},"source":{"id":"2509.12025","kind":"arxiv","version":3},"verdict":{"id":"03136fcf-b29e-4be7-9edb-718ffecfc36c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T16:01:22.114939Z","strongest_claim":"We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem.","one_line_summary":"Two new proofs of the infinitude of primes are derived from Folkman's theorem.","pipeline_version":"pith-pipeline@v0.9.0","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.","pith_extraction_headline":"Folkman's theorem yields two new proofs that there are infinitely many prime numbers."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.12025/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"c5d5247154d5a265401a7d5b58128a0b49da0d3e854d9bbe6aaea26a74ce5194"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.12025","created_at":"2026-05-20T00:05:33.381935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.12025v3","created_at":"2026-05-20T00:05:33.381935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.12025","created_at":"2026-05-20T00:05:33.381935+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6JSEYBNNVYH","created_at":"2026-05-20T00:05:33.381935+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6JSEYBNNVYH2Y6M","created_at":"2026-05-20T00:05:33.381935+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6JSEYBN","created_at":"2026-05-20T00:05:33.381935+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG","json":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG.json","graph_json":"https://pith.science/api/pith-number/W6JSEYBNNVYH2Y6MOLI5SL3KYG/graph.json","events_json":"https://pith.science/api/pith-number/W6JSEYBNNVYH2Y6MOLI5SL3KYG/events.json","paper":"https://pith.science/paper/W6JSEYBN"},"agent_actions":{"view_html":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG","download_json":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG.json","view_paper":"https://pith.science/paper/W6JSEYBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.12025&json=true","fetch_graph":"https://pith.science/api/pith-number/W6JSEYBNNVYH2Y6MOLI5SL3KYG/graph.json","fetch_events":"https://pith.science/api/pith-number/W6JSEYBNNVYH2Y6MOLI5SL3KYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG/action/storage_attestation","attest_author":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG/action/author_attestation","sign_citation":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG/action/citation_signature","submit_replication":"https://pith.science/pith/W6JSEYBNNVYH2Y6MOLI5SL3KYG/action/replication_record"}},"created_at":"2026-05-20T00:05:33.381935+00:00","updated_at":"2026-05-20T00:05:33.381935+00:00"}