{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NWATKV5ATGATN4TF27MLVGN6S5","short_pith_number":"pith:NWATKV5A","schema_version":"1.0","canonical_sha256":"6d813557a0998136f265d7d8ba99be9750af4af4407d1fbb1a594ad15e2ac3b7","source":{"kind":"arxiv","id":"1805.01115","version":1},"attestation_state":"computed","paper":{"title":"Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources","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":"2018-05-03T05:02:45Z","abstract_excerpt":"Hypergraphical sources are a natural class of sources for secret key generation, within which different subsets of terminals sharing secrets are allowed to discuss publicly in order to agree upon a global secret key. While their secrecy capacity, i.e., the maximum rate of a secret key that can be agreed upon by the entire set of terminals, is well-understood, what remains open is the maximum rate of a secret key that can be generated when there is a restriction on the overall rate of public discussion allowed. In this work, we obtain a family of explicitly computable upper bounds on the number"},"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":"1805.01115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T05:02:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3863eec3b8d322a2af41c960c38e74263ce7e2ec10d7887c6591c7c3dc2a7235","abstract_canon_sha256":"b047eeb7d2bbe43d6ac1af0fc24fe94cd9d04f1f1d88d6cbd72c2f75ca641da5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:52.516705Z","signature_b64":"0dh43UWZSuYEuqWQgmds+SpNNehWQqvrbD/6XJ39g7AaXEPjFmlNT0Lr1y8rX09z3jESQbAoQO72BGDo+CHzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d813557a0998136f265d7d8ba99be9750af4af4407d1fbb1a594ad15e2ac3b7","last_reissued_at":"2026-05-18T00:16:52.515854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:52.515854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources","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":"2018-05-03T05:02:45Z","abstract_excerpt":"Hypergraphical sources are a natural class of sources for secret key generation, within which different subsets of terminals sharing secrets are allowed to discuss publicly in order to agree upon a global secret key. While their secrecy capacity, i.e., the maximum rate of a secret key that can be agreed upon by the entire set of terminals, is well-understood, what remains open is the maximum rate of a secret key that can be generated when there is a restriction on the overall rate of public discussion allowed. In this work, we obtain a family of explicitly computable upper bounds on the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01115","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.01115","created_at":"2026-05-18T00:16:52.515965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01115v1","created_at":"2026-05-18T00:16:52.515965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01115","created_at":"2026-05-18T00:16:52.515965+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWATKV5ATGAT","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWATKV5ATGATN4TF","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWATKV5A","created_at":"2026-05-18T12:32:40.477152+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/NWATKV5ATGATN4TF27MLVGN6S5","json":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5.json","graph_json":"https://pith.science/api/pith-number/NWATKV5ATGATN4TF27MLVGN6S5/graph.json","events_json":"https://pith.science/api/pith-number/NWATKV5ATGATN4TF27MLVGN6S5/events.json","paper":"https://pith.science/paper/NWATKV5A"},"agent_actions":{"view_html":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5","download_json":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5.json","view_paper":"https://pith.science/paper/NWATKV5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01115&json=true","fetch_graph":"https://pith.science/api/pith-number/NWATKV5ATGATN4TF27MLVGN6S5/graph.json","fetch_events":"https://pith.science/api/pith-number/NWATKV5ATGATN4TF27MLVGN6S5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/action/storage_attestation","attest_author":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/action/author_attestation","sign_citation":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/action/citation_signature","submit_replication":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/action/replication_record"}},"created_at":"2026-05-18T00:16:52.515965+00:00","updated_at":"2026-05-18T00:16:52.515965+00:00"}