{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DLWRHGI4OAPVVLQ7SICFCFU3WI","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":"427b8878a96c9a87e6a36bab5acc6a9757ccf0f820604755e354849e1501084e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:10:29Z","title_canon_sha256":"74dcdcd80fba4fae050e970d817a23b9abbd8ed95d3a05ba28a5bffa797788c8"},"schema_version":"1.0","source":{"id":"1105.0286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0286","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0286v1","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0286","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"DLWRHGI4OAPV","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DLWRHGI4OAPVVLQ7","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DLWRHGI4","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:5787bf4cbec64a173f6f88ddce6b381ed0cd49357e1138f119a5fa07aefc5ea1","target":"graph","created_at":"2026-05-18T01:08:13Z","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":"Recent works on MIMO interference channels have shown that interference alignment can significantly increase the achievable degrees of freedom (DoF) of the network. However, most of these works have assumed a fully connected interference graph. In this paper, we investigate how the partial connectivity can be exploited to enhance system performance in MIMO interference networks. We propose a novel interference mitigation scheme which introduces constraints for the signal subspaces of the precoders and decorrelators to mitigate \"many\" interference nulling constraints at a cost of \"little\" freed","authors_text":"Liangzhong Ruan, Vincent K.N. Lau","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:10:29Z","title":"Dynamic Interference Mitigation for Generalized Partially Connected Quasi-static MIMO Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0286","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:e1502e3c17cc34514b531362132d1ab76e82a4837118e5c28240ae2e024cc3ba","target":"record","created_at":"2026-05-18T01:08:13Z","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":"427b8878a96c9a87e6a36bab5acc6a9757ccf0f820604755e354849e1501084e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:10:29Z","title_canon_sha256":"74dcdcd80fba4fae050e970d817a23b9abbd8ed95d3a05ba28a5bffa797788c8"},"schema_version":"1.0","source":{"id":"1105.0286","kind":"arxiv","version":1}},"canonical_sha256":"1aed13991c701f5aae1f920451169bb230233389dfab3f92d5e9351ca9f9eb29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aed13991c701f5aae1f920451169bb230233389dfab3f92d5e9351ca9f9eb29","first_computed_at":"2026-05-18T01:08:13.590983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.590983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cWunrAi+iG8rLmEGcWZH/Aps5gvjJo3X5lkXmWu5Buhn/nin9w1qwCmxpPoQn/cPV+wDWOFkj2oxEnxR39LzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.591546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1502e3c17cc34514b531362132d1ab76e82a4837118e5c28240ae2e024cc3ba","sha256:5787bf4cbec64a173f6f88ddce6b381ed0cd49357e1138f119a5fa07aefc5ea1"],"state_sha256":"52070376924ba634c21b913da79e0e7a92d580666d7cbf2e326c1f0b28e0098a"}