{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5SAJS34IGFNYDG6XBFHMBDETMK","short_pith_number":"pith:5SAJS34I","schema_version":"1.0","canonical_sha256":"ec80996f88315b819bd7094ec08c9362812772437e31fd573cd61f488494b166","source":{"kind":"arxiv","id":"1601.05377","version":2},"attestation_state":"computed","paper":{"title":"Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou","submitted_at":"2016-01-20T19:22:21Z","abstract_excerpt":"In the multiterminal source model of Csisz$\\text{\\'a}$r and Narayan, the communication complexity, $R_{\\text{SK}}$, for secret key (SK) generation is the minimum rate of communication required to achieve SK capacity. An obvious upper bound to $R_{\\text{SK}}$ is given by $R_{\\text{CO}}$, which is the minimum rate of communication required for \\emph{omniscience}. In this paper we derive a better upper bound to $R_{\\text{SK}}$ for the hypergraphical source model, which is a special instance of the multiterminal source model. The upper bound is based on the idea of fractional removal of hyperedges"},"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":"1601.05377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T19:22:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe6f72f1bed3f998582d1c755c6c331de6dc531edb53a64d59db1e11ccaf4077","abstract_canon_sha256":"93f0f2822a7c348f13d4e0a261bc6fc73bd1b1b2b3cd8aac680ff6a113a5cc1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.360688Z","signature_b64":"VJjSBumocZH8nAtpdRHn/Ykafg35kxAOQkU9+Z0eqYGwuLfLBiW8vNpnmAxMFT3Ks0M9OoUp4MnxssM9sPYpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec80996f88315b819bd7094ec08c9362812772437e31fd573cd61f488494b166","last_reissued_at":"2026-05-18T00:58:57.360003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.360003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou","submitted_at":"2016-01-20T19:22:21Z","abstract_excerpt":"In the multiterminal source model of Csisz$\\text{\\'a}$r and Narayan, the communication complexity, $R_{\\text{SK}}$, for secret key (SK) generation is the minimum rate of communication required to achieve SK capacity. An obvious upper bound to $R_{\\text{SK}}$ is given by $R_{\\text{CO}}$, which is the minimum rate of communication required for \\emph{omniscience}. In this paper we derive a better upper bound to $R_{\\text{SK}}$ for the hypergraphical source model, which is a special instance of the multiterminal source model. The upper bound is based on the idea of fractional removal of hyperedges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05377","kind":"arxiv","version":2},"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":"1601.05377","created_at":"2026-05-18T00:58:57.360111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05377v2","created_at":"2026-05-18T00:58:57.360111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05377","created_at":"2026-05-18T00:58:57.360111+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SAJS34IGFNY","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SAJS34IGFNYDG6X","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SAJS34I","created_at":"2026-05-18T12:30:01.593930+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/5SAJS34IGFNYDG6XBFHMBDETMK","json":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK.json","graph_json":"https://pith.science/api/pith-number/5SAJS34IGFNYDG6XBFHMBDETMK/graph.json","events_json":"https://pith.science/api/pith-number/5SAJS34IGFNYDG6XBFHMBDETMK/events.json","paper":"https://pith.science/paper/5SAJS34I"},"agent_actions":{"view_html":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK","download_json":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK.json","view_paper":"https://pith.science/paper/5SAJS34I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05377&json=true","fetch_graph":"https://pith.science/api/pith-number/5SAJS34IGFNYDG6XBFHMBDETMK/graph.json","fetch_events":"https://pith.science/api/pith-number/5SAJS34IGFNYDG6XBFHMBDETMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/action/storage_attestation","attest_author":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/action/author_attestation","sign_citation":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/action/citation_signature","submit_replication":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/action/replication_record"}},"created_at":"2026-05-18T00:58:57.360111+00:00","updated_at":"2026-05-18T00:58:57.360111+00:00"}