{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:566U4GZKJRQWIYQWDUAIJQ4PQZ","short_pith_number":"pith:566U4GZK","schema_version":"1.0","canonical_sha256":"efbd4e1b2a4c616462161d0084c38f864528837a3a92dfba25e5ff6f3183d988","source":{"kind":"arxiv","id":"1210.0891","version":2},"attestation_state":"computed","paper":{"title":"A Reconfigurable Distributed Algorithm for K-user MIMO Interference Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Constantinos B. Papadias, George C. Alexandropoulos","submitted_at":"2012-10-02T19:42:31Z","abstract_excerpt":"It is already well-known that interference alignment (IA) achieves the sum capacity of the K-user interference channel at the high interference regime. On the other hand, it is intuitively clear that when the interference levels are very low, a sum-rate scaling of K (as opposed to K/2 for IA) should be accessed at high signal-to-noise ratio values by simple (\"myopic\") single-link multiple-input multiple-output (MIMO) techniques such as waterfilling. Recent results have indicated that in certain low-to-moderate interference cases, treating interference as noise may in fact be preferable. In thi"},"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":"1210.0891","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-02T19:42:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"99b48f96db550e409e82aa3da6eb331453cf83c89d1d3ff0a0e06f277880b29b","abstract_canon_sha256":"259c7a012e6a47a8d2e41515b7e0caea76afeb99632c1b8346a6fd835c9d7e40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:31.605152Z","signature_b64":"E0sUN65CK+k60kJgpheePj/Bx/LjBJpsxt6fdAR0V+EEUNy/9gUhpUs4IDRSn2yApG6OA6K5pDkFZzg2UdydAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efbd4e1b2a4c616462161d0084c38f864528837a3a92dfba25e5ff6f3183d988","last_reissued_at":"2026-05-18T03:32:31.604410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:31.604410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reconfigurable Distributed Algorithm for K-user MIMO Interference Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Constantinos B. Papadias, George C. Alexandropoulos","submitted_at":"2012-10-02T19:42:31Z","abstract_excerpt":"It is already well-known that interference alignment (IA) achieves the sum capacity of the K-user interference channel at the high interference regime. On the other hand, it is intuitively clear that when the interference levels are very low, a sum-rate scaling of K (as opposed to K/2 for IA) should be accessed at high signal-to-noise ratio values by simple (\"myopic\") single-link multiple-input multiple-output (MIMO) techniques such as waterfilling. Recent results have indicated that in certain low-to-moderate interference cases, treating interference as noise may in fact be preferable. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0891","kind":"arxiv","version":2},"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":"1210.0891","created_at":"2026-05-18T03:32:31.604553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0891v2","created_at":"2026-05-18T03:32:31.604553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0891","created_at":"2026-05-18T03:32:31.604553+00:00"},{"alias_kind":"pith_short_12","alias_value":"566U4GZKJRQW","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"566U4GZKJRQWIYQW","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"566U4GZK","created_at":"2026-05-18T12:26:53.410803+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/566U4GZKJRQWIYQWDUAIJQ4PQZ","json":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ.json","graph_json":"https://pith.science/api/pith-number/566U4GZKJRQWIYQWDUAIJQ4PQZ/graph.json","events_json":"https://pith.science/api/pith-number/566U4GZKJRQWIYQWDUAIJQ4PQZ/events.json","paper":"https://pith.science/paper/566U4GZK"},"agent_actions":{"view_html":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ","download_json":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ.json","view_paper":"https://pith.science/paper/566U4GZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0891&json=true","fetch_graph":"https://pith.science/api/pith-number/566U4GZKJRQWIYQWDUAIJQ4PQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/566U4GZKJRQWIYQWDUAIJQ4PQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ/action/storage_attestation","attest_author":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ/action/author_attestation","sign_citation":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ/action/citation_signature","submit_replication":"https://pith.science/pith/566U4GZKJRQWIYQWDUAIJQ4PQZ/action/replication_record"}},"created_at":"2026-05-18T03:32:31.604553+00:00","updated_at":"2026-05-18T03:32:31.604553+00:00"}