{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5SAJS34IGFNYDG6XBFHMBDETMK","short_pith_number":"pith:5SAJS34I","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"},"canonical_sha256":"ec80996f88315b819bd7094ec08c9362812772437e31fd573cd61f488494b166","source":{"kind":"arxiv","id":"1601.05377","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05377","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05377v2","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05377","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"5SAJS34IGFNY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SAJS34IGFNYDG6X","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SAJS34I","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5SAJS34IGFNYDG6XBFHMBDETMK","target":"record","payload":{"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"},"canonical_sha256":"ec80996f88315b819bd7094ec08c9362812772437e31fd573cd61f488494b166","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"},"source_kind":"arxiv","source_id":"1601.05377","source_version":2,"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:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTB72lCxMq/mA2RrDoNcWv3AGqB7xFFpj6vm8Gbq7zGe0qWgdBNGrrJ2Kg5nsdIylYqfspUSCui1RztY+HQmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:35:36.206374Z"},"content_sha256":"9f748a88568463102d3aad9c931a56c9857bc2238f13c50c29b71e31c54f638a","schema_version":"1.0","event_id":"sha256:9f748a88568463102d3aad9c931a56c9857bc2238f13c50c29b71e31c54f638a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5SAJS34IGFNYDG6XBFHMBDETMK","target":"graph","payload":{"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"},"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:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17lGOsW9Te1fq1iGd9oB8+LQ0VtxqynxH9oBA1euCur9OFwNBw6ublnwmGy5y56nPExNS4m4XPtFwj5LFd+LBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:35:36.207003Z"},"content_sha256":"8ad6a147b8f78671cb429bc19c6844af16380b42058a94a6c9e717a6df459c12","schema_version":"1.0","event_id":"sha256:8ad6a147b8f78671cb429bc19c6844af16380b42058a94a6c9e717a6df459c12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/bundle.json","state_url":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SAJS34IGFNYDG6XBFHMBDETMK/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-26T12:35:36Z","links":{"resolver":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK","bundle":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/bundle.json","state":"https://pith.science/pith/5SAJS34IGFNYDG6XBFHMBDETMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SAJS34IGFNYDG6XBFHMBDETMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5SAJS34IGFNYDG6XBFHMBDETMK","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":"93f0f2822a7c348f13d4e0a261bc6fc73bd1b1b2b3cd8aac680ff6a113a5cc1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T19:22:21Z","title_canon_sha256":"fe6f72f1bed3f998582d1c755c6c331de6dc531edb53a64d59db1e11ccaf4077"},"schema_version":"1.0","source":{"id":"1601.05377","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05377","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05377v2","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05377","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"5SAJS34IGFNY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SAJS34IGFNYDG6X","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SAJS34I","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:8ad6a147b8f78671cb429bc19c6844af16380b42058a94a6c9e717a6df459c12","target":"graph","created_at":"2026-05-18T00:58:57Z","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":"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","authors_text":"Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T19:22:21Z","title":"Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05377","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:9f748a88568463102d3aad9c931a56c9857bc2238f13c50c29b71e31c54f638a","target":"record","created_at":"2026-05-18T00:58:57Z","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":"93f0f2822a7c348f13d4e0a261bc6fc73bd1b1b2b3cd8aac680ff6a113a5cc1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T19:22:21Z","title_canon_sha256":"fe6f72f1bed3f998582d1c755c6c331de6dc531edb53a64d59db1e11ccaf4077"},"schema_version":"1.0","source":{"id":"1601.05377","kind":"arxiv","version":2}},"canonical_sha256":"ec80996f88315b819bd7094ec08c9362812772437e31fd573cd61f488494b166","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec80996f88315b819bd7094ec08c9362812772437e31fd573cd61f488494b166","first_computed_at":"2026-05-18T00:58:57.360003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.360003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VJjSBumocZH8nAtpdRHn/Ykafg35kxAOQkU9+Z0eqYGwuLfLBiW8vNpnmAxMFT3Ks0M9OoUp4MnxssM9sPYpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.360688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05377","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f748a88568463102d3aad9c931a56c9857bc2238f13c50c29b71e31c54f638a","sha256:8ad6a147b8f78671cb429bc19c6844af16380b42058a94a6c9e717a6df459c12"],"state_sha256":"28a137a9bbf3f393e0c8f8411858e4cc524939d1d29cb3b93e24315008b445be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V155uqk2PiYtBG1FqoUqz3H+5y3nB+C9txFAo/7ldsmqrFJUW1e/a8Bme1xTINNJSHE/XcpJlQf3vCzst9LLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:35:36.210874Z","bundle_sha256":"8d1e56d2977a11259867eae59c05fc18e4662b0b47cdd0254d78233778b7cc38"}}