{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:N65NJB5VSBSHN5NAMOHFZLUGRV","short_pith_number":"pith:N65NJB5V","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"},"canonical_sha256":"6fbad487b5906476f5a0638e5cae868d5d4fedcf0a05fdb6648b380e6b687bc0","source":{"kind":"arxiv","id":"1010.0476","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0476","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0476v3","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0476","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"N65NJB5VSBSH","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N65NJB5VSBSHN5NA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N65NJB5V","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:N65NJB5VSBSHN5NAMOHFZLUGRV","target":"record","payload":{"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"},"canonical_sha256":"6fbad487b5906476f5a0638e5cae868d5d4fedcf0a05fdb6648b380e6b687bc0","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"},"source_kind":"arxiv","source_id":"1010.0476","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7KY+c96UhNcdV5yxY9ojHDf5LzlN1okS9GCr1RNnGGkGhwfjB3k89cRGz9Bx/oeqCrOu/AJ318LMCrPD7a2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:54:34.065284Z"},"content_sha256":"def74f6aba9b1a8d2d4466aba83d2b7012dfbb639534bda6a98ac2fc6ab784d9","schema_version":"1.0","event_id":"sha256:def74f6aba9b1a8d2d4466aba83d2b7012dfbb639534bda6a98ac2fc6ab784d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:N65NJB5VSBSHN5NAMOHFZLUGRV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qSgrnfLQGVTDxntugBLHDI918f1fHAGW/9/5g4DxLDnM0h1uyrKFO2Zz+dOi5LSWlWHPNF8rAjfUrdECyazAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:54:34.065662Z"},"content_sha256":"d7d66550be61749c14e5dabc6ef19a9678d2a251bde2d08c47dab27d0e7b0018","schema_version":"1.0","event_id":"sha256:d7d66550be61749c14e5dabc6ef19a9678d2a251bde2d08c47dab27d0e7b0018"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/bundle.json","state_url":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T06:54:34Z","links":{"resolver":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV","bundle":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/bundle.json","state":"https://pith.science/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N65NJB5VSBSHN5NAMOHFZLUGRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:N65NJB5VSBSHN5NAMOHFZLUGRV","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":"5a880615f42aaf3483930c62c148ed91efea5e751c5bfaa61b6eaff3c59df558","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T05:52:34Z","title_canon_sha256":"53b8c0eacbc61488d29c3655940f63595d041591b75537d5c341d90ec570f4ff"},"schema_version":"1.0","source":{"id":"1010.0476","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0476","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0476v3","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0476","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"N65NJB5VSBSH","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N65NJB5VSBSHN5NA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N65NJB5V","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:d7d66550be61749c14e5dabc6ef19a9678d2a251bde2d08c47dab27d0e7b0018","target":"graph","created_at":"2026-05-18T02:23:47Z","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":"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, ","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos","cross_cats":["cs.DC","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T05:52:34Z","title":"Interference Alignment as a Rank Constrained Rank Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0476","kind":"arxiv","version":3},"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:def74f6aba9b1a8d2d4466aba83d2b7012dfbb639534bda6a98ac2fc6ab784d9","target":"record","created_at":"2026-05-18T02:23:47Z","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":"5a880615f42aaf3483930c62c148ed91efea5e751c5bfaa61b6eaff3c59df558","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T05:52:34Z","title_canon_sha256":"53b8c0eacbc61488d29c3655940f63595d041591b75537d5c341d90ec570f4ff"},"schema_version":"1.0","source":{"id":"1010.0476","kind":"arxiv","version":3}},"canonical_sha256":"6fbad487b5906476f5a0638e5cae868d5d4fedcf0a05fdb6648b380e6b687bc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fbad487b5906476f5a0638e5cae868d5d4fedcf0a05fdb6648b380e6b687bc0","first_computed_at":"2026-05-18T02:23:47.501267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:47.501267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"imWI2HoX2ssElfQSaSzlKMHjK4kRvoh4SJonD16skVtvy1MFqEkXGYj7dc2MISQUhY00PFqKAwBTFwLFRKyrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:47.502112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0476","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def74f6aba9b1a8d2d4466aba83d2b7012dfbb639534bda6a98ac2fc6ab784d9","sha256:d7d66550be61749c14e5dabc6ef19a9678d2a251bde2d08c47dab27d0e7b0018"],"state_sha256":"a5fb5bf496556c77f3a4cb151d0903c5ac7ef5468f4947ae65e771b3b75550cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TU/sPeR7Cbr4e1+L/vZOTKB6E1Z8EjoQF5S7YKp66w92D/BTZ3zUKDxQGSzV7rrYVgSqJavVhbI4YgJuP0pWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:54:34.067671Z","bundle_sha256":"fcf30b0d5910ec1c1642ad338e5cc300c9d0f48760d62cb6afca03af793ec6dc"}}