{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KMEPRP3UYWJAYELQ4BETJK5UEL","short_pith_number":"pith:KMEPRP3U","schema_version":"1.0","canonical_sha256":"5308f8bf74c5920c1170e04934abb422c87886d702e27d23079936d2b46e201b","source":{"kind":"arxiv","id":"1105.5981","version":2},"attestation_state":"computed","paper":{"title":"Modulation for MIMO Networks with Several Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Ayal Hitron, Uri Erez","submitted_at":"2011-05-30T13:11:04Z","abstract_excerpt":"In a recent work, a capacity-achieving scheme for the common-message two-user MIMO broadcast channel, based on single-stream coding and decoding, was described. This was obtained via a novel joint unitary triangularization which is applied to the corresponding channel matrices. In this work, the triangularization is generalized, to any (finite) number of matrices, allowing multi-user applications. To that end, multiple channel uses are jointly treated, in a manner reminiscent of space-time coding. As opposed to the two-user case, in the general case there does not always exist a perfect (capac"},"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":"1105.5981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T13:11:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22163a361b3cc21be540778f166a5f98e2dfc110d229d1dbd68151346d4a45a7","abstract_canon_sha256":"c421940d25353901958cf6d2c945dafb6aa79cfa31dc9d27e048475a84d84683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:00.241994Z","signature_b64":"UgNesxCAWzcW6Su5EKP0otQTKldBJDUN2UMQEcVeHcZbh8Zayo3yevQDqqycgoUpAKMJzXC2rIM7TMpwkoJlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5308f8bf74c5920c1170e04934abb422c87886d702e27d23079936d2b46e201b","last_reissued_at":"2026-05-18T04:21:00.241420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:00.241420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modulation for MIMO Networks with Several Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Ayal Hitron, Uri Erez","submitted_at":"2011-05-30T13:11:04Z","abstract_excerpt":"In a recent work, a capacity-achieving scheme for the common-message two-user MIMO broadcast channel, based on single-stream coding and decoding, was described. This was obtained via a novel joint unitary triangularization which is applied to the corresponding channel matrices. In this work, the triangularization is generalized, to any (finite) number of matrices, allowing multi-user applications. To that end, multiple channel uses are jointly treated, in a manner reminiscent of space-time coding. As opposed to the two-user case, in the general case there does not always exist a perfect (capac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5981","kind":"arxiv","version":2},"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":"1105.5981","created_at":"2026-05-18T04:21:00.241491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5981v2","created_at":"2026-05-18T04:21:00.241491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5981","created_at":"2026-05-18T04:21:00.241491+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMEPRP3UYWJA","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMEPRP3UYWJAYELQ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMEPRP3U","created_at":"2026-05-18T12:26:32.869790+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/KMEPRP3UYWJAYELQ4BETJK5UEL","json":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL.json","graph_json":"https://pith.science/api/pith-number/KMEPRP3UYWJAYELQ4BETJK5UEL/graph.json","events_json":"https://pith.science/api/pith-number/KMEPRP3UYWJAYELQ4BETJK5UEL/events.json","paper":"https://pith.science/paper/KMEPRP3U"},"agent_actions":{"view_html":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL","download_json":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL.json","view_paper":"https://pith.science/paper/KMEPRP3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5981&json=true","fetch_graph":"https://pith.science/api/pith-number/KMEPRP3UYWJAYELQ4BETJK5UEL/graph.json","fetch_events":"https://pith.science/api/pith-number/KMEPRP3UYWJAYELQ4BETJK5UEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL/action/storage_attestation","attest_author":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL/action/author_attestation","sign_citation":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL/action/citation_signature","submit_replication":"https://pith.science/pith/KMEPRP3UYWJAYELQ4BETJK5UEL/action/replication_record"}},"created_at":"2026-05-18T04:21:00.241491+00:00","updated_at":"2026-05-18T04:21:00.241491+00:00"}