{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EEOU26STK5PF7I3JOKRHWNK4TC","short_pith_number":"pith:EEOU26ST","canonical_record":{"source":{"id":"1402.4799","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T20:42:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a402c8077328baf2dc3508be81aa68c77ab74337290ac876052bcf16dfc07a6","abstract_canon_sha256":"34d986bf56da6d7258fb2ac43d5226bfbe8dae25480a871c6bbe2ee676dad1ad"},"schema_version":"1.0"},"canonical_sha256":"211d4d7a53575e5fa36972a27b355c98a28e8d5e7e7dd015bcee226f1dbfd385","source":{"kind":"arxiv","id":"1402.4799","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4799","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4799v3","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4799","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"EEOU26STK5PF","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EEOU26STK5PF7I3J","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EEOU26ST","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EEOU26STK5PF7I3JOKRHWNK4TC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4799","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T20:42:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a402c8077328baf2dc3508be81aa68c77ab74337290ac876052bcf16dfc07a6","abstract_canon_sha256":"34d986bf56da6d7258fb2ac43d5226bfbe8dae25480a871c6bbe2ee676dad1ad"},"schema_version":"1.0"},"canonical_sha256":"211d4d7a53575e5fa36972a27b355c98a28e8d5e7e7dd015bcee226f1dbfd385","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:13.830657Z","signature_b64":"gcLd10eQkJF+pCumj4lwrzoNNeVtLHiNpN5VL4bHbNZLYZ2O9sOBwf+/Qalwio4GVauiUTVNDZpw7g7fwhu3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"211d4d7a53575e5fa36972a27b355c98a28e8d5e7e7dd015bcee226f1dbfd385","last_reissued_at":"2026-05-18T01:11:13.830021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:13.830021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4799","source_version":3,"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-18T01:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"096XCaMYhUdoYcLZsBddQ2a4VoivEnM9UbZvPmBoWOPFI72BsGuGKJA8N9gxfOtbhZoeG0zsUd+O8evy580OCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:10:26.992995Z"},"content_sha256":"cb0f25b61a1ddaef18a7304d9ce42df2ad8e3a0b23ddbf740dd3f70d8d619c86","schema_version":"1.0","event_id":"sha256:cb0f25b61a1ddaef18a7304d9ce42df2ad8e3a0b23ddbf740dd3f70d8d619c86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EEOU26STK5PF7I3JOKRHWNK4TC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Access Channel with Common Message and Secrecy constraint","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-19T20:42:48Z","abstract_excerpt":"In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel with Common message (MAWC-CM). For this setting, we derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4799","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"},"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-18T01:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeYWZe+Nsy1GT2yCQaTjbkCRfO8lZGDM1j1KvPCrdMSlVl35+CWN5mkrn+j7Kwux6iPTp3gGz4p0lq3I8t2HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:10:26.993362Z"},"content_sha256":"8ddcd9464945546a0f49bf45b2fc8a088e8f35164c833ca7685bca699afe8758","schema_version":"1.0","event_id":"sha256:8ddcd9464945546a0f49bf45b2fc8a088e8f35164c833ca7685bca699afe8758"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEOU26STK5PF7I3JOKRHWNK4TC/bundle.json","state_url":"https://pith.science/pith/EEOU26STK5PF7I3JOKRHWNK4TC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEOU26STK5PF7I3JOKRHWNK4TC/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-06-01T04:10:26Z","links":{"resolver":"https://pith.science/pith/EEOU26STK5PF7I3JOKRHWNK4TC","bundle":"https://pith.science/pith/EEOU26STK5PF7I3JOKRHWNK4TC/bundle.json","state":"https://pith.science/pith/EEOU26STK5PF7I3JOKRHWNK4TC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEOU26STK5PF7I3JOKRHWNK4TC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EEOU26STK5PF7I3JOKRHWNK4TC","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":"34d986bf56da6d7258fb2ac43d5226bfbe8dae25480a871c6bbe2ee676dad1ad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T20:42:48Z","title_canon_sha256":"6a402c8077328baf2dc3508be81aa68c77ab74337290ac876052bcf16dfc07a6"},"schema_version":"1.0","source":{"id":"1402.4799","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4799","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4799v3","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4799","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"EEOU26STK5PF","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EEOU26STK5PF7I3J","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EEOU26ST","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:8ddcd9464945546a0f49bf45b2fc8a088e8f35164c833ca7685bca699afe8758","target":"graph","created_at":"2026-05-18T01:11:13Z","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 multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel with Common message (MAWC-CM). For this setting, we derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a ","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-19T20:42:48Z","title":"Multiple Access Channel with Common Message and Secrecy constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4799","kind":"arxiv","version":3},"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:cb0f25b61a1ddaef18a7304d9ce42df2ad8e3a0b23ddbf740dd3f70d8d619c86","target":"record","created_at":"2026-05-18T01:11:13Z","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":"34d986bf56da6d7258fb2ac43d5226bfbe8dae25480a871c6bbe2ee676dad1ad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T20:42:48Z","title_canon_sha256":"6a402c8077328baf2dc3508be81aa68c77ab74337290ac876052bcf16dfc07a6"},"schema_version":"1.0","source":{"id":"1402.4799","kind":"arxiv","version":3}},"canonical_sha256":"211d4d7a53575e5fa36972a27b355c98a28e8d5e7e7dd015bcee226f1dbfd385","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"211d4d7a53575e5fa36972a27b355c98a28e8d5e7e7dd015bcee226f1dbfd385","first_computed_at":"2026-05-18T01:11:13.830021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:13.830021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gcLd10eQkJF+pCumj4lwrzoNNeVtLHiNpN5VL4bHbNZLYZ2O9sOBwf+/Qalwio4GVauiUTVNDZpw7g7fwhu3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:13.830657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4799","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb0f25b61a1ddaef18a7304d9ce42df2ad8e3a0b23ddbf740dd3f70d8d619c86","sha256:8ddcd9464945546a0f49bf45b2fc8a088e8f35164c833ca7685bca699afe8758"],"state_sha256":"15802b557668a68423c03fc20655891b9052f6996e231abcb85b9bd129b2adf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jy/cxRQaJ3Xt4+KNKekRxYhrBMizHjcV2buDIR8WyOjEG2hcjCoOqtpXS2UiMjvzUaS9ERkigOfg/HWentYKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:10:26.995347Z","bundle_sha256":"ace0e7d1712390c06bfd28f812018c8f2981f38e0015278492626ea170ab997a"}}