{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U6JXXOJDY3NFKVTJIBXF7NURGQ","short_pith_number":"pith:U6JXXOJD","canonical_record":{"source":{"id":"2604.22991","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-04-24T20:16:05Z","cross_cats_sorted":[],"title_canon_sha256":"45c75a61893447e9c4b4c7b8fe3ec08111161cf3bf2d84ad067fc997facba86b","abstract_canon_sha256":"85a59425a28e2c60ff815606b9b957a3547a54b2be113893cd49a1f977ef53a6"},"schema_version":"1.0"},"canonical_sha256":"a7937bb923c6da555669406e5fb691340237f22d0f148ac26c466f02a68fc558","source":{"kind":"arxiv","id":"2604.22991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22991","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22991v2","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22991","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"U6JXXOJDY3NF","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"U6JXXOJDY3NFKVTJ","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"U6JXXOJD","created_at":"2026-06-02T03:04:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U6JXXOJDY3NFKVTJIBXF7NURGQ","target":"record","payload":{"canonical_record":{"source":{"id":"2604.22991","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-04-24T20:16:05Z","cross_cats_sorted":[],"title_canon_sha256":"45c75a61893447e9c4b4c7b8fe3ec08111161cf3bf2d84ad067fc997facba86b","abstract_canon_sha256":"85a59425a28e2c60ff815606b9b957a3547a54b2be113893cd49a1f977ef53a6"},"schema_version":"1.0"},"canonical_sha256":"a7937bb923c6da555669406e5fb691340237f22d0f148ac26c466f02a68fc558","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:41.481819Z","signature_b64":"KGULdB+GXfasyKMzCJkECN9Qqc6mR0om7H00d3d+p8k1vuuwojyR2AdLahta9s0V1WfKSyhS/PGlzRxPcRZRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7937bb923c6da555669406e5fb691340237f22d0f148ac26c466f02a68fc558","last_reissued_at":"2026-06-02T03:04:41.481417Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:41.481417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.22991","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T03:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCv5PX/G9c5WO+ZKOuxadHnHflobcMpuC2+3b+lwbOE0C8aTu819mdIf2z02svsVbklaN+atlP9I/mKqZLskAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:15:48.528898Z"},"content_sha256":"e3d433c96fda8c32be5be0be79cfc93cd9caf4895fd2ce78dcfde62714381176","schema_version":"1.0","event_id":"sha256:e3d433c96fda8c32be5be0be79cfc93cd9caf4895fd2ce78dcfde62714381176"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U6JXXOJDY3NFKVTJIBXF7NURGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal strategies in the all-heads coin game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"When the coin is biased toward heads, always setting aside exactly one head is optimal and the winning probability increases with the number of coins.","cross_cats":[],"primary_cat":"math.PR","authors_text":"Peter Pfaffelhuber","submitted_at":"2026-04-24T20:16:05Z","abstract_excerpt":"We study a sequential coin-flipping game: a player starts with $n$~coins, each heads with probability~$p$, and in each round flips all remaining coins and must set aside at least one head, losing if none shows. The player wins once all coins have been set aside. The optimal winning probability~$w_{n,p}$ obeys a Bellman equation with a nonlinear suffix-maximum operator. For $p=\\tfrac12$ every strategy achieves $w_{n,1/2}=\\tfrac12$. For $p>\\tfrac12$ the strategy~\\One{} (set aside a single head) is optimal, $n\\mapsto w_{n,p}$ is strictly increasing, and the limit $W(p):=\\lim_n w_{n,p}$ has an exp"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For p > 1/2 the strategy One is optimal and n ↦ w_{n,p} is strictly increasing; the limit W(p) admits an explicit series representation and satisfies p ≤ W(p) < 1. For p < 1/2 near 1/2 the deficit 1/2 - w_{n,1/2-δ} ≈ δ c_n to first order, where c_n satisfies a linear recursion for n ≥ 7 with limit L ≈ 1.7035; consequently the optimal value sequence has a strict local minimum at n=5 and no local maximum.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the nonlinear suffix-maximum Bellman operator for this MDP admits an optimal policy that is one of the two natural strategies (One or All) for all n and p, allowing the value function to be obtained by direct comparison rather than full policy iteration.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"In the all-heads coin game the optimal winning probability equals 1/2 for any strategy when p=1/2, is strictly increasing in n for p>1/2 with explicit limit series W(p) satisfying p ≤ W(p) < 1, and to first order in bias δ=1/2-p exhibits a strict local minimum at n=5 with coefficient limit ≈1.7035.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"When the coin is biased toward heads, always setting aside exactly one head is optimal and the winning probability increases with the number of coins.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3ee8b6da4abf53106927b631617e31e33a8ea824a6dd7b34ff6a989e8596e1f5"},"source":{"id":"2604.22991","kind":"arxiv","version":2},"verdict":{"id":"14222348-6134-43bd-bddf-ebbe44e00852","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T09:58:53.911475Z","strongest_claim":"For p > 1/2 the strategy One is optimal and n ↦ w_{n,p} is strictly increasing; the limit W(p) admits an explicit series representation and satisfies p ≤ W(p) < 1. For p < 1/2 near 1/2 the deficit 1/2 - w_{n,1/2-δ} ≈ δ c_n to first order, where c_n satisfies a linear recursion for n ≥ 7 with limit L ≈ 1.7035; consequently the optimal value sequence has a strict local minimum at n=5 and no local maximum.","one_line_summary":"In the all-heads coin game the optimal winning probability equals 1/2 for any strategy when p=1/2, is strictly increasing in n for p>1/2 with explicit limit series W(p) satisfying p ≤ W(p) < 1, and to first order in bias δ=1/2-p exhibits a strict local minimum at n=5 with coefficient limit ≈1.7035.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the nonlinear suffix-maximum Bellman operator for this MDP admits an optimal policy that is one of the two natural strategies (One or All) for all n and p, allowing the value function to be obtained by direct comparison rather than full policy iteration.","pith_extraction_headline":"When the coin is biased toward heads, always setting aside exactly one head is optimal and the winning probability increases with the number of coins."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.22991/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T09:42:10.483730Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:34:25.223362Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0f7280e4423a7f2a6866c92c7b035f55b5fa1c8539d2cdd6d9c46db255e2388e"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"14222348-6134-43bd-bddf-ebbe44e00852"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T03:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TLj84Kht7p7kAGI7vxh9bEt95buVGBMsRL99Emyn4IA59Bo34FPl4JGq1MtecC/2+lVckHZ8yW9EIO3ITncBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:15:48.529587Z"},"content_sha256":"93d018656c92dff50afee21f1e7470f1b935d64fefc5df19d5496eeb0cae0c0a","schema_version":"1.0","event_id":"sha256:93d018656c92dff50afee21f1e7470f1b935d64fefc5df19d5496eeb0cae0c0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6JXXOJDY3NFKVTJIBXF7NURGQ/bundle.json","state_url":"https://pith.science/pith/U6JXXOJDY3NFKVTJIBXF7NURGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6JXXOJDY3NFKVTJIBXF7NURGQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T18:15:48Z","links":{"resolver":"https://pith.science/pith/U6JXXOJDY3NFKVTJIBXF7NURGQ","bundle":"https://pith.science/pith/U6JXXOJDY3NFKVTJIBXF7NURGQ/bundle.json","state":"https://pith.science/pith/U6JXXOJDY3NFKVTJIBXF7NURGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6JXXOJDY3NFKVTJIBXF7NURGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U6JXXOJDY3NFKVTJIBXF7NURGQ","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":"85a59425a28e2c60ff815606b9b957a3547a54b2be113893cd49a1f977ef53a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-04-24T20:16:05Z","title_canon_sha256":"45c75a61893447e9c4b4c7b8fe3ec08111161cf3bf2d84ad067fc997facba86b"},"schema_version":"1.0","source":{"id":"2604.22991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22991","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22991v2","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22991","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"U6JXXOJDY3NF","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"U6JXXOJDY3NFKVTJ","created_at":"2026-06-02T03:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"U6JXXOJD","created_at":"2026-06-02T03:04:41Z"}],"graph_snapshots":[{"event_id":"sha256:93d018656c92dff50afee21f1e7470f1b935d64fefc5df19d5496eeb0cae0c0a","target":"graph","created_at":"2026-06-02T03:04:41Z","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":"For p > 1/2 the strategy One is optimal and n ↦ w_{n,p} is strictly increasing; the limit W(p) admits an explicit series representation and satisfies p ≤ W(p) < 1. For p < 1/2 near 1/2 the deficit 1/2 - w_{n,1/2-δ} ≈ δ c_n to first order, where c_n satisfies a linear recursion for n ≥ 7 with limit L ≈ 1.7035; consequently the optimal value sequence has a strict local minimum at n=5 and no local maximum."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the nonlinear suffix-maximum Bellman operator for this MDP admits an optimal policy that is one of the two natural strategies (One or All) for all n and p, allowing the value function to be obtained by direct comparison rather than full policy iteration."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In the all-heads coin game the optimal winning probability equals 1/2 for any strategy when p=1/2, is strictly increasing in n for p>1/2 with explicit limit series W(p) satisfying p ≤ W(p) < 1, and to first order in bias δ=1/2-p exhibits a strict local minimum at n=5 with coefficient limit ≈1.7035."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"When the coin is biased toward heads, always setting aside exactly one head is optimal and the winning probability increases with the number of coins."}],"snapshot_sha256":"3ee8b6da4abf53106927b631617e31e33a8ea824a6dd7b34ff6a989e8596e1f5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T09:42:10.483730Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:34:25.223362Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.22991/integrity.json","findings":[],"snapshot_sha256":"0f7280e4423a7f2a6866c92c7b035f55b5fa1c8539d2cdd6d9c46db255e2388e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a sequential coin-flipping game: a player starts with $n$~coins, each heads with probability~$p$, and in each round flips all remaining coins and must set aside at least one head, losing if none shows. The player wins once all coins have been set aside. The optimal winning probability~$w_{n,p}$ obeys a Bellman equation with a nonlinear suffix-maximum operator. For $p=\\tfrac12$ every strategy achieves $w_{n,1/2}=\\tfrac12$. For $p>\\tfrac12$ the strategy~\\One{} (set aside a single head) is optimal, $n\\mapsto w_{n,p}$ is strictly increasing, and the limit $W(p):=\\lim_n w_{n,p}$ has an exp","authors_text":"Peter Pfaffelhuber","cross_cats":[],"headline":"When the coin is biased toward heads, always setting aside exactly one head is optimal and the winning probability increases with the number of coins.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-04-24T20:16:05Z","title":"Optimal strategies in the all-heads coin game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.22991","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T09:58:53.911475Z","id":"14222348-6134-43bd-bddf-ebbe44e00852","model_set":{"reader":"grok-4.3"},"one_line_summary":"In the all-heads coin game the optimal winning probability equals 1/2 for any strategy when p=1/2, is strictly increasing in n for p>1/2 with explicit limit series W(p) satisfying p ≤ W(p) < 1, and to first order in bias δ=1/2-p exhibits a strict local minimum at n=5 with coefficient limit ≈1.7035.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"When the coin is biased toward heads, always setting aside exactly one head is optimal and the winning probability increases with the number of coins.","strongest_claim":"For p > 1/2 the strategy One is optimal and n ↦ w_{n,p} is strictly increasing; the limit W(p) admits an explicit series representation and satisfies p ≤ W(p) < 1. For p < 1/2 near 1/2 the deficit 1/2 - w_{n,1/2-δ} ≈ δ c_n to first order, where c_n satisfies a linear recursion for n ≥ 7 with limit L ≈ 1.7035; consequently the optimal value sequence has a strict local minimum at n=5 and no local maximum.","weakest_assumption":"That the nonlinear suffix-maximum Bellman operator for this MDP admits an optimal policy that is one of the two natural strategies (One or All) for all n and p, allowing the value function to be obtained by direct comparison rather than full policy iteration."}},"verdict_id":"14222348-6134-43bd-bddf-ebbe44e00852"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e3d433c96fda8c32be5be0be79cfc93cd9caf4895fd2ce78dcfde62714381176","target":"record","created_at":"2026-06-02T03:04:41Z","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":"85a59425a28e2c60ff815606b9b957a3547a54b2be113893cd49a1f977ef53a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-04-24T20:16:05Z","title_canon_sha256":"45c75a61893447e9c4b4c7b8fe3ec08111161cf3bf2d84ad067fc997facba86b"},"schema_version":"1.0","source":{"id":"2604.22991","kind":"arxiv","version":2}},"canonical_sha256":"a7937bb923c6da555669406e5fb691340237f22d0f148ac26c466f02a68fc558","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7937bb923c6da555669406e5fb691340237f22d0f148ac26c466f02a68fc558","first_computed_at":"2026-06-02T03:04:41.481417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:04:41.481417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KGULdB+GXfasyKMzCJkECN9Qqc6mR0om7H00d3d+p8k1vuuwojyR2AdLahta9s0V1WfKSyhS/PGlzRxPcRZRDA==","signature_status":"signed_v1","signed_at":"2026-06-02T03:04:41.481819Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.22991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3d433c96fda8c32be5be0be79cfc93cd9caf4895fd2ce78dcfde62714381176","sha256:93d018656c92dff50afee21f1e7470f1b935d64fefc5df19d5496eeb0cae0c0a"],"state_sha256":"52d536e7c8a1389afe721fa8c2284da3a536c26007c6ec4f9616d88d3b6d1eb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfWvur90yZxLvOjTZG0ahXKXI0JxVcyCgxuQwGDXbc0/2110LlRxGcm1UmjP5ODPv/h/X6coleYpnWXxyA+JDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:15:48.532191Z","bundle_sha256":"62d702e0cd8521cb3cd224c4a7f57443ac31fa12ece42c1eddbc7150ad8d44d0"}}