{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZZ5LHU2UHDMEW24E2PPIUARYXX","short_pith_number":"pith:ZZ5LHU2U","schema_version":"1.0","canonical_sha256":"ce7ab3d35438d84b6b84d3de8a0238bdd338af3d38f82172b21f8a58df0e983b","source":{"kind":"arxiv","id":"1201.4109","version":1},"attestation_state":"computed","paper":{"title":"On the Multiple Access Channel with Asymmetric Noisy State Information at the Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fady Alajaji, Giacomo Como, Nevroz \\c{S}en, Serdar Y\\\"uksel","submitted_at":"2012-01-19T16:58:08Z","abstract_excerpt":"We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees of asymmetric noisy channel state information (CSI). For the case where the encoders observe causal, asymmetric noisy CSI and the decoder observes complete CSI, we provide inner and outer bounds to the capacity region, which are tight for the sum-rate capacity. We then observe that, under a Markov assumption, similar capacity results also hold in the case w"},"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":"1201.4109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-19T16:58:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89ce120aa34dd517e3ea8e01a8216b16f6bc108c73b48cbb30869eb3582c40da","abstract_canon_sha256":"9970efa86e91b3278e77c4a28696337ec40157ad5f716dcc5885a715341fdd8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:15.936260Z","signature_b64":"pIWpxNx0p3pYpMSpjrzk6nQ5On8ZG8Ti/RGYLv1Sktj3j/ezjMLWU8npORBTXuSG/Mt7t7ngizj6+Wmc9dpOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce7ab3d35438d84b6b84d3de8a0238bdd338af3d38f82172b21f8a58df0e983b","last_reissued_at":"2026-05-18T04:04:15.935510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:15.935510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Multiple Access Channel with Asymmetric Noisy State Information at the Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fady Alajaji, Giacomo Como, Nevroz \\c{S}en, Serdar Y\\\"uksel","submitted_at":"2012-01-19T16:58:08Z","abstract_excerpt":"We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees of asymmetric noisy channel state information (CSI). For the case where the encoders observe causal, asymmetric noisy CSI and the decoder observes complete CSI, we provide inner and outer bounds to the capacity region, which are tight for the sum-rate capacity. We then observe that, under a Markov assumption, similar capacity results also hold in the case w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4109","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":"1201.4109","created_at":"2026-05-18T04:04:15.935638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4109v1","created_at":"2026-05-18T04:04:15.935638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4109","created_at":"2026-05-18T04:04:15.935638+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZ5LHU2UHDME","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZ5LHU2UHDMEW24E","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZ5LHU2U","created_at":"2026-05-18T12:27:30.460161+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/ZZ5LHU2UHDMEW24E2PPIUARYXX","json":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX.json","graph_json":"https://pith.science/api/pith-number/ZZ5LHU2UHDMEW24E2PPIUARYXX/graph.json","events_json":"https://pith.science/api/pith-number/ZZ5LHU2UHDMEW24E2PPIUARYXX/events.json","paper":"https://pith.science/paper/ZZ5LHU2U"},"agent_actions":{"view_html":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX","download_json":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX.json","view_paper":"https://pith.science/paper/ZZ5LHU2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4109&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZ5LHU2UHDMEW24E2PPIUARYXX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZ5LHU2UHDMEW24E2PPIUARYXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX/action/storage_attestation","attest_author":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX/action/author_attestation","sign_citation":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX/action/citation_signature","submit_replication":"https://pith.science/pith/ZZ5LHU2UHDMEW24E2PPIUARYXX/action/replication_record"}},"created_at":"2026-05-18T04:04:15.935638+00:00","updated_at":"2026-05-18T04:04:15.935638+00:00"}