{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:BZHR6MHT6KLICDJWTMZ74B6E45","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":"e435cf16db12cbe2c1f72a8f0cebd1ef20fe24075adbacef6f5e34f5da815433","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-29T03:11:52Z","title_canon_sha256":"ea309e1e9ac50c9951d8ccb69525140f5e126d3e6ba489d66f1ebf4bc1d8ba66"},"schema_version":"1.0","source":{"id":"0904.4526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4526","created_at":"2026-05-18T02:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4526v1","created_at":"2026-05-18T02:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4526","created_at":"2026-05-18T02:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"BZHR6MHT6KLI","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"BZHR6MHT6KLICDJW","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"BZHR6MHT","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:fac06d4f9fd9d7bfc1fbe01607377c454012038edff84ca0335e08009bfcba5a","target":"graph","created_at":"2026-05-18T02:13:49Z","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":"The degrees of freedom of MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interference alignment solution is a key step toward solving this open problem. Our approach in this paper is to view the alignment problem as a system of bilinear equations and determine its solvability by comparing the number of equations and the number of variables. To this end, we divide interference alignment problems into two classes - proper and improper. An interference alignment problem is called proper if the number of equations doe","authors_text":"Ahmet H. Kayran, Cenk M. Yetis, Syed A. Jafar","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-29T03:11:52Z","title":"Feasibility Conditions for Interference Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4526","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:ab9c3ef560bb58cb1337c3d12404e32e6e28db4d15e2ef53aa36ad5d8e49322e","target":"record","created_at":"2026-05-18T02:13:49Z","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":"e435cf16db12cbe2c1f72a8f0cebd1ef20fe24075adbacef6f5e34f5da815433","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-29T03:11:52Z","title_canon_sha256":"ea309e1e9ac50c9951d8ccb69525140f5e126d3e6ba489d66f1ebf4bc1d8ba66"},"schema_version":"1.0","source":{"id":"0904.4526","kind":"arxiv","version":1}},"canonical_sha256":"0e4f1f30f3f296810d369b33fe07c4e75c6eb42cc8980214daa08ad7c98edd13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e4f1f30f3f296810d369b33fe07c4e75c6eb42cc8980214daa08ad7c98edd13","first_computed_at":"2026-05-18T02:13:49.341449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:49.341449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KR5lzn+q1LDhFbspRpZsbbAvJkqLhzLArRz7PNwm33PJ9BIOjTpQfycKrBxHl9AUz8QAg5IMQW5kanJfBOBFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:49.342185Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.4526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab9c3ef560bb58cb1337c3d12404e32e6e28db4d15e2ef53aa36ad5d8e49322e","sha256:fac06d4f9fd9d7bfc1fbe01607377c454012038edff84ca0335e08009bfcba5a"],"state_sha256":"07143580e7a0564b8e0e6a31d7b7e614e687ebcfffd87709531ccd5c9655dff2"}