{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JTH3ROB3HPKKGGCNIGX44UBU5S","short_pith_number":"pith:JTH3ROB3","canonical_record":{"source":{"id":"1706.04295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T02:16:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e4a7f273250ac4ddae27f7b1a6209bbc60fd8e856199d846e906a3852397d4b","abstract_canon_sha256":"b4ea9abb0959c50a3e28cdeedbc913ef8898d1d4bdc112404448b025c6f9bb65"},"schema_version":"1.0"},"canonical_sha256":"4ccfb8b83b3bd4a3184d41afce5034ec9eb521934e337290e0b210f9565ff759","source":{"kind":"arxiv","id":"1706.04295","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04295","created_at":"2026-05-18T00:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04295v2","created_at":"2026-05-18T00:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04295","created_at":"2026-05-18T00:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"JTH3ROB3HPKK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JTH3ROB3HPKKGGCN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JTH3ROB3","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JTH3ROB3HPKKGGCNIGX44UBU5S","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T02:16:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e4a7f273250ac4ddae27f7b1a6209bbc60fd8e856199d846e906a3852397d4b","abstract_canon_sha256":"b4ea9abb0959c50a3e28cdeedbc913ef8898d1d4bdc112404448b025c6f9bb65"},"schema_version":"1.0"},"canonical_sha256":"4ccfb8b83b3bd4a3184d41afce5034ec9eb521934e337290e0b210f9565ff759","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:03.854802Z","signature_b64":"VHMhyfvJsSxbyEvnFHXiqMGX3RFrsahh/IsGREQE1xosUMN0EZYaKfOC+LHctcu7esYVzA6SV6leBMMo8zh2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ccfb8b83b3bd4a3184d41afce5034ec9eb521934e337290e0b210f9565ff759","last_reissued_at":"2026-05-18T00:30:03.854255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:03.854255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04295","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:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0lRYbt4akFRYZipYi+RnpDfYP/3WIZdBr6LsK5PiCbROwo0WOB1FLbi8jBtVCcXggyuesW1fJYTZA8ZaxtUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:29:12.565879Z"},"content_sha256":"1bcc376720ccab3d8fb22237dd58a3bc79823a63ca957c15ca85a6f8dedd72b9","schema_version":"1.0","event_id":"sha256:1bcc376720ccab3d8fb22237dd58a3bc79823a63ca957c15ca85a6f8dedd72b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JTH3ROB3HPKKGGCNIGX44UBU5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information Per Bit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung Chan","submitted_at":"2017-06-14T02:16:16Z","abstract_excerpt":"The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components for generating a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy of the compressed sources. Since the maximum achievable key rate captures the total amount of information mutual to the compressed sources, an optimal compression scheme essentially maximizes the multivariate m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04295","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:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4B3j614aJewROSW29DJ0Dve9iGcJ8uGMQVq0YLkZrfZpwod5u/KJVMAB1YH3GEZ9iJ6KdEHjD7LwV0bx+7YaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:29:12.566601Z"},"content_sha256":"c605b6b2ce5639be5eaee8d56303fa4d50ee13837e35c1ca25bac6845a172421","schema_version":"1.0","event_id":"sha256:c605b6b2ce5639be5eaee8d56303fa4d50ee13837e35c1ca25bac6845a172421"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTH3ROB3HPKKGGCNIGX44UBU5S/bundle.json","state_url":"https://pith.science/pith/JTH3ROB3HPKKGGCNIGX44UBU5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTH3ROB3HPKKGGCNIGX44UBU5S/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-26T20:29:12Z","links":{"resolver":"https://pith.science/pith/JTH3ROB3HPKKGGCNIGX44UBU5S","bundle":"https://pith.science/pith/JTH3ROB3HPKKGGCNIGX44UBU5S/bundle.json","state":"https://pith.science/pith/JTH3ROB3HPKKGGCNIGX44UBU5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTH3ROB3HPKKGGCNIGX44UBU5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JTH3ROB3HPKKGGCNIGX44UBU5S","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":"b4ea9abb0959c50a3e28cdeedbc913ef8898d1d4bdc112404448b025c6f9bb65","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T02:16:16Z","title_canon_sha256":"8e4a7f273250ac4ddae27f7b1a6209bbc60fd8e856199d846e906a3852397d4b"},"schema_version":"1.0","source":{"id":"1706.04295","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04295","created_at":"2026-05-18T00:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04295v2","created_at":"2026-05-18T00:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04295","created_at":"2026-05-18T00:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"JTH3ROB3HPKK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JTH3ROB3HPKKGGCN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JTH3ROB3","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:c605b6b2ce5639be5eaee8d56303fa4d50ee13837e35c1ca25bac6845a172421","target":"graph","created_at":"2026-05-18T00:30:03Z","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 multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components for generating a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy of the compressed sources. Since the maximum achievable key rate captures the total amount of information mutual to the compressed sources, an optimal compression scheme essentially maximizes the multivariate m","authors_text":"Chung Chan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T02:16:16Z","title":"Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information Per Bit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04295","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:1bcc376720ccab3d8fb22237dd58a3bc79823a63ca957c15ca85a6f8dedd72b9","target":"record","created_at":"2026-05-18T00:30:03Z","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":"b4ea9abb0959c50a3e28cdeedbc913ef8898d1d4bdc112404448b025c6f9bb65","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T02:16:16Z","title_canon_sha256":"8e4a7f273250ac4ddae27f7b1a6209bbc60fd8e856199d846e906a3852397d4b"},"schema_version":"1.0","source":{"id":"1706.04295","kind":"arxiv","version":2}},"canonical_sha256":"4ccfb8b83b3bd4a3184d41afce5034ec9eb521934e337290e0b210f9565ff759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ccfb8b83b3bd4a3184d41afce5034ec9eb521934e337290e0b210f9565ff759","first_computed_at":"2026-05-18T00:30:03.854255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:03.854255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VHMhyfvJsSxbyEvnFHXiqMGX3RFrsahh/IsGREQE1xosUMN0EZYaKfOC+LHctcu7esYVzA6SV6leBMMo8zh2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:03.854802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04295","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bcc376720ccab3d8fb22237dd58a3bc79823a63ca957c15ca85a6f8dedd72b9","sha256:c605b6b2ce5639be5eaee8d56303fa4d50ee13837e35c1ca25bac6845a172421"],"state_sha256":"99e25d71eaa08d5ff3ef48968da44857a6deacf9f5c5525463ed2f788e01b2cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfpnU4joqI4fSqYGz6fU+hd/2+3M/NAvB/pJH3MSuixOsFt9zmcZm7ihZy2AURGD9n58A934lKUcnlJmiSjhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:29:12.570200Z","bundle_sha256":"f9cf7fce9f83201d97f10faf685460ef127fb6973bf9e2f8348fd7c6fc32ea6e"}}