{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IEHM6AMAU4VOHJSUAXTXKEHHKZ","short_pith_number":"pith:IEHM6AMA","canonical_record":{"source":{"id":"1505.02085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T16:14:14Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"28a32a118cdd331c21bad76cbd8b3c5b9c8fc3cb6c311c1b8720285f52c7f837","abstract_canon_sha256":"f3ff088f74129bd67a80a3d9622b5e0d4b70202a27f08f0472886ce2f1094cab"},"schema_version":"1.0"},"canonical_sha256":"410ecf0180a72ae3a65405e77510e75658f4e10d9d0b67024d0a515fde92607b","source":{"kind":"arxiv","id":"1505.02085","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02085","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02085v3","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02085","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"IEHM6AMAU4VO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IEHM6AMAU4VOHJSU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IEHM6AMA","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IEHM6AMAU4VOHJSUAXTXKEHHKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T16:14:14Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"28a32a118cdd331c21bad76cbd8b3c5b9c8fc3cb6c311c1b8720285f52c7f837","abstract_canon_sha256":"f3ff088f74129bd67a80a3d9622b5e0d4b70202a27f08f0472886ce2f1094cab"},"schema_version":"1.0"},"canonical_sha256":"410ecf0180a72ae3a65405e77510e75658f4e10d9d0b67024d0a515fde92607b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:53.235831Z","signature_b64":"N2gR1Kck8HzHgqUAT+7cWEOHyEbKaVCZvOEIaP8Nxd6gwmjFd09N41P/NTZkQIfkCzX3GYfFvxLzK0nkPeQmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"410ecf0180a72ae3a65405e77510e75658f4e10d9d0b67024d0a515fde92607b","last_reissued_at":"2026-05-18T00:52:53.235115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:53.235115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02085","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-18T00:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJPx/omlGefZ8ch38P8+K/5a6kyctYVl44kfgAd+YVvmisZ2mYa+rRIH6yAPiK1wMlO4RyDJrmamnoav9OjRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:14:55.586469Z"},"content_sha256":"01359316d6d7d2565ee86c8a572b5210e604c990722189e4d8c561dea403be2a","schema_version":"1.0","event_id":"sha256:01359316d6d7d2565ee86c8a572b5210e604c990722189e4d8c561dea403be2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IEHM6AMAU4VOHJSUAXTXKEHHKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Secrecy Rate Region for Recent Messages for a Slotted Multiple Access Wiretap Channel to Shannon Capacity Region","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Shahid M. Shah, Vinod Sharma","submitted_at":"2015-05-08T16:14:14Z","abstract_excerpt":"Security constraint results in \\textit{rate-loss} in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy rates of both the users until we achieve the usual capacity region of a Multiple Access Channel (MAC) without the wiretapper (Shannon capacity region). With this scheme all the messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal we introduce secret key buffers at both the user"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02085","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-18T00:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1NxB4fAzOqPf/B9yCOGIvCpMfcSOCESDVkoBft0NXen5fC0aTu/0X1kVsT0S7aLW0ocXoZImgks1kZSLhvmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:14:55.586827Z"},"content_sha256":"6fe8fdf7d02ab646c4413e65d71edb0aaaf2fd5bc51e8ab459e3fd5efb32c09f","schema_version":"1.0","event_id":"sha256:6fe8fdf7d02ab646c4413e65d71edb0aaaf2fd5bc51e8ab459e3fd5efb32c09f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEHM6AMAU4VOHJSUAXTXKEHHKZ/bundle.json","state_url":"https://pith.science/pith/IEHM6AMAU4VOHJSUAXTXKEHHKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEHM6AMAU4VOHJSUAXTXKEHHKZ/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-02T13:14:55Z","links":{"resolver":"https://pith.science/pith/IEHM6AMAU4VOHJSUAXTXKEHHKZ","bundle":"https://pith.science/pith/IEHM6AMAU4VOHJSUAXTXKEHHKZ/bundle.json","state":"https://pith.science/pith/IEHM6AMAU4VOHJSUAXTXKEHHKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEHM6AMAU4VOHJSUAXTXKEHHKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IEHM6AMAU4VOHJSUAXTXKEHHKZ","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":"f3ff088f74129bd67a80a3d9622b5e0d4b70202a27f08f0472886ce2f1094cab","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T16:14:14Z","title_canon_sha256":"28a32a118cdd331c21bad76cbd8b3c5b9c8fc3cb6c311c1b8720285f52c7f837"},"schema_version":"1.0","source":{"id":"1505.02085","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02085","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02085v3","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02085","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"IEHM6AMAU4VO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IEHM6AMAU4VOHJSU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IEHM6AMA","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:6fe8fdf7d02ab646c4413e65d71edb0aaaf2fd5bc51e8ab459e3fd5efb32c09f","target":"graph","created_at":"2026-05-18T00:52:53Z","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":"Security constraint results in \\textit{rate-loss} in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy rates of both the users until we achieve the usual capacity region of a Multiple Access Channel (MAC) without the wiretapper (Shannon capacity region). With this scheme all the messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal we introduce secret key buffers at both the user","authors_text":"Shahid M. 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":"2015-05-08T16:14:14Z","title":"Enhancing Secrecy Rate Region for Recent Messages for a Slotted Multiple Access Wiretap Channel to Shannon Capacity Region"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02085","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:01359316d6d7d2565ee86c8a572b5210e604c990722189e4d8c561dea403be2a","target":"record","created_at":"2026-05-18T00:52:53Z","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":"f3ff088f74129bd67a80a3d9622b5e0d4b70202a27f08f0472886ce2f1094cab","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T16:14:14Z","title_canon_sha256":"28a32a118cdd331c21bad76cbd8b3c5b9c8fc3cb6c311c1b8720285f52c7f837"},"schema_version":"1.0","source":{"id":"1505.02085","kind":"arxiv","version":3}},"canonical_sha256":"410ecf0180a72ae3a65405e77510e75658f4e10d9d0b67024d0a515fde92607b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"410ecf0180a72ae3a65405e77510e75658f4e10d9d0b67024d0a515fde92607b","first_computed_at":"2026-05-18T00:52:53.235115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:53.235115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N2gR1Kck8HzHgqUAT+7cWEOHyEbKaVCZvOEIaP8Nxd6gwmjFd09N41P/NTZkQIfkCzX3GYfFvxLzK0nkPeQmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:53.235831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02085","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01359316d6d7d2565ee86c8a572b5210e604c990722189e4d8c561dea403be2a","sha256:6fe8fdf7d02ab646c4413e65d71edb0aaaf2fd5bc51e8ab459e3fd5efb32c09f"],"state_sha256":"fe8794f7705b0fabd5f89703e5f06a8dc94c353c56a21eae49d31e789f2f0a56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89TKMwX/0Dba0EPAEGUcPljRmqsnwPyODl2dvD3LcIgUdKfL7/itJ3o9C4bH7dTBNP2g00QNI5Q/8IoqxysIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:14:55.589093Z","bundle_sha256":"62adc934622c4871ea7daf1154906284608906d033c506bdf01a991e17743fd4"}}