{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ONQ7FRWL67QKYO5MC6VRZPCY5R","short_pith_number":"pith:ONQ7FRWL","canonical_record":{"source":{"id":"1002.1763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-09T03:15:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"84453e0960c15fd82303f4feaeba78331b6b09f309f5192d2d290a3dc9605f9e","abstract_canon_sha256":"36107a5edc21f23c457c830e4ff5134c8c122d9bdb767825c52a98098a992056"},"schema_version":"1.0"},"canonical_sha256":"7361f2c6cbf7e0ac3bac17ab1cbc58ec6bb70ea5230f38f4ac3e62c1d3c6a1f1","source":{"kind":"arxiv","id":"1002.1763","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1763","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1763v2","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1763","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"ONQ7FRWL67QK","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"ONQ7FRWL67QKYO5M","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"ONQ7FRWL","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ONQ7FRWL67QKYO5MC6VRZPCY5R","target":"record","payload":{"canonical_record":{"source":{"id":"1002.1763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-09T03:15:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"84453e0960c15fd82303f4feaeba78331b6b09f309f5192d2d290a3dc9605f9e","abstract_canon_sha256":"36107a5edc21f23c457c830e4ff5134c8c122d9bdb767825c52a98098a992056"},"schema_version":"1.0"},"canonical_sha256":"7361f2c6cbf7e0ac3bac17ab1cbc58ec6bb70ea5230f38f4ac3e62c1d3c6a1f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:39.029663Z","signature_b64":"7CpsaYTMVzpxl85aNZICtJLoKKuNvpuKSVDaSzQaKSLuWQy4RKq+HwslVzwYut5pBw7Fsk1TXCNPPg1dSAKWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7361f2c6cbf7e0ac3bac17ab1cbc58ec6bb70ea5230f38f4ac3e62c1d3c6a1f1","last_reissued_at":"2026-05-18T02:24:39.029094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:39.029094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.1763","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-05-18T02:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnuJbFr5K3ITuDWv/jiSCp3lROyuzlDnkeTp8b3F7qDiB1OGChjBtB8TnUi7v3HHLwH811/sfnF+BvKiw5naAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:36:42.621044Z"},"content_sha256":"ee62fa4c6a6c68d74d62a42969292bc8fc780ae6d5421a5d81063fc39751bd52","schema_version":"1.0","event_id":"sha256:ee62fa4c6a6c68d74d62a42969292bc8fc780ae6d5421a5d81063fc39751bd52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ONQ7FRWL67QKYO5MC6VRZPCY5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to lose as little as possible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Herb Wilf, Stan Wagon, Vittorio Addona","submitted_at":"2010-02-09T03:15:46Z","abstract_excerpt":"Suppose Alice has a coin with heads probability $q$ and Bob has one with heads probability $p>q$.\n  Now each of them will toss their coin $n$ times, and Alice will win iff she gets more heads than Bob does. Evidently the game favors Bob, but for the given $p,q$, what is the choice of $n$ that maximizes Alice's chances of winning? The problem of determining the optimal $N$ first appeared in \\cite{wa}. We show that there is an essentially unique value $N(q,p)$ of $n$ that maximizes the probability $f(n)$ that the weak coin will win, and it satisfies $\\frac{1}{2(p-q)}-\\frac12\\le N(q,p)\\le \\frac{\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1763","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTJyVyGZjD0xoahItQQVTdpdVwxf8Er4kGYnFizPuGW23KlcNCu5wvRLA7SM8niNjV0iRpLmoYgRN8m58BN7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:36:42.621435Z"},"content_sha256":"428ce27a512c3c4ed517266fe2aebec552de774e19b4481f4eb44309c861b829","schema_version":"1.0","event_id":"sha256:428ce27a512c3c4ed517266fe2aebec552de774e19b4481f4eb44309c861b829"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONQ7FRWL67QKYO5MC6VRZPCY5R/bundle.json","state_url":"https://pith.science/pith/ONQ7FRWL67QKYO5MC6VRZPCY5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONQ7FRWL67QKYO5MC6VRZPCY5R/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-23T21:36:42Z","links":{"resolver":"https://pith.science/pith/ONQ7FRWL67QKYO5MC6VRZPCY5R","bundle":"https://pith.science/pith/ONQ7FRWL67QKYO5MC6VRZPCY5R/bundle.json","state":"https://pith.science/pith/ONQ7FRWL67QKYO5MC6VRZPCY5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONQ7FRWL67QKYO5MC6VRZPCY5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ONQ7FRWL67QKYO5MC6VRZPCY5R","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":"36107a5edc21f23c457c830e4ff5134c8c122d9bdb767825c52a98098a992056","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-09T03:15:46Z","title_canon_sha256":"84453e0960c15fd82303f4feaeba78331b6b09f309f5192d2d290a3dc9605f9e"},"schema_version":"1.0","source":{"id":"1002.1763","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1763","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1763v2","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1763","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"ONQ7FRWL67QK","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"ONQ7FRWL67QKYO5M","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"ONQ7FRWL","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:428ce27a512c3c4ed517266fe2aebec552de774e19b4481f4eb44309c861b829","target":"graph","created_at":"2026-05-18T02:24:39Z","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"},"paper":{"abstract_excerpt":"Suppose Alice has a coin with heads probability $q$ and Bob has one with heads probability $p>q$.\n  Now each of them will toss their coin $n$ times, and Alice will win iff she gets more heads than Bob does. Evidently the game favors Bob, but for the given $p,q$, what is the choice of $n$ that maximizes Alice's chances of winning? The problem of determining the optimal $N$ first appeared in \\cite{wa}. We show that there is an essentially unique value $N(q,p)$ of $n$ that maximizes the probability $f(n)$ that the weak coin will win, and it satisfies $\\frac{1}{2(p-q)}-\\frac12\\le N(q,p)\\le \\frac{\\","authors_text":"Herb Wilf, Stan Wagon, Vittorio Addona","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-09T03:15:46Z","title":"How to lose as little as possible"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1763","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:ee62fa4c6a6c68d74d62a42969292bc8fc780ae6d5421a5d81063fc39751bd52","target":"record","created_at":"2026-05-18T02:24:39Z","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":"36107a5edc21f23c457c830e4ff5134c8c122d9bdb767825c52a98098a992056","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-09T03:15:46Z","title_canon_sha256":"84453e0960c15fd82303f4feaeba78331b6b09f309f5192d2d290a3dc9605f9e"},"schema_version":"1.0","source":{"id":"1002.1763","kind":"arxiv","version":2}},"canonical_sha256":"7361f2c6cbf7e0ac3bac17ab1cbc58ec6bb70ea5230f38f4ac3e62c1d3c6a1f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7361f2c6cbf7e0ac3bac17ab1cbc58ec6bb70ea5230f38f4ac3e62c1d3c6a1f1","first_computed_at":"2026-05-18T02:24:39.029094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:39.029094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7CpsaYTMVzpxl85aNZICtJLoKKuNvpuKSVDaSzQaKSLuWQy4RKq+HwslVzwYut5pBw7Fsk1TXCNPPg1dSAKWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:39.029663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.1763","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee62fa4c6a6c68d74d62a42969292bc8fc780ae6d5421a5d81063fc39751bd52","sha256:428ce27a512c3c4ed517266fe2aebec552de774e19b4481f4eb44309c861b829"],"state_sha256":"518f43600e3235aece8e295be4ae7ed2c7375d1b939e659ebf5779028e2a4b0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FyrlHuGi6rPwMIcDM4ptX3rZfmQTNpVKMBUrnTttqrMvq68RdE8FDVgXvO6RqNnn0pl98FYQnLPUyusLhJODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:36:42.623385Z","bundle_sha256":"41fe7b1e9b7489f17565cba59da0fe529ce9823be66f2b27feefb21b6d8b6692"}}