{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JNKPIIPAEI6QCDGYOUKH7II23B","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":"cdbe7cba193d24f1236e8c1d2dea033351e2003a2de02a4e78cd173a59fc32a1","cross_cats_sorted":["math.CO","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T15:24:36Z","title_canon_sha256":"87e2d8d0c443ad07010a1071b346d338b9cd03772d30af2e394580d73c2477a1"},"schema_version":"1.0","source":{"id":"2605.13666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13666","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13666v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13666","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"JNKPIIPAEI6Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JNKPIIPAEI6QCDGY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JNKPIIPA","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:17f0571f055a4d29b32a5d60bbba2bd63e84d6d507e2ff1110bfe50c6f0ef4ac","target":"graph","created_at":"2026-05-18T02:44:17Z","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":"our calculations yield significantly sharper estimates for this expectation and its higher moments than the original results of Conroy, Alon, and Malinovsky. In particular, we determine the expectation to more than 1000 decimal places."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"the density of primes implies that the associated survival probability decays exponentially fast, which enables highly accurate truncation estimates."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The expected number of die rolls until the sum is prime is computed to more than 1000 decimal places via DP truncation with exponential-decay error bounds."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Dynamic programming computes the expected number of die rolls until the sum is prime to more than 1000 decimal places."}],"snapshot_sha256":"4302c4c2d8d00c062ebecdd71ef7206276691c859279bee222a2a268f15acb08"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"48a8df9d05cc5e7d4e665cda6b29377aac717896840aa2218878e43467a71602"},"paper":{"abstract_excerpt":"Given a (possibly infinite) subset $A$ of the natural numbers, we ask how many times a fair six-sided die must be rolled until the rolled numbers add up to an element of $A$. Using a one-dimensional dynamic programming recursion together with truncation and rigorous error bounds, we compute the expected number of rolls efficiently and with very high accuracy. When $A$ is the set of prime numbers, the irregular distribution of primes makes it difficult to obtain explicit error estimates. Nevertheless, the density of primes implies that the associated survival probability decays exponentially fa","authors_text":"Christoph Koutschan, Thotsaporn Aek Thanatipanonda, Tipaluck Krityakierne","cross_cats":["math.CO","math.NT"],"headline":"Dynamic programming computes the expected number of die rolls until the sum is prime to more than 1000 decimal places.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T15:24:36Z","title":"When Does the Dice Sum Become Prime?"},"references":{"count":9,"internal_anchors":1,"resolved_work":9,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Noga Alon and Yaakov Malinovsky,Hitting a prime in 2.43 dice rolls (on average), The American Statistician77(3), 301–303, 2023","work_id":"355a420d-37f3-4f91-af1f-22262be22e03","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Noga Alon, Yaakov Malinovsky, Lucy Martinez, and Doron Zeilberger,Hitting k primes by dice rolls, Electronic Journal of Combinatorics32(4), 4.16, 2025","work_id":"fd088070-6e00-42a3-8273-990887f708fe","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A more recent version (2026) is available athttps://www.madandmoonly.com/ doctormatt/mathematics/dice1.pdf","work_id":"5de51dfb-66fd-467b-abbd-9a989f6d0d0a","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Lucy Martinez and Doron Zeilberger,How many Dice Rolls Would It Take to Reach Your Favorite Kind of Number?, Maple Transactions3(3), Autumn 2023","work_id":"141f1391-2fd3-4698-943a-73e1cd81f984","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Barkley Rosser and Lowell Schoenfeld,Approximate Formulas for some Functions of Prime Numbers, Illinois Journal of Mathematics6(1), 64–94, March 1962","work_id":"8197342b-1a72-4c6a-a7d8-247cc9da06ec","year":1962}],"snapshot_sha256":"ef453e8f8dffed76b00dc468c75de7ab93c78ca0310e94d95ff9a75cd6049f15"},"source":{"id":"2605.13666","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:56:00.589891Z","id":"390498a9-1203-4e28-a1f0-fe917aac9508","model_set":{"reader":"grok-4.3"},"one_line_summary":"The expected number of die rolls until the sum is prime is computed to more than 1000 decimal places via DP truncation with exponential-decay error bounds.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Dynamic programming computes the expected number of die rolls until the sum is prime to more than 1000 decimal places.","strongest_claim":"our calculations yield significantly sharper estimates for this expectation and its higher moments than the original results of Conroy, Alon, and Malinovsky. In particular, we determine the expectation to more than 1000 decimal places.","weakest_assumption":"the density of primes implies that the associated survival probability decays exponentially fast, which enables highly accurate truncation estimates."}},"verdict_id":"390498a9-1203-4e28-a1f0-fe917aac9508"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d672e3bf6f9c340cf0452a7e15bd1237988d75ec04195fd0ac2561d5e9c700b5","target":"record","created_at":"2026-05-18T02:44:17Z","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":"cdbe7cba193d24f1236e8c1d2dea033351e2003a2de02a4e78cd173a59fc32a1","cross_cats_sorted":["math.CO","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T15:24:36Z","title_canon_sha256":"87e2d8d0c443ad07010a1071b346d338b9cd03772d30af2e394580d73c2477a1"},"schema_version":"1.0","source":{"id":"2605.13666","kind":"arxiv","version":1}},"canonical_sha256":"4b54f421e0223d010cd875147fa11ad840c2157528815ca074f1317d9f0288bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b54f421e0223d010cd875147fa11ad840c2157528815ca074f1317d9f0288bf","first_computed_at":"2026-05-18T02:44:17.246519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:17.246519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8tA5er+bKuYKMjp6Dw00fb+aSbOSOdIOM1j9MxGrx0eBvdrdqBZvwiGxeYZnChS+brPe2YzeQczTajk++74sAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:17.246998Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d672e3bf6f9c340cf0452a7e15bd1237988d75ec04195fd0ac2561d5e9c700b5","sha256:17f0571f055a4d29b32a5d60bbba2bd63e84d6d507e2ff1110bfe50c6f0ef4ac"],"state_sha256":"69f99e90a80ebce149ba86a25b26894f7d6d5ae5e4988c06cafc679a767ae405"}