{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GQL4YGSTEMOHBU2LBSLYZL55D3","short_pith_number":"pith:GQL4YGST","schema_version":"1.0","canonical_sha256":"3417cc1a53231c70d34b0c978cafbd1edb87f235cc43e58842d6b1bb0b789c59","source":{"kind":"arxiv","id":"1802.02131","version":1},"attestation_state":"computed","paper":{"title":"Generalizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aylin Yener, Mohamed Nafea","submitted_at":"2018-02-06T18:50:22Z","abstract_excerpt":"In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixed-length subset of the channel uses on which she obtains noise-free observations of one of the codewords, a superposition of the two codewords, or each of the two codewords. These thus extend the recently examined wiretap channel II with a noisy main channel to a multiple access setting with a va"},"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":"1802.02131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-06T18:50:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4009922e3d6221d8d26d5333e4bd27fc2e224e97010d9ba18fc32e7c65bbfc8a","abstract_canon_sha256":"1e082fa356891e061d41dc9dfcf160a7bd38e017357f741df8e11432843632a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:10.807684Z","signature_b64":"qoKSNBbUHsRDDUWB/TjngST31R48/5Hs6Oh6i7kjD0B3LsLRCRQU8c9Lr4QTU0opnbJa+ziZbPuFnRTusueZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3417cc1a53231c70d34b0c978cafbd1edb87f235cc43e58842d6b1bb0b789c59","last_reissued_at":"2026-05-18T00:24:10.807075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:10.807075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aylin Yener, Mohamed Nafea","submitted_at":"2018-02-06T18:50:22Z","abstract_excerpt":"In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixed-length subset of the channel uses on which she obtains noise-free observations of one of the codewords, a superposition of the two codewords, or each of the two codewords. These thus extend the recently examined wiretap channel II with a noisy main channel to a multiple access setting with a va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02131","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":"1802.02131","created_at":"2026-05-18T00:24:10.807164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02131v1","created_at":"2026-05-18T00:24:10.807164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02131","created_at":"2026-05-18T00:24:10.807164+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQL4YGSTEMOH","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQL4YGSTEMOHBU2L","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQL4YGST","created_at":"2026-05-18T12:32:25.280505+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/GQL4YGSTEMOHBU2LBSLYZL55D3","json":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3.json","graph_json":"https://pith.science/api/pith-number/GQL4YGSTEMOHBU2LBSLYZL55D3/graph.json","events_json":"https://pith.science/api/pith-number/GQL4YGSTEMOHBU2LBSLYZL55D3/events.json","paper":"https://pith.science/paper/GQL4YGST"},"agent_actions":{"view_html":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3","download_json":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3.json","view_paper":"https://pith.science/paper/GQL4YGST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02131&json=true","fetch_graph":"https://pith.science/api/pith-number/GQL4YGSTEMOHBU2LBSLYZL55D3/graph.json","fetch_events":"https://pith.science/api/pith-number/GQL4YGSTEMOHBU2LBSLYZL55D3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3/action/storage_attestation","attest_author":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3/action/author_attestation","sign_citation":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3/action/citation_signature","submit_replication":"https://pith.science/pith/GQL4YGSTEMOHBU2LBSLYZL55D3/action/replication_record"}},"created_at":"2026-05-18T00:24:10.807164+00:00","updated_at":"2026-05-18T00:24:10.807164+00:00"}