{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZFVLBOXXODEQSX7K5C6JS3CKIC","short_pith_number":"pith:ZFVLBOXX","schema_version":"1.0","canonical_sha256":"c96ab0baf770c9095feae8bc996c4a40abf7976b500211883fa8ebf308007ecc","source":{"kind":"arxiv","id":"1505.04887","version":1},"attestation_state":"computed","paper":{"title":"A Near-optimal User Ordering Algorithm for Non-iterative Interference Alignment Transceiver Design in MIMO Interfering Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chiao-En Chen","submitted_at":"2015-05-19T06:56:10Z","abstract_excerpt":"Interference alignment (IA) has recently emerged as a promising interference mitigation technique for interference networks. In this letter, we focus on the IA non-iterative transceiver design problem in a multiple-input-multiple-output interfering broadcast channel (MIMO-IBC), and observed that there is previously unexploited flexibility in different permutations of user ordering. By choosing a good user ordering for a pre-determined IA inter-channel-interference allocation, an improved transceiver design can be accomplished. In order to achieve a more practical performance-complexity tradeof"},"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":"1505.04887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T06:56:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ef01fc8fb2e0f37835d19274c3dff11ac2cba4a0512dbd8f8dc6cb6b3a81c470","abstract_canon_sha256":"e06061d765b50327574dd96c7c93971eb94db46fcbf5359d2029886bf7cdfe43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:22.863585Z","signature_b64":"MZP94vq6PgnusMf8IiL/xEC2lwqHzPxuHQma/Sl3dmDB3GQYQ5pofeK/rW5lWdmttZCZiKAwdZoZS7LB2BWABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c96ab0baf770c9095feae8bc996c4a40abf7976b500211883fa8ebf308007ecc","last_reissued_at":"2026-05-18T02:05:22.862880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:22.862880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-optimal User Ordering Algorithm for Non-iterative Interference Alignment Transceiver Design in MIMO Interfering Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chiao-En Chen","submitted_at":"2015-05-19T06:56:10Z","abstract_excerpt":"Interference alignment (IA) has recently emerged as a promising interference mitigation technique for interference networks. In this letter, we focus on the IA non-iterative transceiver design problem in a multiple-input-multiple-output interfering broadcast channel (MIMO-IBC), and observed that there is previously unexploited flexibility in different permutations of user ordering. By choosing a good user ordering for a pre-determined IA inter-channel-interference allocation, an improved transceiver design can be accomplished. In order to achieve a more practical performance-complexity tradeof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04887","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":"1505.04887","created_at":"2026-05-18T02:05:22.862992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04887v1","created_at":"2026-05-18T02:05:22.862992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04887","created_at":"2026-05-18T02:05:22.862992+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFVLBOXXODEQ","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFVLBOXXODEQSX7K","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFVLBOXX","created_at":"2026-05-18T12:29:52.810259+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/ZFVLBOXXODEQSX7K5C6JS3CKIC","json":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC.json","graph_json":"https://pith.science/api/pith-number/ZFVLBOXXODEQSX7K5C6JS3CKIC/graph.json","events_json":"https://pith.science/api/pith-number/ZFVLBOXXODEQSX7K5C6JS3CKIC/events.json","paper":"https://pith.science/paper/ZFVLBOXX"},"agent_actions":{"view_html":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC","download_json":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC.json","view_paper":"https://pith.science/paper/ZFVLBOXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04887&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFVLBOXXODEQSX7K5C6JS3CKIC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFVLBOXXODEQSX7K5C6JS3CKIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC/action/storage_attestation","attest_author":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC/action/author_attestation","sign_citation":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC/action/citation_signature","submit_replication":"https://pith.science/pith/ZFVLBOXXODEQSX7K5C6JS3CKIC/action/replication_record"}},"created_at":"2026-05-18T02:05:22.862992+00:00","updated_at":"2026-05-18T02:05:22.862992+00:00"}