{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WOSKGVNV25QDBLE42DDCI7OXFH","short_pith_number":"pith:WOSKGVNV","schema_version":"1.0","canonical_sha256":"b3a4a355b5d76030ac9cd0c6247dd729dab11487140ca479dd1e50328d9e7b05","source":{"kind":"arxiv","id":"1402.5869","version":1},"attestation_state":"computed","paper":{"title":"Compound Multiple Access Channel with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bahareh Akhbari, Hassan Zivari-Fard, Mahmoud Ahmadian-Attari, Mohammad Reza Aref","submitted_at":"2014-02-24T15:57:30Z","abstract_excerpt":"In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver and kept secret from the other receiver. For this proposed setting (compound MAC with confidential messages), we derive general inner and outer bounds on the secrecy capacity region. Also, as examples, we investigate 'Less noisy' and 'Gaussian' versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providi"},"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":"1402.5869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-24T15:57:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4699dca1dece97c129d828b41967b563d37dd4d1e867dd57b8448e0621db93d","abstract_canon_sha256":"ebb9657673a421ffffbab2a5e505cb8d440119a812f4676bdf60a846e06d7f1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.655710Z","signature_b64":"Wt4iux08NsNQUVK33wJNXQyzvz9M/893RfMsB8CdgJCVcXG+LumUs7xtQGMvEqw0QNXq4FsAdDbGnH9xkYhwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3a4a355b5d76030ac9cd0c6247dd729dab11487140ca479dd1e50328d9e7b05","last_reissued_at":"2026-05-18T00:58:41.654947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.654947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compound Multiple Access Channel with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bahareh Akhbari, Hassan Zivari-Fard, Mahmoud Ahmadian-Attari, Mohammad Reza Aref","submitted_at":"2014-02-24T15:57:30Z","abstract_excerpt":"In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver and kept secret from the other receiver. For this proposed setting (compound MAC with confidential messages), we derive general inner and outer bounds on the secrecy capacity region. Also, as examples, we investigate 'Less noisy' and 'Gaussian' versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5869","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":"1402.5869","created_at":"2026-05-18T00:58:41.655071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5869v1","created_at":"2026-05-18T00:58:41.655071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5869","created_at":"2026-05-18T00:58:41.655071+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOSKGVNV25QD","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOSKGVNV25QDBLE4","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOSKGVNV","created_at":"2026-05-18T12:28:54.890064+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/WOSKGVNV25QDBLE42DDCI7OXFH","json":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH.json","graph_json":"https://pith.science/api/pith-number/WOSKGVNV25QDBLE42DDCI7OXFH/graph.json","events_json":"https://pith.science/api/pith-number/WOSKGVNV25QDBLE42DDCI7OXFH/events.json","paper":"https://pith.science/paper/WOSKGVNV"},"agent_actions":{"view_html":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH","download_json":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH.json","view_paper":"https://pith.science/paper/WOSKGVNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5869&json=true","fetch_graph":"https://pith.science/api/pith-number/WOSKGVNV25QDBLE42DDCI7OXFH/graph.json","fetch_events":"https://pith.science/api/pith-number/WOSKGVNV25QDBLE42DDCI7OXFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/action/storage_attestation","attest_author":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/action/author_attestation","sign_citation":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/action/citation_signature","submit_replication":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/action/replication_record"}},"created_at":"2026-05-18T00:58:41.655071+00:00","updated_at":"2026-05-18T00:58:41.655071+00:00"}