{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZFVLBOXXODEQSX7K5C6JS3CKIC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e06061d765b50327574dd96c7c93971eb94db46fcbf5359d2029886bf7cdfe43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T06:56:10Z","title_canon_sha256":"ef01fc8fb2e0f37835d19274c3dff11ac2cba4a0512dbd8f8dc6cb6b3a81c470"},"schema_version":"1.0","source":{"id":"1505.04887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04887","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04887v1","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04887","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZFVLBOXXODEQ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZFVLBOXXODEQSX7K","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZFVLBOXX","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:fbea142781cfd2e31e1297cd4b548f8c5744a64832deb3c0d04a7224b81d7c0b","target":"graph","created_at":"2026-05-18T02:05:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Chiao-En Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T06:56:10Z","title":"A Near-optimal User Ordering Algorithm for Non-iterative Interference Alignment Transceiver Design in MIMO Interfering Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04887","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:283ccd00a4c5ffdea129e68629244af4f50df95ead82edf3ca5fe92c85818171","target":"record","created_at":"2026-05-18T02:05:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e06061d765b50327574dd96c7c93971eb94db46fcbf5359d2029886bf7cdfe43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T06:56:10Z","title_canon_sha256":"ef01fc8fb2e0f37835d19274c3dff11ac2cba4a0512dbd8f8dc6cb6b3a81c470"},"schema_version":"1.0","source":{"id":"1505.04887","kind":"arxiv","version":1}},"canonical_sha256":"c96ab0baf770c9095feae8bc996c4a40abf7976b500211883fa8ebf308007ecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c96ab0baf770c9095feae8bc996c4a40abf7976b500211883fa8ebf308007ecc","first_computed_at":"2026-05-18T02:05:22.862880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:22.862880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZP94vq6PgnusMf8IiL/xEC2lwqHzPxuHQma/Sl3dmDB3GQYQ5pofeK/rW5lWdmttZCZiKAwdZoZS7LB2BWABg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:22.863585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:283ccd00a4c5ffdea129e68629244af4f50df95ead82edf3ca5fe92c85818171","sha256:fbea142781cfd2e31e1297cd4b548f8c5744a64832deb3c0d04a7224b81d7c0b"],"state_sha256":"e983e2f3b022feb3bcea83c8e7f23c7acd63a26a3d7cfa029b803afcd7e44f0f"}