{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3A5DAEAQ55GIP6N3MT2PL7GAIG","short_pith_number":"pith:3A5DAEAQ","schema_version":"1.0","canonical_sha256":"d83a301010ef4c87f9bb64f4f5fcc0419d6792189ff68d4a9c80d1d45f12e2b6","source":{"kind":"arxiv","id":"1310.2435","version":1},"attestation_state":"computed","paper":{"title":"Interference Alignment via Message-Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerald Matz, Maxime Guillaud, Mohsen Rezaee","submitted_at":"2013-10-09T11:32:24Z","abstract_excerpt":"We introduce an iterative solution to the problem of interference alignment (IA) over MIMO channels based on a message-passing formulation. We propose a parameterization of the messages that enables the computation of IA precoders by a min-sum algorithm over continuous variable spaces -- under this parameterization, suitable approximations of the messages can be computed in closed-form. We show that the iterative leakage minimization algorithm of Cadambe et al. is a special case of our message-passing algorithm, obtained for a particular schedule. Finally, we show that the proposed algorithm c"},"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":"1310.2435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-09T11:32:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1e2477732ae6bf43c559c84a1c63ac78305c83d93c30923ea07bdeaeab45f0a1","abstract_canon_sha256":"1106119a1382a25db3d9f0f7aec3d9be332778feb9d53311758a3518c0968df9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:16.726782Z","signature_b64":"/Q12hKMOy2XWIqEfrBAwfM8sQc0m5IN+ekzziOh6MO+qjPAaXgrhOC7BuAhaom5R6CpL+zewNeV+TN02vUYfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d83a301010ef4c87f9bb64f4f5fcc0419d6792189ff68d4a9c80d1d45f12e2b6","last_reissued_at":"2026-05-18T00:58:16.726064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:16.726064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference Alignment via Message-Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerald Matz, Maxime Guillaud, Mohsen Rezaee","submitted_at":"2013-10-09T11:32:24Z","abstract_excerpt":"We introduce an iterative solution to the problem of interference alignment (IA) over MIMO channels based on a message-passing formulation. We propose a parameterization of the messages that enables the computation of IA precoders by a min-sum algorithm over continuous variable spaces -- under this parameterization, suitable approximations of the messages can be computed in closed-form. We show that the iterative leakage minimization algorithm of Cadambe et al. is a special case of our message-passing algorithm, obtained for a particular schedule. Finally, we show that the proposed algorithm c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2435","kind":"arxiv","version":1},"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":"1310.2435","created_at":"2026-05-18T00:58:16.726164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2435v1","created_at":"2026-05-18T00:58:16.726164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2435","created_at":"2026-05-18T00:58:16.726164+00:00"},{"alias_kind":"pith_short_12","alias_value":"3A5DAEAQ55GI","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3A5DAEAQ55GIP6N3","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3A5DAEAQ","created_at":"2026-05-18T12:27:32.513160+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/3A5DAEAQ55GIP6N3MT2PL7GAIG","json":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG.json","graph_json":"https://pith.science/api/pith-number/3A5DAEAQ55GIP6N3MT2PL7GAIG/graph.json","events_json":"https://pith.science/api/pith-number/3A5DAEAQ55GIP6N3MT2PL7GAIG/events.json","paper":"https://pith.science/paper/3A5DAEAQ"},"agent_actions":{"view_html":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG","download_json":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG.json","view_paper":"https://pith.science/paper/3A5DAEAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2435&json=true","fetch_graph":"https://pith.science/api/pith-number/3A5DAEAQ55GIP6N3MT2PL7GAIG/graph.json","fetch_events":"https://pith.science/api/pith-number/3A5DAEAQ55GIP6N3MT2PL7GAIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG/action/storage_attestation","attest_author":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG/action/author_attestation","sign_citation":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG/action/citation_signature","submit_replication":"https://pith.science/pith/3A5DAEAQ55GIP6N3MT2PL7GAIG/action/replication_record"}},"created_at":"2026-05-18T00:58:16.726164+00:00","updated_at":"2026-05-18T00:58:16.726164+00:00"}