{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ECPZGDUTVH46IETS42SCIQPZME","short_pith_number":"pith:ECPZGDUT","canonical_record":{"source":{"id":"1504.00629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T18:09:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4107a28f7427e611f4d9bd2f0767c0e904ce72af9a8c5a02d554d35ad105aea9","abstract_canon_sha256":"181effb38b1854b5993b20dce0e843bb7dce15b9e661718cdc41177674357844"},"schema_version":"1.0"},"canonical_sha256":"209f930e93a9f9e41272e6a42441f9611fa58197fd01f759e06325f5f3ddd570","source":{"kind":"arxiv","id":"1504.00629","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00629v2","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"ECPZGDUTVH46","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ECPZGDUTVH46IETS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ECPZGDUT","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ECPZGDUTVH46IETS42SCIQPZME","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T18:09:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4107a28f7427e611f4d9bd2f0767c0e904ce72af9a8c5a02d554d35ad105aea9","abstract_canon_sha256":"181effb38b1854b5993b20dce0e843bb7dce15b9e661718cdc41177674357844"},"schema_version":"1.0"},"canonical_sha256":"209f930e93a9f9e41272e6a42441f9611fa58197fd01f759e06325f5f3ddd570","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:42.167790Z","signature_b64":"ruSuVV/cjMhHOKHpTPxvJitAf7SW1Fotp1/CVSc5QlrLp7iTOkMMJOcYm+XYe/aB2cj74s8xCnrlV6HSYHSrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"209f930e93a9f9e41272e6a42441f9611fa58197fd01f759e06325f5f3ddd570","last_reissued_at":"2026-05-18T02:19:42.167361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:42.167361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00629","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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+HaEM8ovsKqpuwWCBC3svaxNi/S5PlMYUzybOYzwZUHMeCE2MW3z561g9aTZfe2yxA0uWY6kIems6qtmFQjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:48:35.469230Z"},"content_sha256":"efadf29652d57557b1bd08e6659f323e590b003203d68f0c215a4a1b5e4109a7","schema_version":"1.0","event_id":"sha256:efadf29652d57557b1bd08e6659f323e590b003203d68f0c215a4a1b5e4109a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ECPZGDUTVH46IETS42SCIQPZME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The communication complexity of achieving SK capacity in a class of PIN models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Manuj Mukherjee, Navin Kashyap","submitted_at":"2015-04-02T18:09:49Z","abstract_excerpt":"The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csisz$\\'a$r and Narayan is the minimum rate of public communication required 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 the communication complexity, denoted by $R_{\\text{SK}}$. A source model for which this upper bound is tight is called $R_{\\text{SK}}$-maximal. In this paper, we establish a sufficient condition for $R_{\\text{SK}}$-maximality within the class of pairwise independent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00629","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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Xw6KYgFKgA6g/6BqmIJDg/tl2XRe3cTHcmULQrh03msrrSoEh2f6lu9gePqML4b8wJFCC4Pr4aDB0vyHJyFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:48:35.469912Z"},"content_sha256":"ce09ab5088c3721390e9863734c3d5cd9a0efbc2a380c47a326d1c2a571cb96c","schema_version":"1.0","event_id":"sha256:ce09ab5088c3721390e9863734c3d5cd9a0efbc2a380c47a326d1c2a571cb96c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/bundle.json","state_url":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECPZGDUTVH46IETS42SCIQPZME/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-27T02:48:35Z","links":{"resolver":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME","bundle":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/bundle.json","state":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECPZGDUTVH46IETS42SCIQPZME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ECPZGDUTVH46IETS42SCIQPZME","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":"181effb38b1854b5993b20dce0e843bb7dce15b9e661718cdc41177674357844","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T18:09:49Z","title_canon_sha256":"4107a28f7427e611f4d9bd2f0767c0e904ce72af9a8c5a02d554d35ad105aea9"},"schema_version":"1.0","source":{"id":"1504.00629","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00629v2","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"ECPZGDUTVH46","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ECPZGDUTVH46IETS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ECPZGDUT","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:ce09ab5088c3721390e9863734c3d5cd9a0efbc2a380c47a326d1c2a571cb96c","target":"graph","created_at":"2026-05-18T02:19:42Z","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 communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csisz$\\'a$r and Narayan is the minimum rate of public communication required 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 the communication complexity, denoted by $R_{\\text{SK}}$. A source model for which this upper bound is tight is called $R_{\\text{SK}}$-maximal. In this paper, we establish a sufficient condition for $R_{\\text{SK}}$-maximality within the class of pairwise independent","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":"2015-04-02T18:09:49Z","title":"The communication complexity of achieving SK capacity in a class of PIN models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00629","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:efadf29652d57557b1bd08e6659f323e590b003203d68f0c215a4a1b5e4109a7","target":"record","created_at":"2026-05-18T02:19:42Z","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":"181effb38b1854b5993b20dce0e843bb7dce15b9e661718cdc41177674357844","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T18:09:49Z","title_canon_sha256":"4107a28f7427e611f4d9bd2f0767c0e904ce72af9a8c5a02d554d35ad105aea9"},"schema_version":"1.0","source":{"id":"1504.00629","kind":"arxiv","version":2}},"canonical_sha256":"209f930e93a9f9e41272e6a42441f9611fa58197fd01f759e06325f5f3ddd570","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"209f930e93a9f9e41272e6a42441f9611fa58197fd01f759e06325f5f3ddd570","first_computed_at":"2026-05-18T02:19:42.167361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:42.167361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ruSuVV/cjMhHOKHpTPxvJitAf7SW1Fotp1/CVSc5QlrLp7iTOkMMJOcYm+XYe/aB2cj74s8xCnrlV6HSYHSrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:42.167790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00629","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efadf29652d57557b1bd08e6659f323e590b003203d68f0c215a4a1b5e4109a7","sha256:ce09ab5088c3721390e9863734c3d5cd9a0efbc2a380c47a326d1c2a571cb96c"],"state_sha256":"bcb70b7f95a02441cd863332bb153cd038cb7fd34873d731a18cec5126ab6b7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9wLiHbQ10vmisEWaGD4Za6YKiBTa4xYvL2AVepVpm4R2m3oRWULRWFYRSB3s7cy85YGCgKdmGNOTmbedTGDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:48:35.473394Z","bundle_sha256":"3356694a06c9b463131d4800ff8d36b3e63d74bc23c4459832c1bae9dc45eca0"}}