{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ROZ76UOOPLFEVPM2J7S5XXITCL","short_pith_number":"pith:ROZ76UOO","schema_version":"1.0","canonical_sha256":"8bb3ff51ce7aca4abd9a4fe5dbdd1312d79f29c2f3214daa88b7b72c0ff7900d","source":{"kind":"arxiv","id":"1410.8794","version":1},"attestation_state":"computed","paper":{"title":"Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel","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-10-31T16:34:48Z","abstract_excerpt":"We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual Multiple Access Channel (MAC)."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1410.8794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-31T16:34:48Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"41d401948c3d2860d8bb7b34cf0a953dbb86b231353aef6672aba172a0de4796","abstract_canon_sha256":"c3cc9ceefaf054e6ae2948dbd3e709f651b1dab8f0916ca63c9a283dca4d0c04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.689376Z","signature_b64":"QN75bAWubJ1pUQHrA4yMZ656lnXQax5kSioSOFVUw2VYAMU/nsXI+NJywMceDnqgL0AjbF43+RL9+Pa8Kxm7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb3ff51ce7aca4abd9a4fe5dbdd1312d79f29c2f3214daa88b7b72c0ff7900d","last_reissued_at":"2026-05-18T02:38:53.688988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.688988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel","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-10-31T16:34:48Z","abstract_excerpt":"We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual Multiple Access Channel (MAC)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8794","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.8794","created_at":"2026-05-18T02:38:53.689044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8794v1","created_at":"2026-05-18T02:38:53.689044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8794","created_at":"2026-05-18T02:38:53.689044+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROZ76UOOPLFE","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROZ76UOOPLFEVPM2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROZ76UOO","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL","json":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL.json","graph_json":"https://pith.science/api/pith-number/ROZ76UOOPLFEVPM2J7S5XXITCL/graph.json","events_json":"https://pith.science/api/pith-number/ROZ76UOOPLFEVPM2J7S5XXITCL/events.json","paper":"https://pith.science/paper/ROZ76UOO"},"agent_actions":{"view_html":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL","download_json":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL.json","view_paper":"https://pith.science/paper/ROZ76UOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8794&json=true","fetch_graph":"https://pith.science/api/pith-number/ROZ76UOOPLFEVPM2J7S5XXITCL/graph.json","fetch_events":"https://pith.science/api/pith-number/ROZ76UOOPLFEVPM2J7S5XXITCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL/action/storage_attestation","attest_author":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL/action/author_attestation","sign_citation":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL/action/citation_signature","submit_replication":"https://pith.science/pith/ROZ76UOOPLFEVPM2J7S5XXITCL/action/replication_record"}},"created_at":"2026-05-18T02:38:53.689044+00:00","updated_at":"2026-05-18T02:38:53.689044+00:00"}