{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BY64F6LUGMCG27ABSQRAAMEVVI","short_pith_number":"pith:BY64F6LU","canonical_record":{"source":{"id":"1808.07994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-24T03:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"242c649ed1f76064ae5a1108d787bd7ac1652f2016f84e00a843531cb861ec46","abstract_canon_sha256":"c92344101dbfc830eada9ae9c617b3ef61664c293467f36c660931de89c98dd0"},"schema_version":"1.0"},"canonical_sha256":"0e3dc2f97433046d7c019422003095aa284a8f76c1743a9c46b7dbc51263b7fb","source":{"kind":"arxiv","id":"1808.07994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07994","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07994v1","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07994","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"pith_short_12","alias_value":"BY64F6LUGMCG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BY64F6LUGMCG27AB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BY64F6LU","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BY64F6LUGMCG27ABSQRAAMEVVI","target":"record","payload":{"canonical_record":{"source":{"id":"1808.07994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-24T03:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"242c649ed1f76064ae5a1108d787bd7ac1652f2016f84e00a843531cb861ec46","abstract_canon_sha256":"c92344101dbfc830eada9ae9c617b3ef61664c293467f36c660931de89c98dd0"},"schema_version":"1.0"},"canonical_sha256":"0e3dc2f97433046d7c019422003095aa284a8f76c1743a9c46b7dbc51263b7fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:22.809937Z","signature_b64":"sfSh11h0g/fc+2h0UdhyvLPyiHmaNhsjoY+14mECcwsHrTlR5rbfFwBvuZtwOdzIzPpvl5nXT2yqinERW4mIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e3dc2f97433046d7c019422003095aa284a8f76c1743a9c46b7dbc51263b7fb","last_reissued_at":"2026-05-18T00:07:22.809256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:22.809256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.07994","source_version":1,"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-18T00:07:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0Z5iFrTb82im0wNySJUyopJ0VoitadxOWYEhqrvkE1vNAZFzrNF4D/jmdHG+qmXLy+7LImsQEMenXC+eZ0bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:19:40.242531Z"},"content_sha256":"2776ce770b622857b0105b303fcdbf33f1d5e254d5af5ffc3174e178ad9ee761","schema_version":"1.0","event_id":"sha256:2776ce770b622857b0105b303fcdbf33f1d5e254d5af5ffc3174e178ad9ee761"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BY64F6LUGMCG27ABSQRAAMEVVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Choosing 1 of N with and without lucky numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Matthew Brand","submitted_at":"2018-08-24T03:24:27Z","abstract_excerpt":"How many fair coin tosses to choose 1 of $n$ options with uniform probability? Although a probability problem, the solution is essentially number-theoretic, with special roles for Mersenne numbers, Fermat numbers, and the haupt exponent. We propose a bit-efficient scheme, prove optimality, derive the expected number of coin tosses $e[n]$, characterize its fractal structure, and develop sharp upper and lower bounds, both discrete and continuous. A minor but noteworthy corollary, with real-world examples, is that any lottery or simulation with finite budget of random bits will have a predictable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07994","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":""},"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-18T00:07:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwPwlVA02JPtfSA5jNdFHsjbuy5y324UFu7SrTgCGuYu+1u+YmryURWFGF4JW6yq8qENEwn4S0fmbu9twGsXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:19:40.242876Z"},"content_sha256":"39ebad91b4da5fc2e53ee9a50a3e70fd385c1eca816f6cab67b6330fee6bb0c8","schema_version":"1.0","event_id":"sha256:39ebad91b4da5fc2e53ee9a50a3e70fd385c1eca816f6cab67b6330fee6bb0c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/bundle.json","state_url":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BY64F6LUGMCG27ABSQRAAMEVVI/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-29T06:19:40Z","links":{"resolver":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI","bundle":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/bundle.json","state":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BY64F6LUGMCG27ABSQRAAMEVVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BY64F6LUGMCG27ABSQRAAMEVVI","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":"c92344101dbfc830eada9ae9c617b3ef61664c293467f36c660931de89c98dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-24T03:24:27Z","title_canon_sha256":"242c649ed1f76064ae5a1108d787bd7ac1652f2016f84e00a843531cb861ec46"},"schema_version":"1.0","source":{"id":"1808.07994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07994","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07994v1","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07994","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"pith_short_12","alias_value":"BY64F6LUGMCG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BY64F6LUGMCG27AB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BY64F6LU","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:39ebad91b4da5fc2e53ee9a50a3e70fd385c1eca816f6cab67b6330fee6bb0c8","target":"graph","created_at":"2026-05-18T00:07:22Z","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":"How many fair coin tosses to choose 1 of $n$ options with uniform probability? Although a probability problem, the solution is essentially number-theoretic, with special roles for Mersenne numbers, Fermat numbers, and the haupt exponent. We propose a bit-efficient scheme, prove optimality, derive the expected number of coin tosses $e[n]$, characterize its fractal structure, and develop sharp upper and lower bounds, both discrete and continuous. A minor but noteworthy corollary, with real-world examples, is that any lottery or simulation with finite budget of random bits will have a predictable","authors_text":"Matthew Brand","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-24T03:24:27Z","title":"Choosing 1 of N with and without lucky numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07994","kind":"arxiv","version":1},"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:2776ce770b622857b0105b303fcdbf33f1d5e254d5af5ffc3174e178ad9ee761","target":"record","created_at":"2026-05-18T00:07:22Z","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":"c92344101dbfc830eada9ae9c617b3ef61664c293467f36c660931de89c98dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-24T03:24:27Z","title_canon_sha256":"242c649ed1f76064ae5a1108d787bd7ac1652f2016f84e00a843531cb861ec46"},"schema_version":"1.0","source":{"id":"1808.07994","kind":"arxiv","version":1}},"canonical_sha256":"0e3dc2f97433046d7c019422003095aa284a8f76c1743a9c46b7dbc51263b7fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e3dc2f97433046d7c019422003095aa284a8f76c1743a9c46b7dbc51263b7fb","first_computed_at":"2026-05-18T00:07:22.809256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:22.809256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sfSh11h0g/fc+2h0UdhyvLPyiHmaNhsjoY+14mECcwsHrTlR5rbfFwBvuZtwOdzIzPpvl5nXT2yqinERW4mIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:22.809937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2776ce770b622857b0105b303fcdbf33f1d5e254d5af5ffc3174e178ad9ee761","sha256:39ebad91b4da5fc2e53ee9a50a3e70fd385c1eca816f6cab67b6330fee6bb0c8"],"state_sha256":"31facc04fd552c2a22590571be3bd31582c4acb15a420dc99e509b5f6d9619b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKPopMDSSAczFESZJjiP+Gqz5SIq7f9RZLbzmgJVSe2QnK9hqKSKvJ/mxYqN/VwJhht2PY+64LcwE/U0IMHsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T06:19:40.244723Z","bundle_sha256":"1097eae45fb84d65971ed5fe49830fd9980be05a81a51cedd8cfc68ef653b192"}}