{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5QMKBGUIHCGR6BFJD6B5RUCAJB","short_pith_number":"pith:5QMKBGUI","schema_version":"1.0","canonical_sha256":"ec18a09a88388d1f04a91f83d8d0404862e702d995e8b9ec16c64ecb6ecba068","source":{"kind":"arxiv","id":"1009.5121","version":3},"attestation_state":"computed","paper":{"title":"Noncoherent Interference Alignment: Trade Signal Power for Diversity Towards Multiplexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Haishi Ning, Maria~Estela","submitted_at":"2010-09-26T20:02:46Z","abstract_excerpt":"This paper proposes the first known universal interference alignment scheme for general $(1\\times{}1)^K$ interference networks, either Gaussian or deterministic, with only 2 symbol extension. While interference alignment is theoretically powerful to increase the total network throughput tremendously, no existing scheme can achieve the degree of freedom upper bound exactly with finite complexity. This paper starts with detailed analysis of the diagonality problem of naive symbol extension in small $(1\\times1)^3$ networks, a technique widely regarded as necessary to achieve interference alignmen"},"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":"1009.5121","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-26T20:02:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"480d6a90b9fd1bfbfd552cd7d018fb1b66a27957506ef8cf4468975b0be1e6ea","abstract_canon_sha256":"68a3e44431c45dbe24e0d080c0be716138d3a000c5b2efb0c6cbff2b7b8e1450"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.005445Z","signature_b64":"SdYAp9gD8DXR9AoVbh4wTpWqavotYV2PA7m9CzhBLej/ZdXl6gVvhv1atKjdnGkom9yX278VI+L6cbeVcI5SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec18a09a88388d1f04a91f83d8d0404862e702d995e8b9ec16c64ecb6ecba068","last_reissued_at":"2026-05-18T03:37:42.004675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.004675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noncoherent Interference Alignment: Trade Signal Power for Diversity Towards Multiplexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Haishi Ning, Maria~Estela","submitted_at":"2010-09-26T20:02:46Z","abstract_excerpt":"This paper proposes the first known universal interference alignment scheme for general $(1\\times{}1)^K$ interference networks, either Gaussian or deterministic, with only 2 symbol extension. While interference alignment is theoretically powerful to increase the total network throughput tremendously, no existing scheme can achieve the degree of freedom upper bound exactly with finite complexity. This paper starts with detailed analysis of the diagonality problem of naive symbol extension in small $(1\\times1)^3$ networks, a technique widely regarded as necessary to achieve interference alignmen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5121","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":"1009.5121","created_at":"2026-05-18T03:37:42.004809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5121v3","created_at":"2026-05-18T03:37:42.004809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5121","created_at":"2026-05-18T03:37:42.004809+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QMKBGUIHCGR","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QMKBGUIHCGR6BFJ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QMKBGUI","created_at":"2026-05-18T12:26:04.259169+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/5QMKBGUIHCGR6BFJD6B5RUCAJB","json":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB.json","graph_json":"https://pith.science/api/pith-number/5QMKBGUIHCGR6BFJD6B5RUCAJB/graph.json","events_json":"https://pith.science/api/pith-number/5QMKBGUIHCGR6BFJD6B5RUCAJB/events.json","paper":"https://pith.science/paper/5QMKBGUI"},"agent_actions":{"view_html":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB","download_json":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB.json","view_paper":"https://pith.science/paper/5QMKBGUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5121&json=true","fetch_graph":"https://pith.science/api/pith-number/5QMKBGUIHCGR6BFJD6B5RUCAJB/graph.json","fetch_events":"https://pith.science/api/pith-number/5QMKBGUIHCGR6BFJD6B5RUCAJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB/action/storage_attestation","attest_author":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB/action/author_attestation","sign_citation":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB/action/citation_signature","submit_replication":"https://pith.science/pith/5QMKBGUIHCGR6BFJD6B5RUCAJB/action/replication_record"}},"created_at":"2026-05-18T03:37:42.004809+00:00","updated_at":"2026-05-18T03:37:42.004809+00:00"}