{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BYAD5KKIQMAKXYAVGKAXMEJDDL","short_pith_number":"pith:BYAD5KKI","canonical_record":{"source":{"id":"1305.1397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T04:17:48Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"4787da097d9bdce6f342896f5f37a82f13cfa4bd92fa6075f2a1ad493bb1de82","abstract_canon_sha256":"889de11f388da3a85a6c7ce2d17ab19ae19b3a0b2a6d41f2176cfd59ae14eb54"},"schema_version":"1.0"},"canonical_sha256":"0e003ea9488300abe01532817611231afbd78708b9b0c22fa990d242deaccfd2","source":{"kind":"arxiv","id":"1305.1397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1397","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1397v1","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1397","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"BYAD5KKIQMAK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BYAD5KKIQMAKXYAV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BYAD5KKI","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BYAD5KKIQMAKXYAVGKAXMEJDDL","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T04:17:48Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"4787da097d9bdce6f342896f5f37a82f13cfa4bd92fa6075f2a1ad493bb1de82","abstract_canon_sha256":"889de11f388da3a85a6c7ce2d17ab19ae19b3a0b2a6d41f2176cfd59ae14eb54"},"schema_version":"1.0"},"canonical_sha256":"0e003ea9488300abe01532817611231afbd78708b9b0c22fa990d242deaccfd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:21.855596Z","signature_b64":"sZZKVUta42YvS0fReU5ydH87g4QPOn/J75Eu/p7uR7EIserQKRe4qsntyOx8Falhu+ZIrK7CpHNX31+RVcTmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e003ea9488300abe01532817611231afbd78708b9b0c22fa990d242deaccfd2","last_reissued_at":"2026-05-18T03:26:21.854943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:21.854943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1397","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:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbIVt+1+SGu7giOq/4NCx0iVTOT/u4J0zwX2bJteGMtzFeaT/zWe/Dn3oORSaHVXk5vhAO1q5ulSWZL8968iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:53.815948Z"},"content_sha256":"ec1d81f1eac896f27e5b54fe215d1a6e223fae1a207e422e46f1bfc0465fd808","schema_version":"1.0","event_id":"sha256:ec1d81f1eac896f27e5b54fe215d1a6e223fae1a207e422e46f1bfc0465fd808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BYAD5KKIQMAKXYAVGKAXMEJDDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Many Queries Will Resolve Common Randomness?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Himanshu Tyagi, Prakash Narayan","submitted_at":"2013-05-07T04:17:48Z","abstract_excerpt":"A set of m terminals, observing correlated signals, communicate interactively to generate common randomness for a given subset of them. Knowing only the communication, how many direct queries of the value of the common randomness will resolve it? A general upper bound, valid for arbitrary signal alphabets, is developed for the number of such queries by using a query strategy that applies to all common randomness and associated communication. When the underlying signals are independent and identically distributed repetitions of m correlated random variables, the number of queries can be exponen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1397","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:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEDG8ZtsRhjbtuA+zfYaOw/L4mshewBA9H+HsZZGq6MYUYCzB+wuEHiWvAuYCaWO8Rzb/MXlq0xLvDv4HOpdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:53.816625Z"},"content_sha256":"59ec4d1180ccc3672f4e56238c798a453e1a59091dff13b8f16464c48dd6284e","schema_version":"1.0","event_id":"sha256:59ec4d1180ccc3672f4e56238c798a453e1a59091dff13b8f16464c48dd6284e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYAD5KKIQMAKXYAVGKAXMEJDDL/bundle.json","state_url":"https://pith.science/pith/BYAD5KKIQMAKXYAVGKAXMEJDDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYAD5KKIQMAKXYAVGKAXMEJDDL/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-25T22:17:53Z","links":{"resolver":"https://pith.science/pith/BYAD5KKIQMAKXYAVGKAXMEJDDL","bundle":"https://pith.science/pith/BYAD5KKIQMAKXYAVGKAXMEJDDL/bundle.json","state":"https://pith.science/pith/BYAD5KKIQMAKXYAVGKAXMEJDDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYAD5KKIQMAKXYAVGKAXMEJDDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BYAD5KKIQMAKXYAVGKAXMEJDDL","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":"889de11f388da3a85a6c7ce2d17ab19ae19b3a0b2a6d41f2176cfd59ae14eb54","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T04:17:48Z","title_canon_sha256":"4787da097d9bdce6f342896f5f37a82f13cfa4bd92fa6075f2a1ad493bb1de82"},"schema_version":"1.0","source":{"id":"1305.1397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1397","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1397v1","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1397","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"BYAD5KKIQMAK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BYAD5KKIQMAKXYAV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BYAD5KKI","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:59ec4d1180ccc3672f4e56238c798a453e1a59091dff13b8f16464c48dd6284e","target":"graph","created_at":"2026-05-18T03:26:21Z","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":"A set of m terminals, observing correlated signals, communicate interactively to generate common randomness for a given subset of them. Knowing only the communication, how many direct queries of the value of the common randomness will resolve it? A general upper bound, valid for arbitrary signal alphabets, is developed for the number of such queries by using a query strategy that applies to all common randomness and associated communication. When the underlying signals are independent and identically distributed repetitions of m correlated random variables, the number of queries can be exponen","authors_text":"Himanshu Tyagi, Prakash Narayan","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T04:17:48Z","title":"How Many Queries Will Resolve Common Randomness?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1397","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:ec1d81f1eac896f27e5b54fe215d1a6e223fae1a207e422e46f1bfc0465fd808","target":"record","created_at":"2026-05-18T03:26:21Z","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":"889de11f388da3a85a6c7ce2d17ab19ae19b3a0b2a6d41f2176cfd59ae14eb54","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T04:17:48Z","title_canon_sha256":"4787da097d9bdce6f342896f5f37a82f13cfa4bd92fa6075f2a1ad493bb1de82"},"schema_version":"1.0","source":{"id":"1305.1397","kind":"arxiv","version":1}},"canonical_sha256":"0e003ea9488300abe01532817611231afbd78708b9b0c22fa990d242deaccfd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e003ea9488300abe01532817611231afbd78708b9b0c22fa990d242deaccfd2","first_computed_at":"2026-05-18T03:26:21.854943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:21.854943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sZZKVUta42YvS0fReU5ydH87g4QPOn/J75Eu/p7uR7EIserQKRe4qsntyOx8Falhu+ZIrK7CpHNX31+RVcTmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:21.855596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec1d81f1eac896f27e5b54fe215d1a6e223fae1a207e422e46f1bfc0465fd808","sha256:59ec4d1180ccc3672f4e56238c798a453e1a59091dff13b8f16464c48dd6284e"],"state_sha256":"85dc6f0807b2fe3059bde61256cf9319f6f972c3609f7a6cfff4e77f3d274da2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PANowfzC+AG1IJ5u/SnGi8+WQx/m5q9a6DjLqaXH1cq0BFoIG9TcjgpjKfUZ/bncGaU0deJmp7rCfkGdcs2ACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:17:53.820180Z","bundle_sha256":"6ef79df18c4643b672ff9d7d47fbb37a80817d0dd29dd856ce5baafd7a1fdddf"}}