{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YG2LKBD4HTZDU6P6RIPU5EQIOZ","short_pith_number":"pith:YG2LKBD4","canonical_record":{"source":{"id":"1102.3413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T19:56:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"123d98725daa82c649eeb897dd630c69360e65b5a51747a61ab468f9720bbca9","abstract_canon_sha256":"ad6fe765db7d9556a45aaf66dbd5ca5b589fe31f5e3a29d41a5d3a10fdfc815a"},"schema_version":"1.0"},"canonical_sha256":"c1b4b5047c3cf23a79fe8a1f4e920876538c1bc67fef0ebdd1f5069dddd41df3","source":{"kind":"arxiv","id":"1102.3413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3413","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3413v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3413","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"YG2LKBD4HTZD","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YG2LKBD4HTZDU6P6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YG2LKBD4","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YG2LKBD4HTZDU6P6RIPU5EQIOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T19:56:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"123d98725daa82c649eeb897dd630c69360e65b5a51747a61ab468f9720bbca9","abstract_canon_sha256":"ad6fe765db7d9556a45aaf66dbd5ca5b589fe31f5e3a29d41a5d3a10fdfc815a"},"schema_version":"1.0"},"canonical_sha256":"c1b4b5047c3cf23a79fe8a1f4e920876538c1bc67fef0ebdd1f5069dddd41df3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.209817Z","signature_b64":"tOIO9U8uo9FCdK+faTtXyBxpv+O3pGna3+FL8LFAn6nO2iEMF5Uyr5yOs4z8fkUWdJLzrEdo+cbwEcFd3OStAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1b4b5047c3cf23a79fe8a1f4e920876538c1bc67fef0ebdd1f5069dddd41df3","last_reissued_at":"2026-05-18T03:33:38.209129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.209129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3413","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSaY3K2yh86PSMHs35K8wpBrj/AT/NOyNgHC/uhQ9bkusquADBXxjQ8AMQjCwSyzaIx+XH55AcR4XBtS4a6zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:36:07.691699Z"},"content_sha256":"e88482cc9f4117c420a39e4a0c98b1add154110646e776cb16fc5b043df57281","schema_version":"1.0","event_id":"sha256:e88482cc9f4117c420a39e4a0c98b1add154110646e776cb16fc5b043df57281"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YG2LKBD4HTZDU6P6RIPU5EQIOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity Region of p-Transmitter/q-Receiver Multiple-Access Channels with Common Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Haghi, Farokh Marvasti, Mohammad Reza Aref, Reza K. Farsani","submitted_at":"2011-02-16T19:56:41Z","abstract_excerpt":"This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private messages and also a common message to q receivers and each receiver decodes all of the messages, is considered. The capacity region of the discrete memoryless channel is characterized. Then, the general Gaussian fading MAC with common information wherein partial Channel State Information (CSI) is available at the transmitters (CSIT) and perfect CSI is available at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3413","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"US4rHeIiAaWOBHVJbxT/Ygg6+V5ZFK2o+sw4juPc2p1mnThGXvww+QMFhRx8kL44coSuWWjGJkQmD773MvifBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:36:07.692050Z"},"content_sha256":"1b868260ae136720eda512a1a95533961215a787608060b6a756d55b76b74348","schema_version":"1.0","event_id":"sha256:1b868260ae136720eda512a1a95533961215a787608060b6a756d55b76b74348"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YG2LKBD4HTZDU6P6RIPU5EQIOZ/bundle.json","state_url":"https://pith.science/pith/YG2LKBD4HTZDU6P6RIPU5EQIOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YG2LKBD4HTZDU6P6RIPU5EQIOZ/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-05T17:36:07Z","links":{"resolver":"https://pith.science/pith/YG2LKBD4HTZDU6P6RIPU5EQIOZ","bundle":"https://pith.science/pith/YG2LKBD4HTZDU6P6RIPU5EQIOZ/bundle.json","state":"https://pith.science/pith/YG2LKBD4HTZDU6P6RIPU5EQIOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YG2LKBD4HTZDU6P6RIPU5EQIOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YG2LKBD4HTZDU6P6RIPU5EQIOZ","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":"ad6fe765db7d9556a45aaf66dbd5ca5b589fe31f5e3a29d41a5d3a10fdfc815a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T19:56:41Z","title_canon_sha256":"123d98725daa82c649eeb897dd630c69360e65b5a51747a61ab468f9720bbca9"},"schema_version":"1.0","source":{"id":"1102.3413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3413","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3413v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3413","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"YG2LKBD4HTZD","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YG2LKBD4HTZDU6P6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YG2LKBD4","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:1b868260ae136720eda512a1a95533961215a787608060b6a756d55b76b74348","target":"graph","created_at":"2026-05-18T03:33:38Z","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":"This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private messages and also a common message to q receivers and each receiver decodes all of the messages, is considered. The capacity region of the discrete memoryless channel is characterized. Then, the general Gaussian fading MAC with common information wherein partial Channel State Information (CSI) is available at the transmitters (CSIT) and perfect CSI is available at","authors_text":"Ali Haghi, Farokh Marvasti, Mohammad Reza Aref, Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T19:56:41Z","title":"The Capacity Region of p-Transmitter/q-Receiver Multiple-Access Channels with Common Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3413","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:e88482cc9f4117c420a39e4a0c98b1add154110646e776cb16fc5b043df57281","target":"record","created_at":"2026-05-18T03:33:38Z","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":"ad6fe765db7d9556a45aaf66dbd5ca5b589fe31f5e3a29d41a5d3a10fdfc815a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T19:56:41Z","title_canon_sha256":"123d98725daa82c649eeb897dd630c69360e65b5a51747a61ab468f9720bbca9"},"schema_version":"1.0","source":{"id":"1102.3413","kind":"arxiv","version":1}},"canonical_sha256":"c1b4b5047c3cf23a79fe8a1f4e920876538c1bc67fef0ebdd1f5069dddd41df3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1b4b5047c3cf23a79fe8a1f4e920876538c1bc67fef0ebdd1f5069dddd41df3","first_computed_at":"2026-05-18T03:33:38.209129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.209129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tOIO9U8uo9FCdK+faTtXyBxpv+O3pGna3+FL8LFAn6nO2iEMF5Uyr5yOs4z8fkUWdJLzrEdo+cbwEcFd3OStAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.209817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e88482cc9f4117c420a39e4a0c98b1add154110646e776cb16fc5b043df57281","sha256:1b868260ae136720eda512a1a95533961215a787608060b6a756d55b76b74348"],"state_sha256":"d058b5acf09d8efa58288ef1edd8e28ce4926ac8c07d42fb897dba6857dc17c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ry6tLUnjAokaq0WtgcZxk90zpRAKNoKXqL+nPJ+reWWwCmvrtoIBgup7auC5okm8emJx6uEmglBi+NQNrESdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:36:07.694071Z","bundle_sha256":"5853c8446d5b9c0bdf2c56a66be2c941c45dacb9338e5ceb139f7cb86c452f6c"}}