{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ECPZGDUTVH46IETS42SCIQPZME","short_pith_number":"pith:ECPZGDUT","schema_version":"1.0","canonical_sha256":"209f930e93a9f9e41272e6a42441f9611fa58197fd01f759e06325f5f3ddd570","source":{"kind":"arxiv","id":"1504.00629","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.00629","created_at":"2026-05-18T02:19:42.167420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00629v2","created_at":"2026-05-18T02:19:42.167420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00629","created_at":"2026-05-18T02:19:42.167420+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECPZGDUTVH46","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECPZGDUTVH46IETS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECPZGDUT","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/ECPZGDUTVH46IETS42SCIQPZME","json":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME.json","graph_json":"https://pith.science/api/pith-number/ECPZGDUTVH46IETS42SCIQPZME/graph.json","events_json":"https://pith.science/api/pith-number/ECPZGDUTVH46IETS42SCIQPZME/events.json","paper":"https://pith.science/paper/ECPZGDUT"},"agent_actions":{"view_html":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME","download_json":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME.json","view_paper":"https://pith.science/paper/ECPZGDUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00629&json=true","fetch_graph":"https://pith.science/api/pith-number/ECPZGDUTVH46IETS42SCIQPZME/graph.json","fetch_events":"https://pith.science/api/pith-number/ECPZGDUTVH46IETS42SCIQPZME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/action/storage_attestation","attest_author":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/action/author_attestation","sign_citation":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/action/citation_signature","submit_replication":"https://pith.science/pith/ECPZGDUTVH46IETS42SCIQPZME/action/replication_record"}},"created_at":"2026-05-18T02:19:42.167420+00:00","updated_at":"2026-05-18T02:19:42.167420+00:00"}