{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GSWXNPWFOZHK62HXTSTRRDATR4","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":"092c6717db18e282d9be1a352c5d076bd1f325882ecb82d4b67335657f7c401a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-06T15:24:36Z","title_canon_sha256":"210e2d941123687b8b199e96fa281b354496a140c6962a2b44ac69c3af32acc5"},"schema_version":"1.0","source":{"id":"1401.1117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1117","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1117v2","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1117","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"GSWXNPWFOZHK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GSWXNPWFOZHK62HX","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GSWXNPWF","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:7159d0236e294425f03b0abc5fa9e474bfebd7aad54b4b14523215ec61484438","target":"graph","created_at":"2026-05-18T03:02:33Z","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":"Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication compl","authors_text":"Manuj Mukherjee, Navin Kashyap","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-06T15:24:36Z","title":"On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1117","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:12b805ab4083b9e0fdbfeb40fc251061188992eaec1f05b5539e475bd7e20c07","target":"record","created_at":"2026-05-18T03:02:33Z","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":"092c6717db18e282d9be1a352c5d076bd1f325882ecb82d4b67335657f7c401a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-06T15:24:36Z","title_canon_sha256":"210e2d941123687b8b199e96fa281b354496a140c6962a2b44ac69c3af32acc5"},"schema_version":"1.0","source":{"id":"1401.1117","kind":"arxiv","version":2}},"canonical_sha256":"34ad76bec5764eaf68f79ca7188c138f235865dd7f985f175f2a0f29c28097aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34ad76bec5764eaf68f79ca7188c138f235865dd7f985f175f2a0f29c28097aa","first_computed_at":"2026-05-18T03:02:33.763792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:33.763792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E+4yHYUVa0rkT5mFj/qID+vdKznH5eRLPpqvLA812FB3tpcfY2Mi1hfD2Na/hHevSKRqZKOnVgOJJxjufiGMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:33.764350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12b805ab4083b9e0fdbfeb40fc251061188992eaec1f05b5539e475bd7e20c07","sha256:7159d0236e294425f03b0abc5fa9e474bfebd7aad54b4b14523215ec61484438"],"state_sha256":"d5aa0e2059a19207a6aa86c03223b45acc59736bd86a85e521b846b122d792ed"}