{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:N65NJB5VSBSHN5NAMOHFZLUGRV","short_pith_number":"pith:N65NJB5V","schema_version":"1.0","canonical_sha256":"6fbad487b5906476f5a0638e5cae868d5d4fedcf0a05fdb6648b380e6b687bc0","source":{"kind":"arxiv","id":"1010.0476","version":3},"attestation_state":"computed","paper":{"title":"Interference Alignment as a Rank Constrained Rank Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos","submitted_at":"2010-10-04T05:52:34Z","abstract_excerpt":"We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel is equivalent to a rank constrained rank minimization problem (RCRM), when the signal spaces span all available dimensions. The rank minimization corresponds to maximizing interference alignment (IA) so that interference spans the lowest dimensional subspace possible. The rank constraints account for the useful signal spaces spanning all available spatial dimensions. That way, we reformulate all IA requirements to requirements involving ranks. Then, "},"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":"1010.0476","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T05:52:34Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"53b8c0eacbc61488d29c3655940f63595d041591b75537d5c341d90ec570f4ff","abstract_canon_sha256":"5a880615f42aaf3483930c62c148ed91efea5e751c5bfaa61b6eaff3c59df558"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:47.502112Z","signature_b64":"imWI2HoX2ssElfQSaSzlKMHjK4kRvoh4SJonD16skVtvy1MFqEkXGYj7dc2MISQUhY00PFqKAwBTFwLFRKyrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fbad487b5906476f5a0638e5cae868d5d4fedcf0a05fdb6648b380e6b687bc0","last_reissued_at":"2026-05-18T02:23:47.501267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:47.501267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference Alignment as a Rank Constrained Rank Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos","submitted_at":"2010-10-04T05:52:34Z","abstract_excerpt":"We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel is equivalent to a rank constrained rank minimization problem (RCRM), when the signal spaces span all available dimensions. The rank minimization corresponds to maximizing interference alignment (IA) so that interference spans the lowest dimensional subspace possible. The rank constraints account for the useful signal spaces spanning all available spatial dimensions. That way, we reformulate all IA requirements to requirements involving ranks. Then, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0476","kind":"arxiv","version":3},"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":"1010.0476","created_at":"2026-05-18T02:23:47.501421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0476v3","created_at":"2026-05-18T02:23:47.501421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0476","created_at":"2026-05-18T02:23:47.501421+00:00"},{"alias_kind":"pith_short_12","alias_value":"N65NJB5VSBSH","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"N65NJB5VSBSHN5NA","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"N65NJB5V","created_at":"2026-05-18T12:26:10.704358+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/N65NJB5VSBSHN5NAMOHFZLUGRV","json":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV.json","graph_json":"https://pith.science/api/pith-number/N65NJB5VSBSHN5NAMOHFZLUGRV/graph.json","events_json":"https://pith.science/api/pith-number/N65NJB5VSBSHN5NAMOHFZLUGRV/events.json","paper":"https://pith.science/paper/N65NJB5V"},"agent_actions":{"view_html":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV","download_json":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV.json","view_paper":"https://pith.science/paper/N65NJB5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0476&json=true","fetch_graph":"https://pith.science/api/pith-number/N65NJB5VSBSHN5NAMOHFZLUGRV/graph.json","fetch_events":"https://pith.science/api/pith-number/N65NJB5VSBSHN5NAMOHFZLUGRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/action/storage_attestation","attest_author":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/action/author_attestation","sign_citation":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/action/citation_signature","submit_replication":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/action/replication_record"}},"created_at":"2026-05-18T02:23:47.501421+00:00","updated_at":"2026-05-18T02:23:47.501421+00:00"}