{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NWATKV5ATGATN4TF27MLVGN6S5","short_pith_number":"pith:NWATKV5A","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"},"canonical_sha256":"6d813557a0998136f265d7d8ba99be9750af4af4407d1fbb1a594ad15e2ac3b7","source":{"kind":"arxiv","id":"1805.01115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01115","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01115v1","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01115","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"NWATKV5ATGAT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NWATKV5ATGATN4TF","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NWATKV5A","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NWATKV5ATGATN4TF27MLVGN6S5","target":"record","payload":{"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"},"canonical_sha256":"6d813557a0998136f265d7d8ba99be9750af4af4407d1fbb1a594ad15e2ac3b7","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"},"source_kind":"arxiv","source_id":"1805.01115","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:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6mdHFIYO11jyVTLeh8+G2KCwzDcableNo2+z9lypCkkvcRLyErIp1SFInFeqruMnvq/u8RvtrhmWP0kgV6b7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:14:45.199727Z"},"content_sha256":"261def5a39ff5b8e66d34b6d6e2a9bc9210360729446d33f40fd71068e39f6d5","schema_version":"1.0","event_id":"sha256:261def5a39ff5b8e66d34b6d6e2a9bc9210360729446d33f40fd71068e39f6d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NWATKV5ATGATN4TF27MLVGN6S5","target":"graph","payload":{"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"},"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:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXab/C/Lk6R46WMEAq/zFJKIbSk6xaHNmLxSh3FsLE8vNVrgti0ZWSXrJNQpQCh46K9XaF4B/d1+H4Ym3vrGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:14:45.200387Z"},"content_sha256":"fcd6f545cf24112e346b7d3f0235c99901ab143d292a332d55b93a20262495ee","schema_version":"1.0","event_id":"sha256:fcd6f545cf24112e346b7d3f0235c99901ab143d292a332d55b93a20262495ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/bundle.json","state_url":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWATKV5ATGATN4TF27MLVGN6S5/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-26T14:14:45Z","links":{"resolver":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5","bundle":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/bundle.json","state":"https://pith.science/pith/NWATKV5ATGATN4TF27MLVGN6S5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWATKV5ATGATN4TF27MLVGN6S5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NWATKV5ATGATN4TF27MLVGN6S5","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":"b047eeb7d2bbe43d6ac1af0fc24fe94cd9d04f1f1d88d6cbd72c2f75ca641da5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T05:02:45Z","title_canon_sha256":"3863eec3b8d322a2af41c960c38e74263ce7e2ec10d7887c6591c7c3dc2a7235"},"schema_version":"1.0","source":{"id":"1805.01115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01115","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01115v1","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01115","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"NWATKV5ATGAT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NWATKV5ATGATN4TF","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NWATKV5A","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:fcd6f545cf24112e346b7d3f0235c99901ab143d292a332d55b93a20262495ee","target":"graph","created_at":"2026-05-18T00:16:52Z","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":"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","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":"2018-05-03T05:02:45Z","title":"Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01115","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:261def5a39ff5b8e66d34b6d6e2a9bc9210360729446d33f40fd71068e39f6d5","target":"record","created_at":"2026-05-18T00:16:52Z","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":"b047eeb7d2bbe43d6ac1af0fc24fe94cd9d04f1f1d88d6cbd72c2f75ca641da5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T05:02:45Z","title_canon_sha256":"3863eec3b8d322a2af41c960c38e74263ce7e2ec10d7887c6591c7c3dc2a7235"},"schema_version":"1.0","source":{"id":"1805.01115","kind":"arxiv","version":1}},"canonical_sha256":"6d813557a0998136f265d7d8ba99be9750af4af4407d1fbb1a594ad15e2ac3b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d813557a0998136f265d7d8ba99be9750af4af4407d1fbb1a594ad15e2ac3b7","first_computed_at":"2026-05-18T00:16:52.515854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:52.515854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0dh43UWZSuYEuqWQgmds+SpNNehWQqvrbD/6XJ39g7AaXEPjFmlNT0Lr1y8rX09z3jESQbAoQO72BGDo+CHzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:52.516705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:261def5a39ff5b8e66d34b6d6e2a9bc9210360729446d33f40fd71068e39f6d5","sha256:fcd6f545cf24112e346b7d3f0235c99901ab143d292a332d55b93a20262495ee"],"state_sha256":"174ee36f7aa3bf6dabbe3ef19a1c401bf791ab3b47ae7cc10fd40c24212c1141"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6ayun93YyOo+FjzxTWgpzx97Dsfovw3z9h0uUcUK+UZmoLS6qKwh2YFBrWqpzNgMVjxG/2jzPetFIqir21qCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:14:45.203705Z","bundle_sha256":"f2dc4bd8f7769526be474c755a8bcb1ca91952d1275753ed53f917e5a005c986"}}