{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JO257MRLBYNWHHN7FSCE5ZXSZO","short_pith_number":"pith:JO257MRL","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"},"canonical_sha256":"4bb5dfb22b0e1b639dbf2c844ee6f2cbb6fa6d91e2a08aae040b996b39e1d7a4","source":{"kind":"arxiv","id":"1308.1562","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1562","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1562v2","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1562","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"JO257MRLBYNW","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JO257MRLBYNWHHN7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JO257MRL","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JO257MRLBYNWHHN7FSCE5ZXSZO","target":"record","payload":{"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"},"canonical_sha256":"4bb5dfb22b0e1b639dbf2c844ee6f2cbb6fa6d91e2a08aae040b996b39e1d7a4","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"},"source_kind":"arxiv","source_id":"1308.1562","source_version":2,"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-18T01:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEZHnjfVDcbtMFUkvGFlo46jXCjrjn87e9el0xBAvtappHlNbv/JlR+02GV7MggND4UL6N18K4VmPPHQjcslCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:34:42.246648Z"},"content_sha256":"9243fbe877e63c4acf84b26861cf203eda4be5880441bebcab5b51e89a7fc1dc","schema_version":"1.0","event_id":"sha256:9243fbe877e63c4acf84b26861cf203eda4be5880441bebcab5b51e89a7fc1dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JO257MRLBYNWHHN7FSCE5ZXSZO","target":"graph","payload":{"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"},"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-18T01:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Nw5bv22BqjOPttqULiTstvfChYeeU1xfqHgnsdEJkeHOfDzBrGWgt9AS+az6bQcXbSltWx0YjLYsPiTEf/7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:34:42.247387Z"},"content_sha256":"61825166b2b7cd492b364d44c12504f515e46c42752ea5f2b52e6c7dea80bdcf","schema_version":"1.0","event_id":"sha256:61825166b2b7cd492b364d44c12504f515e46c42752ea5f2b52e6c7dea80bdcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/bundle.json","state_url":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/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-09T08:34:42Z","links":{"resolver":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO","bundle":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/bundle.json","state":"https://pith.science/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JO257MRLBYNWHHN7FSCE5ZXSZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JO257MRLBYNWHHN7FSCE5ZXSZO","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":"8aa2038e34132ef6795651659fbcb88cdf388402d23cd9f1f0515e29bef729a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-07T13:16:33Z","title_canon_sha256":"b8ff6d70408ad00e24987671bdb0bc46b3746c3be25d2c09ba1d40b3f98a6a26"},"schema_version":"1.0","source":{"id":"1308.1562","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1562","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1562v2","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1562","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"JO257MRLBYNW","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JO257MRLBYNWHHN7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JO257MRL","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:61825166b2b7cd492b364d44c12504f515e46c42752ea5f2b52e6c7dea80bdcf","target":"graph","created_at":"2026-05-18T01:12:50Z","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":"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","authors_text":"Mark Huber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-07T13:16:33Z","title":"Nearly optimal Bernoulli factories for linear functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1562","kind":"arxiv","version":2},"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:9243fbe877e63c4acf84b26861cf203eda4be5880441bebcab5b51e89a7fc1dc","target":"record","created_at":"2026-05-18T01:12:50Z","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":"8aa2038e34132ef6795651659fbcb88cdf388402d23cd9f1f0515e29bef729a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-07T13:16:33Z","title_canon_sha256":"b8ff6d70408ad00e24987671bdb0bc46b3746c3be25d2c09ba1d40b3f98a6a26"},"schema_version":"1.0","source":{"id":"1308.1562","kind":"arxiv","version":2}},"canonical_sha256":"4bb5dfb22b0e1b639dbf2c844ee6f2cbb6fa6d91e2a08aae040b996b39e1d7a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bb5dfb22b0e1b639dbf2c844ee6f2cbb6fa6d91e2a08aae040b996b39e1d7a4","first_computed_at":"2026-05-18T01:12:50.238181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:50.238181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S9BP5o/PYjK4qTzVv+wZG2QV5PVXnLmaanFqopHgLF2Kv3uLyaiQcj9Bqkysx2x6bTW/juKE7/lR6tAQZzT0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:50.238526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1562","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9243fbe877e63c4acf84b26861cf203eda4be5880441bebcab5b51e89a7fc1dc","sha256:61825166b2b7cd492b364d44c12504f515e46c42752ea5f2b52e6c7dea80bdcf"],"state_sha256":"c33036657992ba6fcf475dcfea997274288dc20dfad35689c123c550324af5f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLRhzbjLumfibU9NCLcGRaHqio54/5WwuIstedJHh4kGMJqlCRb9E0wK3caig5b3DG3kGipZLw17hSuaOrDtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:34:42.251182Z","bundle_sha256":"2fc02a0350f2ed31870c92210d50426cac7d919510932859a7c5ce0cf396186d"}}