{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:XWM6F3PEXW5TPQEGJAADOCTVCX","short_pith_number":"pith:XWM6F3PE","canonical_record":{"source":{"id":"0903.4014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-24T05:29:04Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"8ed9f0894de7a265e17bb8decd1515f12139dc9972158373628000150e616084","abstract_canon_sha256":"2137cfb8d52f02e1576da6af956fc4630aa869fdbf662d1d7e76647bccc4d321"},"schema_version":"1.0"},"canonical_sha256":"bd99e2ede4bdbb37c0864800370a7515e6902acbf6932f528bb7edf54d40a45a","source":{"kind":"arxiv","id":"0903.4014","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4014","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4014v2","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4014","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"XWM6F3PEXW5T","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XWM6F3PEXW5TPQEG","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XWM6F3PE","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:XWM6F3PEXW5TPQEGJAADOCTVCX","target":"record","payload":{"canonical_record":{"source":{"id":"0903.4014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-24T05:29:04Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"8ed9f0894de7a265e17bb8decd1515f12139dc9972158373628000150e616084","abstract_canon_sha256":"2137cfb8d52f02e1576da6af956fc4630aa869fdbf662d1d7e76647bccc4d321"},"schema_version":"1.0"},"canonical_sha256":"bd99e2ede4bdbb37c0864800370a7515e6902acbf6932f528bb7edf54d40a45a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:22.217775Z","signature_b64":"EHsWbZcp247jMvHw0qeZwwvbbr8amkc7ZYWkxM/jB2unf7EwbpaDvZN3efPXkjY/y39NhgKIJ9qMKlPiwsiPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd99e2ede4bdbb37c0864800370a7515e6902acbf6932f528bb7edf54d40a45a","last_reissued_at":"2026-05-18T03:55:22.217023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:22.217023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.4014","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-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/nGxBmxFp1DfOSze+GydBUQCGIO8RwJJFIYsnUtHUHpqAay1OC9L1lpEKHnVzN6w0FrCqNFwwagiQ2M+pBXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:01:37.560005Z"},"content_sha256":"6fa0cfb1f995442b4e48644d68366194f090cdda5bdcfc29403f0a958f82be25","schema_version":"1.0","event_id":"sha256:6fa0cfb1f995442b4e48644d68366194f090cdda5bdcfc29403f0a958f82be25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:XWM6F3PEXW5TPQEGJAADOCTVCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Muramatsu, Shigeki Miyake","submitted_at":"2009-03-24T05:29:04Z","abstract_excerpt":"The aim of this paper is to prove coding theorems for the wiretap channel coding problem and secret key agreement problem based on the the notion of a hash property for an ensemble of functions. These theorems imply that codes using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate universal coding theorems for a wiretap channel and a secret key agreement are also proved."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4014","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-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2OWN8WooLjNmK4YArDmipBZJjsHU54CUMLxJ9yduMc/x/ougv+IrgBp4ElGXR/S718MayMyb5a7oIifaV53DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:01:37.560737Z"},"content_sha256":"5a338e2f56659eb1bcee696b749ae59746697a9795b018682d75b1c74b869533","schema_version":"1.0","event_id":"sha256:5a338e2f56659eb1bcee696b749ae59746697a9795b018682d75b1c74b869533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWM6F3PEXW5TPQEGJAADOCTVCX/bundle.json","state_url":"https://pith.science/pith/XWM6F3PEXW5TPQEGJAADOCTVCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWM6F3PEXW5TPQEGJAADOCTVCX/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-09T12:01:37Z","links":{"resolver":"https://pith.science/pith/XWM6F3PEXW5TPQEGJAADOCTVCX","bundle":"https://pith.science/pith/XWM6F3PEXW5TPQEGJAADOCTVCX/bundle.json","state":"https://pith.science/pith/XWM6F3PEXW5TPQEGJAADOCTVCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWM6F3PEXW5TPQEGJAADOCTVCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:XWM6F3PEXW5TPQEGJAADOCTVCX","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":"2137cfb8d52f02e1576da6af956fc4630aa869fdbf662d1d7e76647bccc4d321","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-24T05:29:04Z","title_canon_sha256":"8ed9f0894de7a265e17bb8decd1515f12139dc9972158373628000150e616084"},"schema_version":"1.0","source":{"id":"0903.4014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4014","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4014v2","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4014","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"XWM6F3PEXW5T","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XWM6F3PEXW5TPQEG","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XWM6F3PE","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:5a338e2f56659eb1bcee696b749ae59746697a9795b018682d75b1c74b869533","target":"graph","created_at":"2026-05-18T03:55:22Z","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 aim of this paper is to prove coding theorems for the wiretap channel coding problem and secret key agreement problem based on the the notion of a hash property for an ensemble of functions. These theorems imply that codes using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate universal coding theorems for a wiretap channel and a secret key agreement are also proved.","authors_text":"Jun Muramatsu, Shigeki Miyake","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-24T05:29:04Z","title":"Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4014","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:6fa0cfb1f995442b4e48644d68366194f090cdda5bdcfc29403f0a958f82be25","target":"record","created_at":"2026-05-18T03:55:22Z","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":"2137cfb8d52f02e1576da6af956fc4630aa869fdbf662d1d7e76647bccc4d321","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-24T05:29:04Z","title_canon_sha256":"8ed9f0894de7a265e17bb8decd1515f12139dc9972158373628000150e616084"},"schema_version":"1.0","source":{"id":"0903.4014","kind":"arxiv","version":2}},"canonical_sha256":"bd99e2ede4bdbb37c0864800370a7515e6902acbf6932f528bb7edf54d40a45a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd99e2ede4bdbb37c0864800370a7515e6902acbf6932f528bb7edf54d40a45a","first_computed_at":"2026-05-18T03:55:22.217023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:22.217023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EHsWbZcp247jMvHw0qeZwwvbbr8amkc7ZYWkxM/jB2unf7EwbpaDvZN3efPXkjY/y39NhgKIJ9qMKlPiwsiPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:22.217775Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.4014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fa0cfb1f995442b4e48644d68366194f090cdda5bdcfc29403f0a958f82be25","sha256:5a338e2f56659eb1bcee696b749ae59746697a9795b018682d75b1c74b869533"],"state_sha256":"c2316fc00efd539040bc4e2c404e9bcfb9ef61dde76c67f570b236988a09f71a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IENfOzunRiWonEK6yfv87OTxp4vgqYMe6+FehaXJP5Toja+XTnx6PZYXuAzi4PHMA1tdykiMI4H2oY5+nD5PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:01:37.564753Z","bundle_sha256":"77d8a314a5f6c6a4624b543225b23cb9c9465e95fd9f5693c6a116607935426e"}}