{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UZ4XS7UR4GGEQTEMCHTYSDSFLG","short_pith_number":"pith:UZ4XS7UR","schema_version":"1.0","canonical_sha256":"a679797e91e18c484c8c11e7890e4559b93d684793e01b4f00a4feb209b67996","source":{"kind":"arxiv","id":"1803.06007","version":3},"attestation_state":"computed","paper":{"title":"Covert Communication over a K-User Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keerthi Suria Kumar Arumugam, Matthieu R. Bloch","submitted_at":"2018-03-15T21:23:34Z","abstract_excerpt":"We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the $K$ transmitters can transmit on the order of $\\sqrt{n}$ reliable and covert bits per $n$ channel uses, exceeding which, the warden will be able to detect the communication."},"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":"1803.06007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-15T21:23:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f652c3ee0378d997e1be595e644c36aea5eb8f7ce4ca3f2c3e3272a93d946b7","abstract_canon_sha256":"d64b0853486ca9e8a5bb1c1606d67d713ac59a406be177ee0fbec9c48fbf564a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:51.362761Z","signature_b64":"PHwkdJEd+A8NcZ2hE+2+YCKk8TzyGlWUtbqkcGuDKVg6dyNvhjz7oLLCdO7sjwi2jol2hbjqKtnkUQ+aG+41AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a679797e91e18c484c8c11e7890e4559b93d684793e01b4f00a4feb209b67996","last_reissued_at":"2026-05-17T23:43:51.362035Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:51.362035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covert Communication over a K-User Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keerthi Suria Kumar Arumugam, Matthieu R. Bloch","submitted_at":"2018-03-15T21:23:34Z","abstract_excerpt":"We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the $K$ transmitters can transmit on the order of $\\sqrt{n}$ reliable and covert bits per $n$ channel uses, exceeding which, the warden will be able to detect the communication."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06007","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.06007","created_at":"2026-05-17T23:43:51.362147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06007v3","created_at":"2026-05-17T23:43:51.362147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06007","created_at":"2026-05-17T23:43:51.362147+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZ4XS7UR4GGE","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZ4XS7UR4GGEQTEM","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZ4XS7UR","created_at":"2026-05-18T12:32:56.356000+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/UZ4XS7UR4GGEQTEMCHTYSDSFLG","json":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG.json","graph_json":"https://pith.science/api/pith-number/UZ4XS7UR4GGEQTEMCHTYSDSFLG/graph.json","events_json":"https://pith.science/api/pith-number/UZ4XS7UR4GGEQTEMCHTYSDSFLG/events.json","paper":"https://pith.science/paper/UZ4XS7UR"},"agent_actions":{"view_html":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG","download_json":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG.json","view_paper":"https://pith.science/paper/UZ4XS7UR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06007&json=true","fetch_graph":"https://pith.science/api/pith-number/UZ4XS7UR4GGEQTEMCHTYSDSFLG/graph.json","fetch_events":"https://pith.science/api/pith-number/UZ4XS7UR4GGEQTEMCHTYSDSFLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG/action/storage_attestation","attest_author":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG/action/author_attestation","sign_citation":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG/action/citation_signature","submit_replication":"https://pith.science/pith/UZ4XS7UR4GGEQTEMCHTYSDSFLG/action/replication_record"}},"created_at":"2026-05-17T23:43:51.362147+00:00","updated_at":"2026-05-17T23:43:51.362147+00:00"}