{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UMSTXWBP6CRZ42646LC62BDPOU","short_pith_number":"pith:UMSTXWBP","schema_version":"1.0","canonical_sha256":"a3253bd82ff0a39e6bdcf2c5ed046f7528771d36eeb9374f2785df08deb1736e","source":{"kind":"arxiv","id":"2405.16660","version":1},"attestation_state":"computed","paper":{"title":"A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Simon Segert","submitted_at":"2024-05-26T18:49:40Z","abstract_excerpt":"Consider the following probability puzzle: A fair coin is flipped n times. For each HT in the resulting sequence, Bob gets a point, and for each HH Alice gets a point. Who is more likely to win? We provide a proof that Bob wins more often for every n>=3. As a byproduct, we derive the asymptotic form of the difference in win probabilities, and obtain an efficient algorithms for their calculation."},"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":false},"canonical_record":{"source":{"id":"2405.16660","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-26T18:49:40Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0dea7382f915b7292f42b8e9f22847d55278763254e664e2bf0ed81b097dac03","abstract_canon_sha256":"9f4b6eade80e9e43c7d2f6608e33df50fe42b66349f2b514fee41038c2742a79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:33.675600Z","signature_b64":"fZgv5hlJXQmttrGqValInHSlOAJKpCDEzeIF/t5KgxqT8pEnBwGesL/KGh9pZZt/BMfZ+CcLH3TPrhpQ+WmnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3253bd82ff0a39e6bdcf2c5ed046f7528771d36eeb9374f2785df08deb1736e","last_reissued_at":"2026-07-05T08:23:33.675107Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:33.675107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Simon Segert","submitted_at":"2024-05-26T18:49:40Z","abstract_excerpt":"Consider the following probability puzzle: A fair coin is flipped n times. For each HT in the resulting sequence, Bob gets a point, and for each HH Alice gets a point. Who is more likely to win? We provide a proof that Bob wins more often for every n>=3. As a byproduct, we derive the asymptotic form of the difference in win probabilities, and obtain an efficient algorithms for their calculation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16660","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.16660/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":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2405.16660","created_at":"2026-07-05T08:23:33.675165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16660v1","created_at":"2026-07-05T08:23:33.675165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16660","created_at":"2026-07-05T08:23:33.675165+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMSTXWBP6CRZ","created_at":"2026-07-05T08:23:33.675165+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMSTXWBP6CRZ4264","created_at":"2026-07-05T08:23:33.675165+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMSTXWBP","created_at":"2026-07-05T08:23:33.675165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07837","citing_title":"On Two Combinatorial Inequalities That Explain the Blimpy Shape of Heady-s and Taily-s Bit Strings","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19904","citing_title":"Moments for generalizations of a coin flip game","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU","json":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU.json","graph_json":"https://pith.science/api/pith-number/UMSTXWBP6CRZ42646LC62BDPOU/graph.json","events_json":"https://pith.science/api/pith-number/UMSTXWBP6CRZ42646LC62BDPOU/events.json","paper":"https://pith.science/paper/UMSTXWBP"},"agent_actions":{"view_html":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU","download_json":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU.json","view_paper":"https://pith.science/paper/UMSTXWBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16660&json=true","fetch_graph":"https://pith.science/api/pith-number/UMSTXWBP6CRZ42646LC62BDPOU/graph.json","fetch_events":"https://pith.science/api/pith-number/UMSTXWBP6CRZ42646LC62BDPOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU/action/storage_attestation","attest_author":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU/action/author_attestation","sign_citation":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU/action/citation_signature","submit_replication":"https://pith.science/pith/UMSTXWBP6CRZ42646LC62BDPOU/action/replication_record"}},"created_at":"2026-07-05T08:23:33.675165+00:00","updated_at":"2026-07-05T08:23:33.675165+00:00"}