{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CFRIAB5G5SKBPYB4FDCT4OSOUG","short_pith_number":"pith:CFRIAB5G","schema_version":"1.0","canonical_sha256":"11628007a6ec9417e03c28c53e3a4ea181b7444601bba07c18d2133766b563c1","source":{"kind":"arxiv","id":"2307.01095","version":1},"attestation_state":"computed","paper":{"title":"Coded Orthogonal Modulation for the Multi-Antenna Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alejandro Lancho, Alexander Fengler, Yury Polyanskiy","submitted_at":"2023-07-03T15:16:42Z","abstract_excerpt":"This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully achieve the fundamental limits (even asymptotically) the decoder needs to jointly estimate all user codewords, doing which directly is computationally infeasible. We propose a low-complexity solution, termed coded orthogonal modulation multiple-access (COMMA), in which users first encode their messages via a long (multi-user interference aware) outer code o"},"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":"2307.01095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-03T15:16:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"537d5dccda1b6ead458de4fcab26cc5ab2bc38fa2224fc1e711077ac5fa32c38","abstract_canon_sha256":"427566a1e3dd7b3469da7ef87be8ad81f2ca54db4de767a71cbc3a452a574a1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:04.063802Z","signature_b64":"yFaqjvnyL9l7MhJsHymIEBti9dWqHiHqKUREwzUyZctHGQWW7FbwTACi7t/QjZaut1EudWngiLDMIgbSFwtJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11628007a6ec9417e03c28c53e3a4ea181b7444601bba07c18d2133766b563c1","last_reissued_at":"2026-07-05T06:27:04.063346Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:04.063346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Orthogonal Modulation for the Multi-Antenna Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alejandro Lancho, Alexander Fengler, Yury Polyanskiy","submitted_at":"2023-07-03T15:16:42Z","abstract_excerpt":"This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully achieve the fundamental limits (even asymptotically) the decoder needs to jointly estimate all user codewords, doing which directly is computationally infeasible. We propose a low-complexity solution, termed coded orthogonal modulation multiple-access (COMMA), in which users first encode their messages via a long (multi-user interference aware) outer code o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01095","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.01095/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.01095","created_at":"2026-07-05T06:27:04.063405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01095v1","created_at":"2026-07-05T06:27:04.063405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01095","created_at":"2026-07-05T06:27:04.063405+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFRIAB5G5SKB","created_at":"2026-07-05T06:27:04.063405+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFRIAB5G5SKBPYB4","created_at":"2026-07-05T06:27:04.063405+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFRIAB5G","created_at":"2026-07-05T06:27:04.063405+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/CFRIAB5G5SKBPYB4FDCT4OSOUG","json":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG.json","graph_json":"https://pith.science/api/pith-number/CFRIAB5G5SKBPYB4FDCT4OSOUG/graph.json","events_json":"https://pith.science/api/pith-number/CFRIAB5G5SKBPYB4FDCT4OSOUG/events.json","paper":"https://pith.science/paper/CFRIAB5G"},"agent_actions":{"view_html":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG","download_json":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG.json","view_paper":"https://pith.science/paper/CFRIAB5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01095&json=true","fetch_graph":"https://pith.science/api/pith-number/CFRIAB5G5SKBPYB4FDCT4OSOUG/graph.json","fetch_events":"https://pith.science/api/pith-number/CFRIAB5G5SKBPYB4FDCT4OSOUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG/action/storage_attestation","attest_author":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG/action/author_attestation","sign_citation":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG/action/citation_signature","submit_replication":"https://pith.science/pith/CFRIAB5G5SKBPYB4FDCT4OSOUG/action/replication_record"}},"created_at":"2026-07-05T06:27:04.063405+00:00","updated_at":"2026-07-05T06:27:04.063405+00:00"}