{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JO257MRLBYNWHHN7FSCE5ZXSZO","short_pith_number":"pith:JO257MRL","schema_version":"1.0","canonical_sha256":"4bb5dfb22b0e1b639dbf2c844ee6f2cbb6fa6d91e2a08aae040b996b39e1d7a4","source":{"kind":"arxiv","id":"1308.1562","version":2},"attestation_state":"computed","paper":{"title":"Nearly optimal Bernoulli factories for linear functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mark Huber","submitted_at":"2013-08-07T13:16:33Z","abstract_excerpt":"Suppose that $X_1,X_2,\\ldots$ are independent identically distributed Bernoulli random variables with mean $p$. A Bernoulli factory for a function $f$ takes as input $X_1,X_2,\\ldots$ and outputs a random variable that is Bernoulli with mean $f(p).$ A fast algorithm is a function that only depends on the values of $X_1,\\ldots,X_T$, where $T$ is a stopping time with small mean. When $f(p)$ is a real analytic function the problem reduces to being able to draw from linear functions $Cp$ for a constant $C > 1$. Also it is necessary that $Cp \\leq 1 - \\epsilon$ for known $\\epsilon > 0$. Previous meth"},"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":"1308.1562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-07T13:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"b8ff6d70408ad00e24987671bdb0bc46b3746c3be25d2c09ba1d40b3f98a6a26","abstract_canon_sha256":"8aa2038e34132ef6795651659fbcb88cdf388402d23cd9f1f0515e29bef729a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:50.238526Z","signature_b64":"S9BP5o/PYjK4qTzVv+wZG2QV5PVXnLmaanFqopHgLF2Kv3uLyaiQcj9Bqkysx2x6bTW/juKE7/lR6tAQZzT0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bb5dfb22b0e1b639dbf2c844ee6f2cbb6fa6d91e2a08aae040b996b39e1d7a4","last_reissued_at":"2026-05-18T01:12:50.238181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:50.238181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly optimal Bernoulli factories for linear functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mark Huber","submitted_at":"2013-08-07T13:16:33Z","abstract_excerpt":"Suppose that $X_1,X_2,\\ldots$ are independent identically distributed Bernoulli random variables with mean $p$. A Bernoulli factory for a function $f$ takes as input $X_1,X_2,\\ldots$ and outputs a random variable that is Bernoulli with mean $f(p).$ A fast algorithm is a function that only depends on the values of $X_1,\\ldots,X_T$, where $T$ is a stopping time with small mean. When $f(p)$ is a real analytic function the problem reduces to being able to draw from linear functions $Cp$ for a constant $C > 1$. Also it is necessary that $Cp \\leq 1 - \\epsilon$ for known $\\epsilon > 0$. Previous meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1562","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":"1308.1562","created_at":"2026-05-18T01:12:50.238236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1562v2","created_at":"2026-05-18T01:12:50.238236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1562","created_at":"2026-05-18T01:12:50.238236+00:00"},{"alias_kind":"pith_short_12","alias_value":"JO257MRLBYNW","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JO257MRLBYNWHHN7","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JO257MRL","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.06748","citing_title":"Designing Perfect Simulation Algorithms using Local Correctness","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO","json":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO.json","graph_json":"https://pith.science/api/pith-number/JO257MRLBYNWHHN7FSCE5ZXSZO/graph.json","events_json":"https://pith.science/api/pith-number/JO257MRLBYNWHHN7FSCE5ZXSZO/events.json","paper":"https://pith.science/paper/JO257MRL"},"agent_actions":{"view_html":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO","download_json":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO.json","view_paper":"https://pith.science/paper/JO257MRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1562&json=true","fetch_graph":"https://pith.science/api/pith-number/JO257MRLBYNWHHN7FSCE5ZXSZO/graph.json","fetch_events":"https://pith.science/api/pith-number/JO257MRLBYNWHHN7FSCE5ZXSZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/action/storage_attestation","attest_author":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/action/author_attestation","sign_citation":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/action/citation_signature","submit_replication":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/action/replication_record"}},"created_at":"2026-05-18T01:12:50.238236+00:00","updated_at":"2026-05-18T01:12:50.238236+00:00"}