{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FR6N7I47L3FDNEIACNK42KU37O","short_pith_number":"pith:FR6N7I47","canonical_record":{"source":{"id":"1701.05008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T11:02:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03b6e469010c6e72021fd8ae6a6781e868cb70e7f6d3193abcecdc68fbc7b2f0","abstract_canon_sha256":"56c215e3357fd61173bac1581056b05e60181665b8e975fc6db719a95375d611"},"schema_version":"1.0"},"canonical_sha256":"2c7cdfa39f5eca3691001355cd2a9bfbb6174cebeaa2fa64feb073399a0022c4","source":{"kind":"arxiv","id":"1701.05008","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05008","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05008v2","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05008","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"FR6N7I47L3FD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FR6N7I47L3FDNEIA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FR6N7I47","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FR6N7I47L3FDNEIACNK42KU37O","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T11:02:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03b6e469010c6e72021fd8ae6a6781e868cb70e7f6d3193abcecdc68fbc7b2f0","abstract_canon_sha256":"56c215e3357fd61173bac1581056b05e60181665b8e975fc6db719a95375d611"},"schema_version":"1.0"},"canonical_sha256":"2c7cdfa39f5eca3691001355cd2a9bfbb6174cebeaa2fa64feb073399a0022c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.559970Z","signature_b64":"HdlSlobyvFTLw0PrUYbL8wxxRVes6xJJMmE1HHToJ/LWNqgoxNod0A3zAjDTWAixcpyvTGubg26U/hh9fBHzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c7cdfa39f5eca3691001355cd2a9bfbb6174cebeaa2fa64feb073399a0022c4","last_reissued_at":"2026-05-18T00:52:30.559607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.559607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05008","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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1GJvz2ZKA5wbzh6p51pGOk8qzoAygY4JoWw2x6hQWX1dguddFf0mR4ncJcr56bInPNIgtL/sA7dGHAQQ/hgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:02:25.142449Z"},"content_sha256":"11fad25bf5fbba97b56d7d731e77c383e955dd85d6de725b6772674e4277f3d9","schema_version":"1.0","event_id":"sha256:11fad25bf5fbba97b56d7d731e77c383e955dd85d6de725b6772674e4277f3d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FR6N7I47L3FDNEIACNK42KU37O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secret Key Agreement under Discussion Rate Constraints","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":"2017-01-18T11:02:27Z","abstract_excerpt":"For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source model without helpers or wiretapper's side information but can be strengthened for hypergraphical sources. In particular, for the pairwise independent network, the results give rise to a complete characterization of the maximum secret key rate achievable under a constraint on the total discussion rate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05008","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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJ6TYP5ReXEcVeHTie6OzWegQEqPh7izlHlCZxZ+JO1enNhiC0YgEb3Tu5ofuwnWmeVJ1NMMNd1f4vdraibbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:02:25.143146Z"},"content_sha256":"87e72c3838fec6b55bf21b124656ef02412a3d8871d69d2e77edfa72c334e7fe","schema_version":"1.0","event_id":"sha256:87e72c3838fec6b55bf21b124656ef02412a3d8871d69d2e77edfa72c334e7fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FR6N7I47L3FDNEIACNK42KU37O/bundle.json","state_url":"https://pith.science/pith/FR6N7I47L3FDNEIACNK42KU37O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FR6N7I47L3FDNEIACNK42KU37O/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-26T10:02:25Z","links":{"resolver":"https://pith.science/pith/FR6N7I47L3FDNEIACNK42KU37O","bundle":"https://pith.science/pith/FR6N7I47L3FDNEIACNK42KU37O/bundle.json","state":"https://pith.science/pith/FR6N7I47L3FDNEIACNK42KU37O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FR6N7I47L3FDNEIACNK42KU37O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FR6N7I47L3FDNEIACNK42KU37O","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":"56c215e3357fd61173bac1581056b05e60181665b8e975fc6db719a95375d611","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T11:02:27Z","title_canon_sha256":"03b6e469010c6e72021fd8ae6a6781e868cb70e7f6d3193abcecdc68fbc7b2f0"},"schema_version":"1.0","source":{"id":"1701.05008","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05008","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05008v2","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05008","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"FR6N7I47L3FD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FR6N7I47L3FDNEIA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FR6N7I47","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:87e72c3838fec6b55bf21b124656ef02412a3d8871d69d2e77edfa72c334e7fe","target":"graph","created_at":"2026-05-18T00:52:30Z","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":"For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source model without helpers or wiretapper's side information but can be strengthened for hypergraphical sources. In particular, for the pairwise independent network, the results give rise to a complete characterization of the maximum secret key rate achievable under a constraint on the total discussion rate.","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":"2017-01-18T11:02:27Z","title":"Secret Key Agreement under Discussion Rate Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05008","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:11fad25bf5fbba97b56d7d731e77c383e955dd85d6de725b6772674e4277f3d9","target":"record","created_at":"2026-05-18T00:52:30Z","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":"56c215e3357fd61173bac1581056b05e60181665b8e975fc6db719a95375d611","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T11:02:27Z","title_canon_sha256":"03b6e469010c6e72021fd8ae6a6781e868cb70e7f6d3193abcecdc68fbc7b2f0"},"schema_version":"1.0","source":{"id":"1701.05008","kind":"arxiv","version":2}},"canonical_sha256":"2c7cdfa39f5eca3691001355cd2a9bfbb6174cebeaa2fa64feb073399a0022c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c7cdfa39f5eca3691001355cd2a9bfbb6174cebeaa2fa64feb073399a0022c4","first_computed_at":"2026-05-18T00:52:30.559607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:30.559607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HdlSlobyvFTLw0PrUYbL8wxxRVes6xJJMmE1HHToJ/LWNqgoxNod0A3zAjDTWAixcpyvTGubg26U/hh9fBHzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:30.559970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05008","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11fad25bf5fbba97b56d7d731e77c383e955dd85d6de725b6772674e4277f3d9","sha256:87e72c3838fec6b55bf21b124656ef02412a3d8871d69d2e77edfa72c334e7fe"],"state_sha256":"3d44994fc0bb8e8d85ca8e155773450318496a32187f1093bf4880dedc8bf541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSdk7nkTmDyCPcWFwoCKoEjZ1LIaelTDQ18oQlepIJVWYPatChCg/YOP0p+2HjLG9lrRX7dipccSzezDzSweBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:02:25.146717Z","bundle_sha256":"cfa8b6880081cfb2fed6bd7a59c3ccaf33fd7343febc82711b239d1b52470924"}}