{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:L5CTXCBT2COUFHEAP3HLBKQRSQ","short_pith_number":"pith:L5CTXCBT","canonical_record":{"source":{"id":"1305.4746","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-21T08:04:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34ca84d4f0be72342c571b9c99e7bf0a71d85bd68bc531192988f0a26fe61995","abstract_canon_sha256":"e3a47af030821f3e1194e014807d14b0f07c47bb4dd2ed5d5e028d9e53c40f03"},"schema_version":"1.0"},"canonical_sha256":"5f453b8833d09d429c807eceb0aa11940db28f139ca4309dbed6de2320200d63","source":{"kind":"arxiv","id":"1305.4746","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4746","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4746v4","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4746","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"L5CTXCBT2COU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L5CTXCBT2COUFHEA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L5CTXCBT","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:L5CTXCBT2COUFHEAP3HLBKQRSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4746","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-21T08:04:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34ca84d4f0be72342c571b9c99e7bf0a71d85bd68bc531192988f0a26fe61995","abstract_canon_sha256":"e3a47af030821f3e1194e014807d14b0f07c47bb4dd2ed5d5e028d9e53c40f03"},"schema_version":"1.0"},"canonical_sha256":"5f453b8833d09d429c807eceb0aa11940db28f139ca4309dbed6de2320200d63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:43.758288Z","signature_b64":"jrpPvE29Z/scWCbuSwwJCmAG88yeRR3a0Pkg1HOFBEMDvDtMYgBEAot/UFMIlp2r8K2dg9v1H0R3Ge6tuH5nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f453b8833d09d429c807eceb0aa11940db28f139ca4309dbed6de2320200d63","last_reissued_at":"2026-05-18T01:35:43.757927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:43.757927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4746","source_version":4,"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-18T01:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuTdxLNQXe6abNioemh9dY3AlgFxCUjbLISDlo2535tGVgNBM7vWTDaFTJyPKXNlCd8YbIYO/fHILGqddN5yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:52.537586Z"},"content_sha256":"1a4f3cbefd4325fe3ee2f0bc41e83fe5d71b227dfa4ff847183248a24830c3c7","schema_version":"1.0","event_id":"sha256:1a4f3cbefd4325fe3ee2f0bc41e83fe5d71b227dfa4ff847183248a24830c3c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:L5CTXCBT2COUFHEAP3HLBKQRSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar Coding for Secret-Key Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe, Matthieu R. Bloch, Remi A. Chou","submitted_at":"2013-05-21T08:04:11Z","abstract_excerpt":"Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and privacy amplification. In this paper, we propose an alternative approach based on polar codes that jointly deals with reliability and secrecy. Specifically, we propose secret-key capacity-achieving polar coding schemes for the following models: (i) the degraded binary memoryless source (DBMS) model with rate-unlimited public communication, (ii) the DBMS model with one-way rate-limited public communication, (iii) the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4746","kind":"arxiv","version":4},"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-18T01:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APY4rRYe99b/ePb0IY+uXGN5QNf9avdPKgdHEJVteKlRcc5NwAaUuplBCXicoQccnICgWgnpOTJ5eTFALPPHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:52.537931Z"},"content_sha256":"8c211a00c2f23f8fc1f7b836f5acb1510e699b417751098acd032d8023445f15","schema_version":"1.0","event_id":"sha256:8c211a00c2f23f8fc1f7b836f5acb1510e699b417751098acd032d8023445f15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5CTXCBT2COUFHEAP3HLBKQRSQ/bundle.json","state_url":"https://pith.science/pith/L5CTXCBT2COUFHEAP3HLBKQRSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5CTXCBT2COUFHEAP3HLBKQRSQ/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-03T01:31:52Z","links":{"resolver":"https://pith.science/pith/L5CTXCBT2COUFHEAP3HLBKQRSQ","bundle":"https://pith.science/pith/L5CTXCBT2COUFHEAP3HLBKQRSQ/bundle.json","state":"https://pith.science/pith/L5CTXCBT2COUFHEAP3HLBKQRSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5CTXCBT2COUFHEAP3HLBKQRSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:L5CTXCBT2COUFHEAP3HLBKQRSQ","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":"e3a47af030821f3e1194e014807d14b0f07c47bb4dd2ed5d5e028d9e53c40f03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-21T08:04:11Z","title_canon_sha256":"34ca84d4f0be72342c571b9c99e7bf0a71d85bd68bc531192988f0a26fe61995"},"schema_version":"1.0","source":{"id":"1305.4746","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4746","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4746v4","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4746","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"L5CTXCBT2COU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L5CTXCBT2COUFHEA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L5CTXCBT","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:8c211a00c2f23f8fc1f7b836f5acb1510e699b417751098acd032d8023445f15","target":"graph","created_at":"2026-05-18T01:35:43Z","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":"Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and privacy amplification. In this paper, we propose an alternative approach based on polar codes that jointly deals with reliability and secrecy. Specifically, we propose secret-key capacity-achieving polar coding schemes for the following models: (i) the degraded binary memoryless source (DBMS) model with rate-unlimited public communication, (ii) the DBMS model with one-way rate-limited public communication, (iii) the","authors_text":"Emmanuel Abbe, 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":"2013-05-21T08:04:11Z","title":"Polar Coding for Secret-Key Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4746","kind":"arxiv","version":4},"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:1a4f3cbefd4325fe3ee2f0bc41e83fe5d71b227dfa4ff847183248a24830c3c7","target":"record","created_at":"2026-05-18T01:35:43Z","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":"e3a47af030821f3e1194e014807d14b0f07c47bb4dd2ed5d5e028d9e53c40f03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-21T08:04:11Z","title_canon_sha256":"34ca84d4f0be72342c571b9c99e7bf0a71d85bd68bc531192988f0a26fe61995"},"schema_version":"1.0","source":{"id":"1305.4746","kind":"arxiv","version":4}},"canonical_sha256":"5f453b8833d09d429c807eceb0aa11940db28f139ca4309dbed6de2320200d63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f453b8833d09d429c807eceb0aa11940db28f139ca4309dbed6de2320200d63","first_computed_at":"2026-05-18T01:35:43.757927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:43.757927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jrpPvE29Z/scWCbuSwwJCmAG88yeRR3a0Pkg1HOFBEMDvDtMYgBEAot/UFMIlp2r8K2dg9v1H0R3Ge6tuH5nDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:43.758288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4746","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a4f3cbefd4325fe3ee2f0bc41e83fe5d71b227dfa4ff847183248a24830c3c7","sha256:8c211a00c2f23f8fc1f7b836f5acb1510e699b417751098acd032d8023445f15"],"state_sha256":"c54f0b8d38ec1c657db49e2e0e5310ae713d5530832513090f9bb700bf7cdae8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wUKEJtqk7zdLlcbOCGCb6d7Pqf/1MYeRq0BFVOj6lDs/jYn3+P1powjVdUaBssJDYAyWIaiJc6UBcxTxz+6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:31:52.540908Z","bundle_sha256":"0d319e8c121b44b60c5502651eac795aa30ea0dbc8fb55bc450927b5b8889c32"}}