{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WOSKGVNV25QDBLE42DDCI7OXFH","short_pith_number":"pith:WOSKGVNV","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"},"canonical_sha256":"b3a4a355b5d76030ac9cd0c6247dd729dab11487140ca479dd1e50328d9e7b05","source":{"kind":"arxiv","id":"1402.5869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5869","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5869v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5869","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"WOSKGVNV25QD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WOSKGVNV25QDBLE4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WOSKGVNV","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WOSKGVNV25QDBLE42DDCI7OXFH","target":"record","payload":{"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"},"canonical_sha256":"b3a4a355b5d76030ac9cd0c6247dd729dab11487140ca479dd1e50328d9e7b05","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"},"source_kind":"arxiv","source_id":"1402.5869","source_version":1,"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:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2QIJRGk4nxQcIz9nVVS1iaEfDdKWT3gHtVlUhYBtws/xqdR0l3Qi8u5t6brtkdvI1sWyO6iSkNgHD95Nlb9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:13:25.196473Z"},"content_sha256":"e2616b4d28cd31c8d0d8f7a4783c926d6021b2591d9c5c32fa5a23933b9f5cab","schema_version":"1.0","event_id":"sha256:e2616b4d28cd31c8d0d8f7a4783c926d6021b2591d9c5c32fa5a23933b9f5cab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WOSKGVNV25QDBLE42DDCI7OXFH","target":"graph","payload":{"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"},"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:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CqtJ0hEjWEaS6+JiyJoQvAvRY8R9g8X4E8BIginfipQGRXDueKKeGNRL3lYEtkOvN2rwQcjkHflyyF8tj3rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:13:25.197169Z"},"content_sha256":"30940432651ff172c60fc4d3cf3728e203381ca21d10625766182938d9f2de54","schema_version":"1.0","event_id":"sha256:30940432651ff172c60fc4d3cf3728e203381ca21d10625766182938d9f2de54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/bundle.json","state_url":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOSKGVNV25QDBLE42DDCI7OXFH/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-05-31T22:13:25Z","links":{"resolver":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH","bundle":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/bundle.json","state":"https://pith.science/pith/WOSKGVNV25QDBLE42DDCI7OXFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOSKGVNV25QDBLE42DDCI7OXFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WOSKGVNV25QDBLE42DDCI7OXFH","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":"ebb9657673a421ffffbab2a5e505cb8d440119a812f4676bdf60a846e06d7f1a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-24T15:57:30Z","title_canon_sha256":"f4699dca1dece97c129d828b41967b563d37dd4d1e867dd57b8448e0621db93d"},"schema_version":"1.0","source":{"id":"1402.5869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5869","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5869v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5869","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"WOSKGVNV25QD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WOSKGVNV25QDBLE4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WOSKGVNV","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:30940432651ff172c60fc4d3cf3728e203381ca21d10625766182938d9f2de54","target":"graph","created_at":"2026-05-18T00:58:41Z","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":"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","authors_text":"Bahareh Akhbari, Hassan Zivari-Fard, Mahmoud Ahmadian-Attari, Mohammad Reza Aref","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-24T15:57:30Z","title":"Compound Multiple Access Channel with Confidential Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5869","kind":"arxiv","version":1},"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:e2616b4d28cd31c8d0d8f7a4783c926d6021b2591d9c5c32fa5a23933b9f5cab","target":"record","created_at":"2026-05-18T00:58:41Z","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":"ebb9657673a421ffffbab2a5e505cb8d440119a812f4676bdf60a846e06d7f1a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-24T15:57:30Z","title_canon_sha256":"f4699dca1dece97c129d828b41967b563d37dd4d1e867dd57b8448e0621db93d"},"schema_version":"1.0","source":{"id":"1402.5869","kind":"arxiv","version":1}},"canonical_sha256":"b3a4a355b5d76030ac9cd0c6247dd729dab11487140ca479dd1e50328d9e7b05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3a4a355b5d76030ac9cd0c6247dd729dab11487140ca479dd1e50328d9e7b05","first_computed_at":"2026-05-18T00:58:41.654947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.654947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wt4iux08NsNQUVK33wJNXQyzvz9M/893RfMsB8CdgJCVcXG+LumUs7xtQGMvEqw0QNXq4FsAdDbGnH9xkYhwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.655710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2616b4d28cd31c8d0d8f7a4783c926d6021b2591d9c5c32fa5a23933b9f5cab","sha256:30940432651ff172c60fc4d3cf3728e203381ca21d10625766182938d9f2de54"],"state_sha256":"a5a8841e2ca2941837e5310083d9afed2ec58fe8423cda16c08a0768e4d107f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7C/38lP8VS+7fMPEAUDnfD2wrB8IwNs9g5/9uvvpekF2DTcpA05xQtjgQtX+V+vpDBfVsCjgVBi9KRdt0itBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:13:25.200661Z","bundle_sha256":"79c6f02b51f79b17bd5b100e988aa8ef8cfb07e78b9d7bc65a858c1032dd0752"}}