{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HXWZ3V65OMQYEGRO24AVBLD3KF","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":"a12664c263655e10938c05fb0f8a4528983dd081ae8bf147de2faff516dbe6b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-14T12:46:38Z","title_canon_sha256":"e451339c61ad532c8ba1b7dc75a63a917b6008b950f571647143f4cd3d5908fa"},"schema_version":"1.0","source":{"id":"1007.2315","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2315","created_at":"2026-05-18T04:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2315v2","created_at":"2026-05-18T04:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2315","created_at":"2026-05-18T04:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"HXWZ3V65OMQY","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HXWZ3V65OMQYEGRO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HXWZ3V65","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:a1d4754c78f840453f8bf744e8fface72b8d07bab8988e3cab5b7cd77804836f","target":"graph","created_at":"2026-05-18T04:12:32Z","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 Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of random bits with high probability but without communicating. How many such bits can they extract? The trivial strategy of outputting the first $k$ bits yields an agreement probability of $(1 - \\eps)^k < 2^{-1.44k\\eps}$, where $\\eps$ is the amount of noise. We show that no strategy can achieve agreement probability better than $2^{-k\\eps/(1 - \\eps)}$.\n  On the other hand, we show that when $k \\geq 10 + 2 (1 - \\eps) / \\eps","authors_text":"Andrej Bogdanov, Elchanan Mossel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-14T12:46:38Z","title":"On extracting common random bits from correlated sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2315","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:b76b91df66b8c4871994e11c74c741dca6d7d0e77c37c56c32b4e9a4f00b4643","target":"record","created_at":"2026-05-18T04:12:32Z","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":"a12664c263655e10938c05fb0f8a4528983dd081ae8bf147de2faff516dbe6b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-14T12:46:38Z","title_canon_sha256":"e451339c61ad532c8ba1b7dc75a63a917b6008b950f571647143f4cd3d5908fa"},"schema_version":"1.0","source":{"id":"1007.2315","kind":"arxiv","version":2}},"canonical_sha256":"3ded9dd7dd7321821a2ed70150ac7b5162b10e2b93acd14ecaf12502a179d0db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ded9dd7dd7321821a2ed70150ac7b5162b10e2b93acd14ecaf12502a179d0db","first_computed_at":"2026-05-18T04:12:32.465424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:32.465424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"svOc65RAa+ctUiicOiyR143iLc/8d9ssH83JKbsEPgs7sMfExGBhIGeyPAMdK8eKKOK0wh3E5sd92BBPygOACg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:32.465956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2315","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b76b91df66b8c4871994e11c74c741dca6d7d0e77c37c56c32b4e9a4f00b4643","sha256:a1d4754c78f840453f8bf744e8fface72b8d07bab8988e3cab5b7cd77804836f"],"state_sha256":"16ca14a5ac08b3709c1d1f006b5efb3db87a403b7eaa84e336c7cbe5d01f539f"}