{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W2XHQXGPY5TPVXH224WXBOGYU3","short_pith_number":"pith:W2XHQXGP","canonical_record":{"source":{"id":"1808.08907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-27T16:22:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fe778a6f00ccdbbeb98d8419056cf7ea30f5fa477918139c743c5843f606c3e","abstract_canon_sha256":"0710f3f1add808d8aac5fdfd1d7d2057071e5faeb20e2738b782f9009cf9d2ea"},"schema_version":"1.0"},"canonical_sha256":"b6ae785ccfc766fadcfad72d70b8d8a6d1af616eed9f663f16b96736d72af887","source":{"kind":"arxiv","id":"1808.08907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08907","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08907v1","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08907","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"W2XHQXGPY5TP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W2XHQXGPY5TPVXH2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W2XHQXGP","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W2XHQXGPY5TPVXH224WXBOGYU3","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-27T16:22:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fe778a6f00ccdbbeb98d8419056cf7ea30f5fa477918139c743c5843f606c3e","abstract_canon_sha256":"0710f3f1add808d8aac5fdfd1d7d2057071e5faeb20e2738b782f9009cf9d2ea"},"schema_version":"1.0"},"canonical_sha256":"b6ae785ccfc766fadcfad72d70b8d8a6d1af616eed9f663f16b96736d72af887","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:12.863760Z","signature_b64":"M3YlGPlDikeEYZzlLi7QuBtuMydWIkqy9xt6GGgNv36LpJR8s/qYA9r3LKr57eKH3GKJlhaLXfyOgSSPNkKiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ae785ccfc766fadcfad72d70b8d8a6d1af616eed9f663f16b96736d72af887","last_reissued_at":"2026-05-18T00:07:12.863054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:12.863054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08907","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-18T00:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFquJwHKIcYfWHnChzE8cbUr+/MpT0YCI0KKAQTz5GDSoLtCTqcskv7FPZJoKmmeApgrSmJCFwV5bOQheMA6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:41:30.126248Z"},"content_sha256":"15abbfc0d618ac24ce7be279fe304fa1309c668b039d1b700ca4dc2a97e96c37","schema_version":"1.0","event_id":"sha256:15abbfc0d618ac24ce7be279fe304fa1309c668b039d1b700ca4dc2a97e96c37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W2XHQXGPY5TPVXH224WXBOGYU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Badih Ghazi, Madhu Sudan, Mitali Bafna, Noah Golowich","submitted_at":"2018-08-27T16:22:26Z","abstract_excerpt":"We study the role of interaction in the Common Randomness Generation (CRG) and Secret Key Generation (SKG) problems. In the CRG problem, two players, Alice and Bob, respectively get samples $X_1,X_2,\\dots$ and $Y_1,Y_2,\\dots$ with the pairs $(X_1,Y_1)$, $(X_2, Y_2)$, $\\dots$ being drawn independently from some known probability distribution $\\mu$. They wish to communicate so as to agree on $L$ bits of randomness. The SKG problem is the restriction of the CRG problem to the case where the key is required to be close to random even to an eavesdropper who can listen to their communication (but do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08907","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-18T00:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFu2cUkGv33UJ09VVVE/IOirNNPxjKS75b9MOqsGsjf/kuOAxJP26etPc5VT+LoPcwrXwdggikav2WWg+QQ6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:41:30.126950Z"},"content_sha256":"9673f01355627daaaf47234ec74d08f071827f84a8cc53ef4bfff013eeadc81a","schema_version":"1.0","event_id":"sha256:9673f01355627daaaf47234ec74d08f071827f84a8cc53ef4bfff013eeadc81a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/bundle.json","state_url":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2XHQXGPY5TPVXH224WXBOGYU3/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-26T10:41:30Z","links":{"resolver":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3","bundle":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/bundle.json","state":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2XHQXGPY5TPVXH224WXBOGYU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W2XHQXGPY5TPVXH224WXBOGYU3","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":"0710f3f1add808d8aac5fdfd1d7d2057071e5faeb20e2738b782f9009cf9d2ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-27T16:22:26Z","title_canon_sha256":"3fe778a6f00ccdbbeb98d8419056cf7ea30f5fa477918139c743c5843f606c3e"},"schema_version":"1.0","source":{"id":"1808.08907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08907","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08907v1","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08907","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"W2XHQXGPY5TP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W2XHQXGPY5TPVXH2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W2XHQXGP","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:9673f01355627daaaf47234ec74d08f071827f84a8cc53ef4bfff013eeadc81a","target":"graph","created_at":"2026-05-18T00:07:12Z","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":"We study the role of interaction in the Common Randomness Generation (CRG) and Secret Key Generation (SKG) problems. In the CRG problem, two players, Alice and Bob, respectively get samples $X_1,X_2,\\dots$ and $Y_1,Y_2,\\dots$ with the pairs $(X_1,Y_1)$, $(X_2, Y_2)$, $\\dots$ being drawn independently from some known probability distribution $\\mu$. They wish to communicate so as to agree on $L$ bits of randomness. The SKG problem is the restriction of the CRG problem to the case where the key is required to be close to random even to an eavesdropper who can listen to their communication (but do","authors_text":"Badih Ghazi, Madhu Sudan, Mitali Bafna, Noah Golowich","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-27T16:22:26Z","title":"Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08907","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:15abbfc0d618ac24ce7be279fe304fa1309c668b039d1b700ca4dc2a97e96c37","target":"record","created_at":"2026-05-18T00:07:12Z","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":"0710f3f1add808d8aac5fdfd1d7d2057071e5faeb20e2738b782f9009cf9d2ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-27T16:22:26Z","title_canon_sha256":"3fe778a6f00ccdbbeb98d8419056cf7ea30f5fa477918139c743c5843f606c3e"},"schema_version":"1.0","source":{"id":"1808.08907","kind":"arxiv","version":1}},"canonical_sha256":"b6ae785ccfc766fadcfad72d70b8d8a6d1af616eed9f663f16b96736d72af887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6ae785ccfc766fadcfad72d70b8d8a6d1af616eed9f663f16b96736d72af887","first_computed_at":"2026-05-18T00:07:12.863054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:12.863054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M3YlGPlDikeEYZzlLi7QuBtuMydWIkqy9xt6GGgNv36LpJR8s/qYA9r3LKr57eKH3GKJlhaLXfyOgSSPNkKiDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:12.863760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15abbfc0d618ac24ce7be279fe304fa1309c668b039d1b700ca4dc2a97e96c37","sha256:9673f01355627daaaf47234ec74d08f071827f84a8cc53ef4bfff013eeadc81a"],"state_sha256":"e8ae859024ba637e97dfb4cc73f1a5845ac362eea3d3b9d8eb332a047fa75040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60LoaWYeMCHUerMKHg5i/1XnGSWUV8rHm9JcPPbpTn2Sk7dLkXnATrsuzitRgCgvzMrtwraXSUsL8JH7k1qFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:41:30.130522Z","bundle_sha256":"0a7cbe7c0ab7004e74174401adc882b46c9d2a36977e77ee4bd6ef1bde58cb7a"}}