{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CEXE7HUGK3JOTCXHPG2ZLPDEGO","short_pith_number":"pith:CEXE7HUG","schema_version":"1.0","canonical_sha256":"112e4f9e8656d2e98ae779b595bc64338c39367e9eb4f05bc30c6c00167ec25e","source":{"kind":"arxiv","id":"1702.02330","version":1},"attestation_state":"computed","paper":{"title":"A New Achievable Rate Region for Multiple-Access Channel with States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2017-02-08T09:01:18Z","abstract_excerpt":"The problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter characterization of the achievable rate region. As an example, we investigate the problem of doubly-dirty MAC with modulo-$4$ addition. It is shown that the sum-rate $R_1+R_2=1$ bits per channel use is achievable using the new scheme. Whereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates greater than $0.32$ are not achievable."},"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":"1702.02330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T09:01:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d306a157782dbbcc2494095902d4a5b3301d8121a73c2e04ea9c8d848202c27c","abstract_canon_sha256":"b69bca5979a93a57d131d773b7880483508e18a051403c38bc99724d2ac5e10c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.200257Z","signature_b64":"C4KoG6htv+hOezEtu0u6zYuaMsUbxF1aR15Fi66ZzW4JnYLJ5kaaAHcwa6o4pmTaUxQ48n2FpxYxUGlP00fKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112e4f9e8656d2e98ae779b595bc64338c39367e9eb4f05bc30c6c00167ec25e","last_reissued_at":"2026-05-18T00:51:06.199879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.199879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Achievable Rate Region for Multiple-Access Channel with States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2017-02-08T09:01:18Z","abstract_excerpt":"The problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter characterization of the achievable rate region. As an example, we investigate the problem of doubly-dirty MAC with modulo-$4$ addition. It is shown that the sum-rate $R_1+R_2=1$ bits per channel use is achievable using the new scheme. Whereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates greater than $0.32$ are not achievable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02330","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":"1702.02330","created_at":"2026-05-18T00:51:06.199938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02330v1","created_at":"2026-05-18T00:51:06.199938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02330","created_at":"2026-05-18T00:51:06.199938+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEXE7HUGK3JO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEXE7HUGK3JOTCXH","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEXE7HUG","created_at":"2026-05-18T12:31:10.602751+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/CEXE7HUGK3JOTCXHPG2ZLPDEGO","json":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO.json","graph_json":"https://pith.science/api/pith-number/CEXE7HUGK3JOTCXHPG2ZLPDEGO/graph.json","events_json":"https://pith.science/api/pith-number/CEXE7HUGK3JOTCXHPG2ZLPDEGO/events.json","paper":"https://pith.science/paper/CEXE7HUG"},"agent_actions":{"view_html":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO","download_json":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO.json","view_paper":"https://pith.science/paper/CEXE7HUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02330&json=true","fetch_graph":"https://pith.science/api/pith-number/CEXE7HUGK3JOTCXHPG2ZLPDEGO/graph.json","fetch_events":"https://pith.science/api/pith-number/CEXE7HUGK3JOTCXHPG2ZLPDEGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/action/storage_attestation","attest_author":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/action/author_attestation","sign_citation":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/action/citation_signature","submit_replication":"https://pith.science/pith/CEXE7HUGK3JOTCXHPG2ZLPDEGO/action/replication_record"}},"created_at":"2026-05-18T00:51:06.199938+00:00","updated_at":"2026-05-18T00:51:06.199938+00:00"}