{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FOHP4MMLCMDSM466L6BTZYIB67","short_pith_number":"pith:FOHP4MML","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"},"canonical_sha256":"2b8efe318b13072673de5f833ce101f7ca92a77ee2dc12c0145c13f83c29e85a","source":{"kind":"arxiv","id":"1507.02874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02874","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02874v1","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02874","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"FOHP4MMLCMDS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FOHP4MMLCMDSM466","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FOHP4MML","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FOHP4MMLCMDSM466L6BTZYIB67","target":"record","payload":{"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"},"canonical_sha256":"2b8efe318b13072673de5f833ce101f7ca92a77ee2dc12c0145c13f83c29e85a","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"},"source_kind":"arxiv","source_id":"1507.02874","source_version":1,"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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8fEE0eSAUfVEbcCT3YcaU+E4ruPzMpvFnJmhH7R6ULcxPGGiSTTG3nsHARpp/wlD+Y/v5VdxnLj8XnMBZtdrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:16.159861Z"},"content_sha256":"02375d392bdd83ae7b33511ed06e135c3143440303792e4b1e2fca7ecb781650","schema_version":"1.0","event_id":"sha256:02375d392bdd83ae7b33511ed06e135c3143440303792e4b1e2fca7ecb781650"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FOHP4MMLCMDSM466L6BTZYIB67","target":"graph","payload":{"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"},"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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHH9nD7kmd2AOz9ZP+Im2qvO1Tth+n73wUt3zQF/+CJIWcpdBYooit19Eoj3GDoTTWoSAWZw5BtlUFVHMFHRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:16.160300Z"},"content_sha256":"b891776d631c253c8a3b0d13f22c6b19041f6ce1fa823d10b175b5aba2a4b694","schema_version":"1.0","event_id":"sha256:b891776d631c253c8a3b0d13f22c6b19041f6ce1fa823d10b175b5aba2a4b694"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/bundle.json","state_url":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOHP4MMLCMDSM466L6BTZYIB67/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-26T17:39:16Z","links":{"resolver":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67","bundle":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/bundle.json","state":"https://pith.science/pith/FOHP4MMLCMDSM466L6BTZYIB67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOHP4MMLCMDSM466L6BTZYIB67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FOHP4MMLCMDSM466L6BTZYIB67","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":"cf88e81f93b12e95871dc01f2810597e4c23fefa6db6a410e42037c725718251","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T12:31:45Z","title_canon_sha256":"9d8d95d45025111859ae8e22925c81c6ebccf679df75d7cbc13d4b80ef1f5397"},"schema_version":"1.0","source":{"id":"1507.02874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02874","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02874v1","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02874","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"FOHP4MMLCMDS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FOHP4MMLCMDSM466","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FOHP4MML","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:b891776d631c253c8a3b0d13f22c6b19041f6ce1fa823d10b175b5aba2a4b694","target":"graph","created_at":"2026-05-18T00:58:10Z","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":"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)","authors_text":"Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T12:31:45Z","title":"On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02874","kind":"arxiv","version":1},"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:02375d392bdd83ae7b33511ed06e135c3143440303792e4b1e2fca7ecb781650","target":"record","created_at":"2026-05-18T00:58:10Z","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":"cf88e81f93b12e95871dc01f2810597e4c23fefa6db6a410e42037c725718251","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T12:31:45Z","title_canon_sha256":"9d8d95d45025111859ae8e22925c81c6ebccf679df75d7cbc13d4b80ef1f5397"},"schema_version":"1.0","source":{"id":"1507.02874","kind":"arxiv","version":1}},"canonical_sha256":"2b8efe318b13072673de5f833ce101f7ca92a77ee2dc12c0145c13f83c29e85a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b8efe318b13072673de5f833ce101f7ca92a77ee2dc12c0145c13f83c29e85a","first_computed_at":"2026-05-18T00:58:10.590205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:10.590205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o/t8M6D9SBYm4EC2iNCzQUSs3rbt+qkD3mxR3BZNs4Ak/pY9Xs2KEXiwhIrtJ9NcjYDtBhiytPWVvm/05twtCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:10.591103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02375d392bdd83ae7b33511ed06e135c3143440303792e4b1e2fca7ecb781650","sha256:b891776d631c253c8a3b0d13f22c6b19041f6ce1fa823d10b175b5aba2a4b694"],"state_sha256":"beb05b4e3a08e4c21686435e6dfe1402ae512b915cafa7844a603284723c48bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zAdv3C+SUlmWIVilNzBpqzmGtnW7O8rgKMbnqTU/5guf5KQOPsCxPXETaUvYcXWACd5RY/+GyUn6wum76EVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:39:16.163201Z","bundle_sha256":"f06d1868d54bd72f40d31bfcf1c2f9d598b7ee322bee8d83ca22f6f31b9ab39c"}}