{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5PQITPAZTYVGIX5NYRETXEY2CK","short_pith_number":"pith:5PQITPAZ","schema_version":"1.0","canonical_sha256":"ebe089bc199e2a645fadc4493b931a12b44ad99461e39281a1d9afa13e897ed7","source":{"kind":"arxiv","id":"1507.00843","version":2},"attestation_state":"computed","paper":{"title":"Optimal linear Bernoulli factories for small mean problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.CO"],"primary_cat":"math.PR","authors_text":"Mark Huber","submitted_at":"2015-07-03T07:56:55Z","abstract_excerpt":"Suppose a coin with unknown probability $p$ of heads can be flipped as often as desired. A Bernoulli factory for a function $f$ is an algorithm that uses flips of the coin together with auxiliary randomness to flip a single coin with probability $f(p)$ of heads. Applications include near perfect sampling from the stationary distribution of regenerative processes. When $f$ is analytic, the problem can be reduced to a Bernoulli factory of the form $f(p) = Cp$ for constant $C$. Presented here is a new algorithm where for small values of $Cp$, requires roughly only $C$ coin flips to generate a $Cp"},"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":"1507.00843","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-03T07:56:55Z","cross_cats_sorted":["cs.CC","cs.DS","stat.CO"],"title_canon_sha256":"383d02bf5d0cc5b306949df15c4f2e6905f000f892b1c952ed1bf6a7e8caed90","abstract_canon_sha256":"4ef578ecfc8b969c91a765c8a1747082f2eb52a27f91de22d5de8920a1d89d56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:44.433544Z","signature_b64":"8l/6as4okTdsDEX1C0EGD9KlBh9LBK0ZAOlMYtVS70lisrW1N4bu5/ALG+MjnPDHteNjl0BLeqtNbkHtYVVAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebe089bc199e2a645fadc4493b931a12b44ad99461e39281a1d9afa13e897ed7","last_reissued_at":"2026-05-18T01:03:44.433147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:44.433147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal linear Bernoulli factories for small mean problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.CO"],"primary_cat":"math.PR","authors_text":"Mark Huber","submitted_at":"2015-07-03T07:56:55Z","abstract_excerpt":"Suppose a coin with unknown probability $p$ of heads can be flipped as often as desired. A Bernoulli factory for a function $f$ is an algorithm that uses flips of the coin together with auxiliary randomness to flip a single coin with probability $f(p)$ of heads. Applications include near perfect sampling from the stationary distribution of regenerative processes. When $f$ is analytic, the problem can be reduced to a Bernoulli factory of the form $f(p) = Cp$ for constant $C$. Presented here is a new algorithm where for small values of $Cp$, requires roughly only $C$ coin flips to generate a $Cp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00843","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.00843","created_at":"2026-05-18T01:03:44.433210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00843v2","created_at":"2026-05-18T01:03:44.433210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00843","created_at":"2026-05-18T01:03:44.433210+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PQITPAZTYVG","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PQITPAZTYVGIX5N","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PQITPAZ","created_at":"2026-05-18T12:29:05.191682+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/5PQITPAZTYVGIX5NYRETXEY2CK","json":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK.json","graph_json":"https://pith.science/api/pith-number/5PQITPAZTYVGIX5NYRETXEY2CK/graph.json","events_json":"https://pith.science/api/pith-number/5PQITPAZTYVGIX5NYRETXEY2CK/events.json","paper":"https://pith.science/paper/5PQITPAZ"},"agent_actions":{"view_html":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK","download_json":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK.json","view_paper":"https://pith.science/paper/5PQITPAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00843&json=true","fetch_graph":"https://pith.science/api/pith-number/5PQITPAZTYVGIX5NYRETXEY2CK/graph.json","fetch_events":"https://pith.science/api/pith-number/5PQITPAZTYVGIX5NYRETXEY2CK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK/action/storage_attestation","attest_author":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK/action/author_attestation","sign_citation":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK/action/citation_signature","submit_replication":"https://pith.science/pith/5PQITPAZTYVGIX5NYRETXEY2CK/action/replication_record"}},"created_at":"2026-05-18T01:03:44.433210+00:00","updated_at":"2026-05-18T01:03:44.433210+00:00"}