{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BY64F6LUGMCG27ABSQRAAMEVVI","short_pith_number":"pith:BY64F6LU","schema_version":"1.0","canonical_sha256":"0e3dc2f97433046d7c019422003095aa284a8f76c1743a9c46b7dbc51263b7fb","source":{"kind":"arxiv","id":"1808.07994","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.07994","created_at":"2026-05-18T00:07:22.809368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07994v1","created_at":"2026-05-18T00:07:22.809368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07994","created_at":"2026-05-18T00:07:22.809368+00:00"},{"alias_kind":"pith_short_12","alias_value":"BY64F6LUGMCG","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BY64F6LUGMCG27AB","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BY64F6LU","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI","json":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI.json","graph_json":"https://pith.science/api/pith-number/BY64F6LUGMCG27ABSQRAAMEVVI/graph.json","events_json":"https://pith.science/api/pith-number/BY64F6LUGMCG27ABSQRAAMEVVI/events.json","paper":"https://pith.science/paper/BY64F6LU"},"agent_actions":{"view_html":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI","download_json":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI.json","view_paper":"https://pith.science/paper/BY64F6LU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07994&json=true","fetch_graph":"https://pith.science/api/pith-number/BY64F6LUGMCG27ABSQRAAMEVVI/graph.json","fetch_events":"https://pith.science/api/pith-number/BY64F6LUGMCG27ABSQRAAMEVVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/action/storage_attestation","attest_author":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/action/author_attestation","sign_citation":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/action/citation_signature","submit_replication":"https://pith.science/pith/BY64F6LUGMCG27ABSQRAAMEVVI/action/replication_record"}},"created_at":"2026-05-18T00:07:22.809368+00:00","updated_at":"2026-05-18T00:07:22.809368+00:00"}