{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LNU3UUT3HKPXQOIMOAZWTSQUAK","short_pith_number":"pith:LNU3UUT3","canonical_record":{"source":{"id":"1404.5701","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:39:02Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"6f37d34be3ae81d5d2f41a80443e92d4068a835faa665ca9acb284806071f0e3","abstract_canon_sha256":"d88d93e78e3391900cc0b9aa75fd203fdef1a0868c167df0fdf09eec88e7f37f"},"schema_version":"1.0"},"canonical_sha256":"5b69ba527b3a9f78390c703369ca140293af7365e65a22cbbc1fcfd515f25af8","source":{"kind":"arxiv","id":"1404.5701","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5701","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5701v3","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5701","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"LNU3UUT3HKPX","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LNU3UUT3HKPXQOIM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LNU3UUT3","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LNU3UUT3HKPXQOIMOAZWTSQUAK","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5701","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:39:02Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"6f37d34be3ae81d5d2f41a80443e92d4068a835faa665ca9acb284806071f0e3","abstract_canon_sha256":"d88d93e78e3391900cc0b9aa75fd203fdef1a0868c167df0fdf09eec88e7f37f"},"schema_version":"1.0"},"canonical_sha256":"5b69ba527b3a9f78390c703369ca140293af7365e65a22cbbc1fcfd515f25af8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:33.805512Z","signature_b64":"GCVmh59LdCxMSBybpa6fddTKT+iZtlMIE+HtVgbr8hZCUqXHGZUIayKDRdCxYkAS8zyWKPE5hz1m0E1lZmD7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b69ba527b3a9f78390c703369ca140293af7365e65a22cbbc1fcfd515f25af8","last_reissued_at":"2026-05-18T01:11:33.805073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:33.805073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5701","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-18T01:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIzwy/ZAXn8yj6NgI/pX7jUS2iWHIXC4g+AIlBU9gXKJo7spJn/KJ8dtLIANz8AP9a1gWkyXOe+64qPnisakCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:44:08.340693Z"},"content_sha256":"aba793bdf255a629fc2d30c8be8f050fb041e1e63fd741f44c8ebbbc36544ed8","schema_version":"1.0","event_id":"sha256:aba793bdf255a629fc2d30c8be8f050fb041e1e63fd741f44c8ebbbc36544ed8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LNU3UUT3HKPXQOIMOAZWTSQUAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Shannon Capacity in a Wiretap Channel via Previous Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Shahid Mehraj Shah, Vinod Sharma","submitted_at":"2014-04-23T04:39:02Z","abstract_excerpt":"In this paper we consider a wiretap channel with a secret key buffer. We use the coding scheme of [1] to enhance the secrecy rate to the capacity of the main channel, while storing each securely transmitted message in the secret key buffer. We use the oldest secret bits from the buffer to be used as a secret key to transmit a message in a slot and then remove those bits. With this scheme we are able to prove stronger results than those in [1]. i.e., not only the message which is being transmitted currently, but all the messages transmitted in last $N_1$ slots are secure with respect to all the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5701","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-18T01:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgW/mrax4L/LyfSKOYEAcjocxBgu12heFTEfBKd14WhZb6Rdtfnx1iAitGUiw2W+kWZYtjq+3b/9+eSnru6uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:44:08.341043Z"},"content_sha256":"5a081cfbc32660bb447638212ad6060e58b556322d2dea3ca9e1d6b9b4e7607f","schema_version":"1.0","event_id":"sha256:5a081cfbc32660bb447638212ad6060e58b556322d2dea3ca9e1d6b9b4e7607f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNU3UUT3HKPXQOIMOAZWTSQUAK/bundle.json","state_url":"https://pith.science/pith/LNU3UUT3HKPXQOIMOAZWTSQUAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNU3UUT3HKPXQOIMOAZWTSQUAK/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-23T15:44:08Z","links":{"resolver":"https://pith.science/pith/LNU3UUT3HKPXQOIMOAZWTSQUAK","bundle":"https://pith.science/pith/LNU3UUT3HKPXQOIMOAZWTSQUAK/bundle.json","state":"https://pith.science/pith/LNU3UUT3HKPXQOIMOAZWTSQUAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNU3UUT3HKPXQOIMOAZWTSQUAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LNU3UUT3HKPXQOIMOAZWTSQUAK","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":"d88d93e78e3391900cc0b9aa75fd203fdef1a0868c167df0fdf09eec88e7f37f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:39:02Z","title_canon_sha256":"6f37d34be3ae81d5d2f41a80443e92d4068a835faa665ca9acb284806071f0e3"},"schema_version":"1.0","source":{"id":"1404.5701","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5701","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5701v3","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5701","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"LNU3UUT3HKPX","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LNU3UUT3HKPXQOIM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LNU3UUT3","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:5a081cfbc32660bb447638212ad6060e58b556322d2dea3ca9e1d6b9b4e7607f","target":"graph","created_at":"2026-05-18T01:11:33Z","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":"In this paper we consider a wiretap channel with a secret key buffer. We use the coding scheme of [1] to enhance the secrecy rate to the capacity of the main channel, while storing each securely transmitted message in the secret key buffer. We use the oldest secret bits from the buffer to be used as a secret key to transmit a message in a slot and then remove those bits. With this scheme we are able to prove stronger results than those in [1]. i.e., not only the message which is being transmitted currently, but all the messages transmitted in last $N_1$ slots are secure with respect to all the","authors_text":"Shahid Mehraj Shah, Vinod Sharma","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:39:02Z","title":"Achieving Shannon Capacity in a Wiretap Channel via Previous Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5701","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:aba793bdf255a629fc2d30c8be8f050fb041e1e63fd741f44c8ebbbc36544ed8","target":"record","created_at":"2026-05-18T01:11:33Z","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":"d88d93e78e3391900cc0b9aa75fd203fdef1a0868c167df0fdf09eec88e7f37f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:39:02Z","title_canon_sha256":"6f37d34be3ae81d5d2f41a80443e92d4068a835faa665ca9acb284806071f0e3"},"schema_version":"1.0","source":{"id":"1404.5701","kind":"arxiv","version":3}},"canonical_sha256":"5b69ba527b3a9f78390c703369ca140293af7365e65a22cbbc1fcfd515f25af8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b69ba527b3a9f78390c703369ca140293af7365e65a22cbbc1fcfd515f25af8","first_computed_at":"2026-05-18T01:11:33.805073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:33.805073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GCVmh59LdCxMSBybpa6fddTKT+iZtlMIE+HtVgbr8hZCUqXHGZUIayKDRdCxYkAS8zyWKPE5hz1m0E1lZmD7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:33.805512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5701","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aba793bdf255a629fc2d30c8be8f050fb041e1e63fd741f44c8ebbbc36544ed8","sha256:5a081cfbc32660bb447638212ad6060e58b556322d2dea3ca9e1d6b9b4e7607f"],"state_sha256":"fc9aded7cf1f4997c62baab0205e2ef72c5afdcacca3b5e32a8a58dcec619c5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1mdc8Lv7qjTrEDEHTmJ5bfj3XWYTJiuNrZAuxtivfEhT/T4gyRHj+ti18YjGL9rVp02Y4qR0QkoU0Kls023CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:44:08.343056Z","bundle_sha256":"69acd4dffe4d2d6ebb8b5717fd7c39b76f804582c764fe7497f2ebb2f2a17907"}}