{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FOHP4MMLCMDSM466L6BTZYIB67","short_pith_number":"pith:FOHP4MML","schema_version":"1.0","canonical_sha256":"2b8efe318b13072673de5f833ce101f7ca92a77ee2dc12c0145c13f83c29e85a","source":{"kind":"arxiv","id":"1507.02874","version":1},"attestation_state":"computed","paper":{"title":"On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam","submitted_at":"2015-07-10T12:31:45Z","abstract_excerpt":"The focus of this paper is on the public communication required for generating a maximal-rate secret key (SK) within the multiterminal source model of Csisz{\\'a}r and Narayan. Building on the prior work of Tyagi for the two-terminal scenario, we derive a lower bound on the communication complexity, $R_{\\text{SK}}$, defined to be the minimum rate of public communication needed to generate a maximal-rate SK. It is well known that the minimum rate of communication for omniscience, denoted by $R_{\\text{CO}}$, is an upper bound on $R_{\\text{SK}}$. For the class of pairwise independent network (PIN)"},"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":"1507.02874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T12:31:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d8d95d45025111859ae8e22925c81c6ebccf679df75d7cbc13d4b80ef1f5397","abstract_canon_sha256":"cf88e81f93b12e95871dc01f2810597e4c23fefa6db6a410e42037c725718251"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.591103Z","signature_b64":"o/t8M6D9SBYm4EC2iNCzQUSs3rbt+qkD3mxR3BZNs4Ak/pY9Xs2KEXiwhIrtJ9NcjYDtBhiytPWVvm/05twtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b8efe318b13072673de5f833ce101f7ca92a77ee2dc12c0145c13f83c29e85a","last_reissued_at":"2026-05-18T00:58:10.590205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.590205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam","submitted_at":"2015-07-10T12:31:45Z","abstract_excerpt":"The focus of this paper is on the public communication required for generating a maximal-rate secret key (SK) within the multiterminal source model of Csisz{\\'a}r and Narayan. Building on the prior work of Tyagi for the two-terminal scenario, we derive a lower bound on the communication complexity, $R_{\\text{SK}}$, defined to be the minimum rate of public communication needed to generate a maximal-rate SK. It is well known that the minimum rate of communication for omniscience, denoted by $R_{\\text{CO}}$, is an upper bound on $R_{\\text{SK}}$. For the class of pairwise independent network (PIN)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02874","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":"1507.02874","created_at":"2026-05-18T00:58:10.590359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02874v1","created_at":"2026-05-18T00:58:10.590359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02874","created_at":"2026-05-18T00:58:10.590359+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOHP4MMLCMDS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOHP4MMLCMDSM466","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOHP4MML","created_at":"2026-05-18T12:29:19.899920+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/FOHP4MMLCMDSM466L6BTZYIB67","json":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67.json","graph_json":"https://pith.science/api/pith-number/FOHP4MMLCMDSM466L6BTZYIB67/graph.json","events_json":"https://pith.science/api/pith-number/FOHP4MMLCMDSM466L6BTZYIB67/events.json","paper":"https://pith.science/paper/FOHP4MML"},"agent_actions":{"view_html":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67","download_json":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67.json","view_paper":"https://pith.science/paper/FOHP4MML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02874&json=true","fetch_graph":"https://pith.science/api/pith-number/FOHP4MMLCMDSM466L6BTZYIB67/graph.json","fetch_events":"https://pith.science/api/pith-number/FOHP4MMLCMDSM466L6BTZYIB67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/action/storage_attestation","attest_author":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/action/author_attestation","sign_citation":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/action/citation_signature","submit_replication":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/action/replication_record"}},"created_at":"2026-05-18T00:58:10.590359+00:00","updated_at":"2026-05-18T00:58:10.590359+00:00"}