{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:CWLHKNNYSWZY3W2JEMJJCLCJ7Q","short_pith_number":"pith:CWLHKNNY","canonical_record":{"source":{"id":"0904.4343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-28T09:57:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"555dd12269913a21ad32615c6fdbb035b46c7e137a7bfb6bf33cc9fa00884cc9","abstract_canon_sha256":"469a8ca395fd9ea7c2aec0e608fcb534e529b9f23fb258427fdb2c3da1f526d2"},"schema_version":"1.0"},"canonical_sha256":"15967535b895b38ddb492312912c49fc06a1998026ee2dc6ec7affda23e113d7","source":{"kind":"arxiv","id":"0904.4343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4343","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4343v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4343","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"CWLHKNNYSWZY","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CWLHKNNYSWZY3W2J","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CWLHKNNY","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:CWLHKNNYSWZY3W2JEMJJCLCJ7Q","target":"record","payload":{"canonical_record":{"source":{"id":"0904.4343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-28T09:57:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"555dd12269913a21ad32615c6fdbb035b46c7e137a7bfb6bf33cc9fa00884cc9","abstract_canon_sha256":"469a8ca395fd9ea7c2aec0e608fcb534e529b9f23fb258427fdb2c3da1f526d2"},"schema_version":"1.0"},"canonical_sha256":"15967535b895b38ddb492312912c49fc06a1998026ee2dc6ec7affda23e113d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.215600Z","signature_b64":"Erp8X7DiZuetf/BAMtEQK4EtYhO42HqE18u0E3Y/LSwOKO9SeUQS2CNee3rStpOeM4IMsI/bTLNEk8HfC3VkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15967535b895b38ddb492312912c49fc06a1998026ee2dc6ec7affda23e113d7","last_reissued_at":"2026-05-18T00:57:58.215186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.215186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.4343","source_version":1,"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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lsv7BSU0EsZJFvCRxiCU9WFeE+VsO7FMDKU4jS+20y4boi0lC8ZJci9MhkfsH0OMh7iEaR5+3bSkUGngF8/iAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:13:42.692854Z"},"content_sha256":"a7fd6868ea8ea521d04e03e4fea6159c5ff1b2ecdf3c28f507752b21e927e704","schema_version":"1.0","event_id":"sha256:a7fd6868ea8ea521d04e03e4fea6159c5ff1b2ecdf3c28f507752b21e927e704"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:CWLHKNNYSWZY3W2JEMJJCLCJ7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Achievability of Interference Alignment in the K-User Constant MIMO Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erwin Riegler, Maxime Guillaud, Roland Tresch","submitted_at":"2009-04-28T09:57:52Z","abstract_excerpt":"Interference alignment in the K-user MIMO interference channel with constant channel coefficients is considered. A novel constructive method for finding the interference alignment solution is proposed for the case where the number of transmit antennas equals the number of receive antennas (NT = NR = N), the number of transmitter-receiver pairs equals K = N + 1, and all interference alignment multiplexing gains are one. The core of the method consists of solving an eigenvalue problem that incorporates the channel matrices of all interfering links. This procedure provides insight into the feasib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4343","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"},"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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3IaBiErSZxCVL7PYsLX67Xq1t1PldylPSFsSfsCWT5HOZjrAwBCtxjDmRooXXaZW4s1aKQ1rRmAf9wIb7FhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:13:42.693371Z"},"content_sha256":"3f7dd13f2f921ab90ca47bb78315a733e67f271782c5933e407d161c94dcddb4","schema_version":"1.0","event_id":"sha256:3f7dd13f2f921ab90ca47bb78315a733e67f271782c5933e407d161c94dcddb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWLHKNNYSWZY3W2JEMJJCLCJ7Q/bundle.json","state_url":"https://pith.science/pith/CWLHKNNYSWZY3W2JEMJJCLCJ7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWLHKNNYSWZY3W2JEMJJCLCJ7Q/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-05-31T00:13:42Z","links":{"resolver":"https://pith.science/pith/CWLHKNNYSWZY3W2JEMJJCLCJ7Q","bundle":"https://pith.science/pith/CWLHKNNYSWZY3W2JEMJJCLCJ7Q/bundle.json","state":"https://pith.science/pith/CWLHKNNYSWZY3W2JEMJJCLCJ7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWLHKNNYSWZY3W2JEMJJCLCJ7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:CWLHKNNYSWZY3W2JEMJJCLCJ7Q","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":"469a8ca395fd9ea7c2aec0e608fcb534e529b9f23fb258427fdb2c3da1f526d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-28T09:57:52Z","title_canon_sha256":"555dd12269913a21ad32615c6fdbb035b46c7e137a7bfb6bf33cc9fa00884cc9"},"schema_version":"1.0","source":{"id":"0904.4343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4343","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4343v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4343","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"CWLHKNNYSWZY","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CWLHKNNYSWZY3W2J","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CWLHKNNY","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:3f7dd13f2f921ab90ca47bb78315a733e67f271782c5933e407d161c94dcddb4","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"Interference alignment in the K-user MIMO interference channel with constant channel coefficients is considered. A novel constructive method for finding the interference alignment solution is proposed for the case where the number of transmit antennas equals the number of receive antennas (NT = NR = N), the number of transmitter-receiver pairs equals K = N + 1, and all interference alignment multiplexing gains are one. The core of the method consists of solving an eigenvalue problem that incorporates the channel matrices of all interfering links. This procedure provides insight into the feasib","authors_text":"Erwin Riegler, Maxime Guillaud, Roland Tresch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-28T09:57:52Z","title":"On the Achievability of Interference Alignment in the K-User Constant MIMO Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4343","kind":"arxiv","version":1},"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:a7fd6868ea8ea521d04e03e4fea6159c5ff1b2ecdf3c28f507752b21e927e704","target":"record","created_at":"2026-05-18T00:57:58Z","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":"469a8ca395fd9ea7c2aec0e608fcb534e529b9f23fb258427fdb2c3da1f526d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-28T09:57:52Z","title_canon_sha256":"555dd12269913a21ad32615c6fdbb035b46c7e137a7bfb6bf33cc9fa00884cc9"},"schema_version":"1.0","source":{"id":"0904.4343","kind":"arxiv","version":1}},"canonical_sha256":"15967535b895b38ddb492312912c49fc06a1998026ee2dc6ec7affda23e113d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15967535b895b38ddb492312912c49fc06a1998026ee2dc6ec7affda23e113d7","first_computed_at":"2026-05-18T00:57:58.215186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.215186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Erp8X7DiZuetf/BAMtEQK4EtYhO42HqE18u0E3Y/LSwOKO9SeUQS2CNee3rStpOeM4IMsI/bTLNEk8HfC3VkCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.215600Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.4343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7fd6868ea8ea521d04e03e4fea6159c5ff1b2ecdf3c28f507752b21e927e704","sha256:3f7dd13f2f921ab90ca47bb78315a733e67f271782c5933e407d161c94dcddb4"],"state_sha256":"d7a9115d88b7003171795139521fbf13be8c663d3f39587e2f2d986ff4ece164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuvgdGEDhH9y9+QEBhcbq8FqxnlwbJitQ7Mt+z3tUwfv+twxUJIxOBeV1h950LewaBly+aqHxWPW/bSOfnKvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:13:42.696746Z","bundle_sha256":"b41dd3682a3504df17ccb43ac0cbaaf753a87b8aa7b6aef5e197028b75e280dd"}}