{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W2XHQXGPY5TPVXH224WXBOGYU3","short_pith_number":"pith:W2XHQXGP","schema_version":"1.0","canonical_sha256":"b6ae785ccfc766fadcfad72d70b8d8a6d1af616eed9f663f16b96736d72af887","source":{"kind":"arxiv","id":"1808.08907","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.08907","created_at":"2026-05-18T00:07:12.863158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08907v1","created_at":"2026-05-18T00:07:12.863158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08907","created_at":"2026-05-18T00:07:12.863158+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2XHQXGPY5TP","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2XHQXGPY5TPVXH2","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2XHQXGP","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3","json":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3.json","graph_json":"https://pith.science/api/pith-number/W2XHQXGPY5TPVXH224WXBOGYU3/graph.json","events_json":"https://pith.science/api/pith-number/W2XHQXGPY5TPVXH224WXBOGYU3/events.json","paper":"https://pith.science/paper/W2XHQXGP"},"agent_actions":{"view_html":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3","download_json":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3.json","view_paper":"https://pith.science/paper/W2XHQXGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08907&json=true","fetch_graph":"https://pith.science/api/pith-number/W2XHQXGPY5TPVXH224WXBOGYU3/graph.json","fetch_events":"https://pith.science/api/pith-number/W2XHQXGPY5TPVXH224WXBOGYU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/action/storage_attestation","attest_author":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/action/author_attestation","sign_citation":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/action/citation_signature","submit_replication":"https://pith.science/pith/W2XHQXGPY5TPVXH224WXBOGYU3/action/replication_record"}},"created_at":"2026-05-18T00:07:12.863158+00:00","updated_at":"2026-05-18T00:07:12.863158+00:00"}