{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6G5CDIMY6L7ZVCK4UAU5H6F7RD","short_pith_number":"pith:6G5CDIMY","schema_version":"1.0","canonical_sha256":"f1ba21a198f2ff9a895ca029d3f8bf88fb1d51a661f9f96f4296714b388eb3c3","source":{"kind":"arxiv","id":"1005.0291","version":3},"attestation_state":"computed","paper":{"title":"The Compound Multiple Access Channel with Partially Cooperating Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Holger Boche, Igor Bjelakovi\\'c, Moritz Wiese, Volker Jungnickel","submitted_at":"2010-05-03T13:45:09Z","abstract_excerpt":"The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The channel state information at the transmitters is such that each transmitter has a finite partition of the set of states and knows which element of the partition the actual state belongs to. The receiver may have arbitrary channel state information. The first coding theorem is for the case that both transmitters have a common message and that each has an additi"},"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":"1005.0291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-03T13:45:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"557e30d8e80245f7721f72ccf852ecece56467af7cc535c1bfc2acfc15149d41","abstract_canon_sha256":"904a45e106f59585f118f6ecb6e79f7e856b8e33a2f1fcee16394f5d3ce3c1d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:14.417269Z","signature_b64":"o81ZFv2IG27iUXWsJb7OVcPVcF5A93nijwnDGR+MvJYOGCjBNB/vVD6Z33SM1myLazpTWgceLmOii8Z7lybzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ba21a198f2ff9a895ca029d3f8bf88fb1d51a661f9f96f4296714b388eb3c3","last_reissued_at":"2026-05-18T04:30:14.416732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:14.416732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Compound Multiple Access Channel with Partially Cooperating Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Holger Boche, Igor Bjelakovi\\'c, Moritz Wiese, Volker Jungnickel","submitted_at":"2010-05-03T13:45:09Z","abstract_excerpt":"The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The channel state information at the transmitters is such that each transmitter has a finite partition of the set of states and knows which element of the partition the actual state belongs to. The receiver may have arbitrary channel state information. The first coding theorem is for the case that both transmitters have a common message and that each has an additi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0291","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":"1005.0291","created_at":"2026-05-18T04:30:14.416810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.0291v3","created_at":"2026-05-18T04:30:14.416810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0291","created_at":"2026-05-18T04:30:14.416810+00:00"},{"alias_kind":"pith_short_12","alias_value":"6G5CDIMY6L7Z","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6G5CDIMY6L7ZVCK4","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6G5CDIMY","created_at":"2026-05-18T12:26:04.259169+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/6G5CDIMY6L7ZVCK4UAU5H6F7RD","json":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD.json","graph_json":"https://pith.science/api/pith-number/6G5CDIMY6L7ZVCK4UAU5H6F7RD/graph.json","events_json":"https://pith.science/api/pith-number/6G5CDIMY6L7ZVCK4UAU5H6F7RD/events.json","paper":"https://pith.science/paper/6G5CDIMY"},"agent_actions":{"view_html":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD","download_json":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD.json","view_paper":"https://pith.science/paper/6G5CDIMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.0291&json=true","fetch_graph":"https://pith.science/api/pith-number/6G5CDIMY6L7ZVCK4UAU5H6F7RD/graph.json","fetch_events":"https://pith.science/api/pith-number/6G5CDIMY6L7ZVCK4UAU5H6F7RD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD/action/storage_attestation","attest_author":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD/action/author_attestation","sign_citation":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD/action/citation_signature","submit_replication":"https://pith.science/pith/6G5CDIMY6L7ZVCK4UAU5H6F7RD/action/replication_record"}},"created_at":"2026-05-18T04:30:14.416810+00:00","updated_at":"2026-05-18T04:30:14.416810+00:00"}