{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TWC7E3VMUDA7OCSSTI5DYT5YVV","short_pith_number":"pith:TWC7E3VM","canonical_record":{"source":{"id":"1208.5946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-29T15:27:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9def21216be1461b554f42d826c94bda52edf734adef648790b4134f87e5f91d","abstract_canon_sha256":"9f3c364e86fd95cf56f3f47e99ad6e921b85cdb3147ea074c5af096c7484ea60"},"schema_version":"1.0"},"canonical_sha256":"9d85f26eaca0c1f70a529a3a3c4fb8ad4e002e9cb14211840f27f54d6801be5e","source":{"kind":"arxiv","id":"1208.5946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5946","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5946v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5946","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"TWC7E3VMUDA7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TWC7E3VMUDA7OCSS","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TWC7E3VM","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TWC7E3VMUDA7OCSSTI5DYT5YVV","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-29T15:27:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9def21216be1461b554f42d826c94bda52edf734adef648790b4134f87e5f91d","abstract_canon_sha256":"9f3c364e86fd95cf56f3f47e99ad6e921b85cdb3147ea074c5af096c7484ea60"},"schema_version":"1.0"},"canonical_sha256":"9d85f26eaca0c1f70a529a3a3c4fb8ad4e002e9cb14211840f27f54d6801be5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:48.256363Z","signature_b64":"ac6ME/19s1mVIi67D9CEGxhAqsQ12HcxcS/IDFW3YbhDjQF2JsezcTkaB08vuS5itxW38Bc7s/EcqjmM1L6HDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d85f26eaca0c1f70a529a3a3c4fb8ad4e002e9cb14211840f27f54d6801be5e","last_reissued_at":"2026-05-18T03:46:48.255637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:48.255637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5946","source_version":1,"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-18T03:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tTAHt+ZGf4kBgfv90nN0NN0fjbPdbYAtykBfMSqh4KZJFNN6Ax3+4JUO4Y+XHhB3fz1YQDXsEzBnPFx0aVbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:53:30.655004Z"},"content_sha256":"8b7c0f24dc366557db386e7839b421ef822e2320f0de653aacd7c9135d261f13","schema_version":"1.0","event_id":"sha256:8b7c0f24dc366557db386e7839b421ef822e2320f0de653aacd7c9135d261f13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TWC7E3VMUDA7OCSSTI5DYT5YVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On extracting common random bits from correlated sources on large alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elchanan Mossel, Joe Neeman, Siu On Chan","submitted_at":"2012-08-29T15:27:35Z","abstract_excerpt":"Suppose Alice and Bob receive strings $X=(X_1,...,X_n)$ and $Y=(Y_1,...,Y_n)$ each uniformly random in $[s]^n$ but so that $X$ and $Y$ are correlated . For each symbol $i$, we have that $Y_i = X_i$ with probability $1-\\eps$ and otherwise $Y_i$ is chosen independently and uniformly from $[s]$.\n  Alice and Bob wish to use their respective strings to extract a uniformly chosen common sequence from $[s]^k$ but without communicating. How well can they do? The trivial strategy of outputting the first $k$ symbols yields an agreement probability of $(1 - \\eps + \\eps/s)^k$. In a recent work by Bogdanov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5946","kind":"arxiv","version":1},"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-18T03:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eC7mN3VZsYuYTAri9cLA+IWkehqHgCRaCbT/XBq9bI6uRKSzbI0gVBtd3d+x5hdhE6k1ADrEdfEy1e6VOvtaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:53:30.655621Z"},"content_sha256":"196d30266961143d31714e914a95cc3025d13e8758930e6f17357372a23bd92e","schema_version":"1.0","event_id":"sha256:196d30266961143d31714e914a95cc3025d13e8758930e6f17357372a23bd92e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWC7E3VMUDA7OCSSTI5DYT5YVV/bundle.json","state_url":"https://pith.science/pith/TWC7E3VMUDA7OCSSTI5DYT5YVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWC7E3VMUDA7OCSSTI5DYT5YVV/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-31T07:53:30Z","links":{"resolver":"https://pith.science/pith/TWC7E3VMUDA7OCSSTI5DYT5YVV","bundle":"https://pith.science/pith/TWC7E3VMUDA7OCSSTI5DYT5YVV/bundle.json","state":"https://pith.science/pith/TWC7E3VMUDA7OCSSTI5DYT5YVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWC7E3VMUDA7OCSSTI5DYT5YVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TWC7E3VMUDA7OCSSTI5DYT5YVV","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":"9f3c364e86fd95cf56f3f47e99ad6e921b85cdb3147ea074c5af096c7484ea60","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-29T15:27:35Z","title_canon_sha256":"9def21216be1461b554f42d826c94bda52edf734adef648790b4134f87e5f91d"},"schema_version":"1.0","source":{"id":"1208.5946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5946","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5946v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5946","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"TWC7E3VMUDA7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TWC7E3VMUDA7OCSS","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TWC7E3VM","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:196d30266961143d31714e914a95cc3025d13e8758930e6f17357372a23bd92e","target":"graph","created_at":"2026-05-18T03:46:48Z","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 $X=(X_1,...,X_n)$ and $Y=(Y_1,...,Y_n)$ each uniformly random in $[s]^n$ but so that $X$ and $Y$ are correlated . For each symbol $i$, we have that $Y_i = X_i$ with probability $1-\\eps$ and otherwise $Y_i$ is chosen independently and uniformly from $[s]$.\n  Alice and Bob wish to use their respective strings to extract a uniformly chosen common sequence from $[s]^k$ but without communicating. How well can they do? The trivial strategy of outputting the first $k$ symbols yields an agreement probability of $(1 - \\eps + \\eps/s)^k$. In a recent work by Bogdanov","authors_text":"Elchanan Mossel, Joe Neeman, Siu On Chan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-29T15:27:35Z","title":"On extracting common random bits from correlated sources on large alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5946","kind":"arxiv","version":1},"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:8b7c0f24dc366557db386e7839b421ef822e2320f0de653aacd7c9135d261f13","target":"record","created_at":"2026-05-18T03:46:48Z","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":"9f3c364e86fd95cf56f3f47e99ad6e921b85cdb3147ea074c5af096c7484ea60","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-29T15:27:35Z","title_canon_sha256":"9def21216be1461b554f42d826c94bda52edf734adef648790b4134f87e5f91d"},"schema_version":"1.0","source":{"id":"1208.5946","kind":"arxiv","version":1}},"canonical_sha256":"9d85f26eaca0c1f70a529a3a3c4fb8ad4e002e9cb14211840f27f54d6801be5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d85f26eaca0c1f70a529a3a3c4fb8ad4e002e9cb14211840f27f54d6801be5e","first_computed_at":"2026-05-18T03:46:48.255637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:48.255637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ac6ME/19s1mVIi67D9CEGxhAqsQ12HcxcS/IDFW3YbhDjQF2JsezcTkaB08vuS5itxW38Bc7s/EcqjmM1L6HDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:48.256363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b7c0f24dc366557db386e7839b421ef822e2320f0de653aacd7c9135d261f13","sha256:196d30266961143d31714e914a95cc3025d13e8758930e6f17357372a23bd92e"],"state_sha256":"132130ba8879ab887722c72e3276a866e66eceb90c43e85aaee257bf32481f3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJEoBp9NFhJUNURRTBQ3WFQpIzAfEX/GbQqeuALTkyxMounms+BnEKAIQwe7Kv3SPpTmh8had1P8t0LhbaaYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:53:30.658878Z","bundle_sha256":"77c6ad41b2950eeacb3961e04e9811aaa85b7dafa5b22ae0103c424008608e81"}}