{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HXWZ3V65OMQYEGRO24AVBLD3KF","short_pith_number":"pith:HXWZ3V65","canonical_record":{"source":{"id":"1007.2315","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-14T12:46:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e451339c61ad532c8ba1b7dc75a63a917b6008b950f571647143f4cd3d5908fa","abstract_canon_sha256":"a12664c263655e10938c05fb0f8a4528983dd081ae8bf147de2faff516dbe6b6"},"schema_version":"1.0"},"canonical_sha256":"3ded9dd7dd7321821a2ed70150ac7b5162b10e2b93acd14ecaf12502a179d0db","source":{"kind":"arxiv","id":"1007.2315","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HXWZ3V65OMQYEGRO24AVBLD3KF","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2315","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-14T12:46:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e451339c61ad532c8ba1b7dc75a63a917b6008b950f571647143f4cd3d5908fa","abstract_canon_sha256":"a12664c263655e10938c05fb0f8a4528983dd081ae8bf147de2faff516dbe6b6"},"schema_version":"1.0"},"canonical_sha256":"3ded9dd7dd7321821a2ed70150ac7b5162b10e2b93acd14ecaf12502a179d0db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:32.465956Z","signature_b64":"svOc65RAa+ctUiicOiyR143iLc/8d9ssH83JKbsEPgs7sMfExGBhIGeyPAMdK8eKKOK0wh3E5sd92BBPygOACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ded9dd7dd7321821a2ed70150ac7b5162b10e2b93acd14ecaf12502a179d0db","last_reissued_at":"2026-05-18T04:12:32.465424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:32.465424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2315","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-18T04:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7imkSfKBbwHf+VeAmg1/L/brK0HAeAag68BzEVODlpJSkR/S37WkoIvFD81U7/gtBGJJ0Nk9s5eCoVixqCLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:54:13.873224Z"},"content_sha256":"b76b91df66b8c4871994e11c74c741dca6d7d0e77c37c56c32b4e9a4f00b4643","schema_version":"1.0","event_id":"sha256:b76b91df66b8c4871994e11c74c741dca6d7d0e77c37c56c32b4e9a4f00b4643"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HXWZ3V65OMQYEGRO24AVBLD3KF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On extracting common random bits from correlated sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrej Bogdanov, Elchanan Mossel","submitted_at":"2010-07-14T12:46:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2315","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-18T04:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k14niESpIBDdfUIyUovqSWFYRDCkjQDJqyK+QTetmEM4jnpJsyq0vXigotezaIBOciYlbRvhayOzcU2J+q1iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:54:13.873647Z"},"content_sha256":"a1d4754c78f840453f8bf744e8fface72b8d07bab8988e3cab5b7cd77804836f","schema_version":"1.0","event_id":"sha256:a1d4754c78f840453f8bf744e8fface72b8d07bab8988e3cab5b7cd77804836f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXWZ3V65OMQYEGRO24AVBLD3KF/bundle.json","state_url":"https://pith.science/pith/HXWZ3V65OMQYEGRO24AVBLD3KF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXWZ3V65OMQYEGRO24AVBLD3KF/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-05-31T08:54:13Z","links":{"resolver":"https://pith.science/pith/HXWZ3V65OMQYEGRO24AVBLD3KF","bundle":"https://pith.science/pith/HXWZ3V65OMQYEGRO24AVBLD3KF/bundle.json","state":"https://pith.science/pith/HXWZ3V65OMQYEGRO24AVBLD3KF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXWZ3V65OMQYEGRO24AVBLD3KF/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt0lq25RAHvHnAChMhfFuGdnUbuknkZeGYVYG84S+l7hqmPHzMUGyE309/cwZl2mDNqN9Dgach0QanA4qXwGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:54:13.877574Z","bundle_sha256":"fcf91aa187916f71d9b775f0c12932af53ae149c7841edb70de6468c58d46731"}}