{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WWNMHKNIBZHOHWNOS2ENR4Z6LS","short_pith_number":"pith:WWNMHKNI","schema_version":"1.0","canonical_sha256":"b59ac3a9a80e4ee3d9ae9688d8f33e5c941ce710a7805cfa96a97438ce925bb8","source":{"kind":"arxiv","id":"1301.6196","version":3},"attestation_state":"computed","paper":{"title":"On the Number of Interference Alignment Solutions for the K-User MIMO Channel with Constant Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlos Beltr\\'an, Ignacio Santamar\\'ia, \\'Oscar Gonz\\'alez","submitted_at":"2013-01-26T00:59:00Z","abstract_excerpt":"In this paper, we study the number of different interference alignment (IA) solutions in a K-user multiple-input multiple-output (MIMO) interference channel, when the alignment is performed via beamforming and no symbol extensions are allowed. We focus on the case where the number of IA equations matches the number of variables. In this situation, the number of IA solutions is finite and constant for any channel realization out of a zero-measure set and, as we prove in the paper, it is given by an integral formula that can be numerically approximated using Monte Carlo integration methods. More"},"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":"1301.6196","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T00:59:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eeeea3e9fce527ff8e00819ef9ad55fa25832da4a9feebfd0aefb607a5ee82fa","abstract_canon_sha256":"8aa75b6217cc18dd522298dcbe271c20105063f01ed7eaf7eb0a40e5304a4ec5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:51.949869Z","signature_b64":"XrRovOMHo8xrHsetHDdKrT+D79vv2LKnazWxxgeO6a5Ug0xwKZKlu0qCBRvw6SUTZyHbpA5AlFwIgElr3kIMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b59ac3a9a80e4ee3d9ae9688d8f33e5c941ce710a7805cfa96a97438ce925bb8","last_reissued_at":"2026-05-18T02:50:51.949344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:51.949344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Number of Interference Alignment Solutions for the K-User MIMO Channel with Constant Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlos Beltr\\'an, Ignacio Santamar\\'ia, \\'Oscar Gonz\\'alez","submitted_at":"2013-01-26T00:59:00Z","abstract_excerpt":"In this paper, we study the number of different interference alignment (IA) solutions in a K-user multiple-input multiple-output (MIMO) interference channel, when the alignment is performed via beamforming and no symbol extensions are allowed. We focus on the case where the number of IA equations matches the number of variables. In this situation, the number of IA solutions is finite and constant for any channel realization out of a zero-measure set and, as we prove in the paper, it is given by an integral formula that can be numerically approximated using Monte Carlo integration methods. More"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6196","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":"1301.6196","created_at":"2026-05-18T02:50:51.949444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6196v3","created_at":"2026-05-18T02:50:51.949444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6196","created_at":"2026-05-18T02:50:51.949444+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWNMHKNIBZHO","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWNMHKNIBZHOHWNO","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWNMHKNI","created_at":"2026-05-18T12:28:06.772260+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/WWNMHKNIBZHOHWNOS2ENR4Z6LS","json":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS.json","graph_json":"https://pith.science/api/pith-number/WWNMHKNIBZHOHWNOS2ENR4Z6LS/graph.json","events_json":"https://pith.science/api/pith-number/WWNMHKNIBZHOHWNOS2ENR4Z6LS/events.json","paper":"https://pith.science/paper/WWNMHKNI"},"agent_actions":{"view_html":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS","download_json":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS.json","view_paper":"https://pith.science/paper/WWNMHKNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6196&json=true","fetch_graph":"https://pith.science/api/pith-number/WWNMHKNIBZHOHWNOS2ENR4Z6LS/graph.json","fetch_events":"https://pith.science/api/pith-number/WWNMHKNIBZHOHWNOS2ENR4Z6LS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS/action/storage_attestation","attest_author":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS/action/author_attestation","sign_citation":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS/action/citation_signature","submit_replication":"https://pith.science/pith/WWNMHKNIBZHOHWNOS2ENR4Z6LS/action/replication_record"}},"created_at":"2026-05-18T02:50:51.949444+00:00","updated_at":"2026-05-18T02:50:51.949444+00:00"}