{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MVWLILA2MAS2GRQNUU7VSNOGLD","short_pith_number":"pith:MVWLILA2","canonical_record":{"source":{"id":"1210.4482","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T16:37:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"30c769b5df61b7868aa38c51dff27f4479819337bd6bd7a4fcd04bcaf6bb35a0","abstract_canon_sha256":"6b8853de97f689f1949c8164b9232b9f8f728e1eb50682569234662c1e0f2f0d"},"schema_version":"1.0"},"canonical_sha256":"656cb42c1a6025a3460da53f5935c658fd2e0fb105666d2292d87801c97ef616","source":{"kind":"arxiv","id":"1210.4482","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4482","created_at":"2026-05-18T02:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4482v3","created_at":"2026-05-18T02:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4482","created_at":"2026-05-18T02:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"MVWLILA2MAS2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MVWLILA2MAS2GRQN","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MVWLILA2","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MVWLILA2MAS2GRQNUU7VSNOGLD","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4482","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T16:37:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"30c769b5df61b7868aa38c51dff27f4479819337bd6bd7a4fcd04bcaf6bb35a0","abstract_canon_sha256":"6b8853de97f689f1949c8164b9232b9f8f728e1eb50682569234662c1e0f2f0d"},"schema_version":"1.0"},"canonical_sha256":"656cb42c1a6025a3460da53f5935c658fd2e0fb105666d2292d87801c97ef616","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:48.703940Z","signature_b64":"5v9D0F7T83shHxlXP6jgD5TTS5yfKOSpfn0PcGOuKaxygbja2rdciJrXIVN8TsepG3EQgXEuRPwLY9QXznABBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656cb42c1a6025a3460da53f5935c658fd2e0fb105666d2292d87801c97ef616","last_reissued_at":"2026-05-18T02:51:48.703514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:48.703514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4482","source_version":3,"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-18T02:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWiqd1T8MHzrONGOwuzkeTLzT9lgy1ZIcyBlUlZ6GTv10PQR8cvEOlOalfl/7iDelb6npynjZaRy5yHtnbVsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:07:13.207154Z"},"content_sha256":"02168b91c4940c0e8b64ec1087acc2a82c8d9852109b17f4fd89c3bdc2458491","schema_version":"1.0","event_id":"sha256:02168b91c4940c0e8b64ec1087acc2a82c8d9852109b17f4fd89c3bdc2458491"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MVWLILA2MAS2GRQNUU7VSNOGLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Remi A. Chou","submitted_at":"2012-10-16T16:37:58Z","abstract_excerpt":"For a discrete or a continuous source model, we study the problem of secret-key generation with one round of rate-limited public communication between two legitimate users. Although we do not provide new bounds on the wiretap secret-key (WSK) capacity for the discrete source model, we use an alternative achievability scheme that may be useful for practical applications. As a side result, we conveniently extend known bounds to the case of a continuous source model. Specifically, we consider a sequential key-generation strategy, that implements a rate-limited reconciliation step to handle reliab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4482","kind":"arxiv","version":3},"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-18T02:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5IbtZHDOMZ01f608vDLWour00FOSlN/me8pETjx9otP5W1OVJu0KPkGXSMDGopGhF1ST51eR+PDTIv2l3kfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:07:13.207518Z"},"content_sha256":"8c545568fb85c60af8c10c5785be39557f053457d7aadc70b06a6ad9905dbc4b","schema_version":"1.0","event_id":"sha256:8c545568fb85c60af8c10c5785be39557f053457d7aadc70b06a6ad9905dbc4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVWLILA2MAS2GRQNUU7VSNOGLD/bundle.json","state_url":"https://pith.science/pith/MVWLILA2MAS2GRQNUU7VSNOGLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVWLILA2MAS2GRQNUU7VSNOGLD/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-06-02T23:07:13Z","links":{"resolver":"https://pith.science/pith/MVWLILA2MAS2GRQNUU7VSNOGLD","bundle":"https://pith.science/pith/MVWLILA2MAS2GRQNUU7VSNOGLD/bundle.json","state":"https://pith.science/pith/MVWLILA2MAS2GRQNUU7VSNOGLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVWLILA2MAS2GRQNUU7VSNOGLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MVWLILA2MAS2GRQNUU7VSNOGLD","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":"6b8853de97f689f1949c8164b9232b9f8f728e1eb50682569234662c1e0f2f0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T16:37:58Z","title_canon_sha256":"30c769b5df61b7868aa38c51dff27f4479819337bd6bd7a4fcd04bcaf6bb35a0"},"schema_version":"1.0","source":{"id":"1210.4482","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4482","created_at":"2026-05-18T02:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4482v3","created_at":"2026-05-18T02:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4482","created_at":"2026-05-18T02:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"MVWLILA2MAS2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MVWLILA2MAS2GRQN","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MVWLILA2","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:8c545568fb85c60af8c10c5785be39557f053457d7aadc70b06a6ad9905dbc4b","target":"graph","created_at":"2026-05-18T02:51:48Z","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 a discrete or a continuous source model, we study the problem of secret-key generation with one round of rate-limited public communication between two legitimate users. Although we do not provide new bounds on the wiretap secret-key (WSK) capacity for the discrete source model, we use an alternative achievability scheme that may be useful for practical applications. As a side result, we conveniently extend known bounds to the case of a continuous source model. Specifically, we consider a sequential key-generation strategy, that implements a rate-limited reconciliation step to handle reliab","authors_text":"Matthieu R. Bloch, Remi A. Chou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T16:37:58Z","title":"Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4482","kind":"arxiv","version":3},"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:02168b91c4940c0e8b64ec1087acc2a82c8d9852109b17f4fd89c3bdc2458491","target":"record","created_at":"2026-05-18T02:51:48Z","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":"6b8853de97f689f1949c8164b9232b9f8f728e1eb50682569234662c1e0f2f0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T16:37:58Z","title_canon_sha256":"30c769b5df61b7868aa38c51dff27f4479819337bd6bd7a4fcd04bcaf6bb35a0"},"schema_version":"1.0","source":{"id":"1210.4482","kind":"arxiv","version":3}},"canonical_sha256":"656cb42c1a6025a3460da53f5935c658fd2e0fb105666d2292d87801c97ef616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"656cb42c1a6025a3460da53f5935c658fd2e0fb105666d2292d87801c97ef616","first_computed_at":"2026-05-18T02:51:48.703514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:48.703514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5v9D0F7T83shHxlXP6jgD5TTS5yfKOSpfn0PcGOuKaxygbja2rdciJrXIVN8TsepG3EQgXEuRPwLY9QXznABBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:48.703940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4482","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02168b91c4940c0e8b64ec1087acc2a82c8d9852109b17f4fd89c3bdc2458491","sha256:8c545568fb85c60af8c10c5785be39557f053457d7aadc70b06a6ad9905dbc4b"],"state_sha256":"b7735793f9f7ce0df0c5862e01cf31890a1dc4ddf35e715a2dca4cbad7ee46d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGrokoFX0ywtrNSGvnvJOnmb+Aq7mer+AHM8JJ1tyakyZfTNXIITYVQNoUlj1dDsUopHjETENnGesxGiq++AAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:07:13.209805Z","bundle_sha256":"5d68921cc0d8e77f704c49eecc77ff473bd96f3103daa74866be49bfe2537a82"}}