{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PL4HN64QDHQUWTB354CQOR2FIK","short_pith_number":"pith:PL4HN64Q","canonical_record":{"source":{"id":"1211.3484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-15T02:56:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ec5e3f5b7b5eaf3768d924ba4fd8eb81a32aa857bca7fb3242d089d289726f4d","abstract_canon_sha256":"6801a6333f1aca5b9c563a5c06f10fd5541c2f12288b1eab131ede430a9c5b7c"},"schema_version":"1.0"},"canonical_sha256":"7af876fb9019e14b4c3bef050747454297bbe9fd674cd96e3265a7b765bd1e2a","source":{"kind":"arxiv","id":"1211.3484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3484","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3484v1","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3484","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"PL4HN64QDHQU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PL4HN64QDHQUWTB3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PL4HN64Q","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PL4HN64QDHQUWTB354CQOR2FIK","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-15T02:56:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ec5e3f5b7b5eaf3768d924ba4fd8eb81a32aa857bca7fb3242d089d289726f4d","abstract_canon_sha256":"6801a6333f1aca5b9c563a5c06f10fd5541c2f12288b1eab131ede430a9c5b7c"},"schema_version":"1.0"},"canonical_sha256":"7af876fb9019e14b4c3bef050747454297bbe9fd674cd96e3265a7b765bd1e2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:11.797016Z","signature_b64":"jYI6qYxkY5E8DAgLGNlR2HSgRK4Tb6uBaiM4hZtn5cg4Sm2zmhBrh9QvOtxM2j6POQwA8dEHmsJkd2NH52ZeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af876fb9019e14b4c3bef050747454297bbe9fd674cd96e3265a7b765bd1e2a","last_reissued_at":"2026-05-18T03:17:11.796243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:11.796243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3484","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-18T03:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYTlFEU/gJmox0sAHYpiyDJV2jTNy6V6mG9Z/uZIse6rUIfQ5fNS6F4QICCJIZovY9YUyK5uRXZ93U6FCN9WAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:56:32.398291Z"},"content_sha256":"14abc0ed7d04d186b55caf4c77e798b5bf843390dfa7ba13b2f8b1ebf85039d0","schema_version":"1.0","event_id":"sha256:14abc0ed7d04d186b55caf4c77e798b5bf843390dfa7ba13b2f8b1ebf85039d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PL4HN64QDHQUWTB354CQOR2FIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Feasibility Conditions for Interference Alignment in MIMO Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Liangzhong Ruan, Moe Z. Win, Vincent K.N. Lau","submitted_at":"2012-11-15T02:56:33Z","abstract_excerpt":"Interference alignment (IA) has attracted great attention in the last few years for its breakthrough performance in interference networks. However, despite the numerous works dedicated to IA, the feasibility conditions of IA remains unclear for most network topologies. The IA feasibility analysis is challenging as the IA constraints are sets of high-degree polynomials, for which no systematic tool to analyze the solvability conditions exists. In this work, by developing a new mathematical framework that maps the solvability of sets of polynomial equations to the linear independence of their fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3484","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-18T03:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMGNlZXeahI2MEv/nKOwuqYpHZle6asH3G4BCAEHuEl2HT24xZHbhkax9rzDFaAjSwXShEFkAcxtXrmPknX/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:56:32.398678Z"},"content_sha256":"2cecfccde02ce57d96e40242c6f744c1db1b7af42eb847e8c5985c18c7a60acb","schema_version":"1.0","event_id":"sha256:2cecfccde02ce57d96e40242c6f744c1db1b7af42eb847e8c5985c18c7a60acb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PL4HN64QDHQUWTB354CQOR2FIK/bundle.json","state_url":"https://pith.science/pith/PL4HN64QDHQUWTB354CQOR2FIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PL4HN64QDHQUWTB354CQOR2FIK/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-06-01T03:56:32Z","links":{"resolver":"https://pith.science/pith/PL4HN64QDHQUWTB354CQOR2FIK","bundle":"https://pith.science/pith/PL4HN64QDHQUWTB354CQOR2FIK/bundle.json","state":"https://pith.science/pith/PL4HN64QDHQUWTB354CQOR2FIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PL4HN64QDHQUWTB354CQOR2FIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PL4HN64QDHQUWTB354CQOR2FIK","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":"6801a6333f1aca5b9c563a5c06f10fd5541c2f12288b1eab131ede430a9c5b7c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-15T02:56:33Z","title_canon_sha256":"ec5e3f5b7b5eaf3768d924ba4fd8eb81a32aa857bca7fb3242d089d289726f4d"},"schema_version":"1.0","source":{"id":"1211.3484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3484","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3484v1","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3484","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"PL4HN64QDHQU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PL4HN64QDHQUWTB3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PL4HN64Q","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:2cecfccde02ce57d96e40242c6f744c1db1b7af42eb847e8c5985c18c7a60acb","target":"graph","created_at":"2026-05-18T03:17:11Z","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 (IA) has attracted great attention in the last few years for its breakthrough performance in interference networks. However, despite the numerous works dedicated to IA, the feasibility conditions of IA remains unclear for most network topologies. The IA feasibility analysis is challenging as the IA constraints are sets of high-degree polynomials, for which no systematic tool to analyze the solvability conditions exists. In this work, by developing a new mathematical framework that maps the solvability of sets of polynomial equations to the linear independence of their fi","authors_text":"Liangzhong Ruan, Moe Z. Win, Vincent K.N. Lau","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-15T02:56:33Z","title":"The Feasibility Conditions for Interference Alignment in MIMO Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3484","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:14abc0ed7d04d186b55caf4c77e798b5bf843390dfa7ba13b2f8b1ebf85039d0","target":"record","created_at":"2026-05-18T03:17:11Z","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":"6801a6333f1aca5b9c563a5c06f10fd5541c2f12288b1eab131ede430a9c5b7c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-15T02:56:33Z","title_canon_sha256":"ec5e3f5b7b5eaf3768d924ba4fd8eb81a32aa857bca7fb3242d089d289726f4d"},"schema_version":"1.0","source":{"id":"1211.3484","kind":"arxiv","version":1}},"canonical_sha256":"7af876fb9019e14b4c3bef050747454297bbe9fd674cd96e3265a7b765bd1e2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7af876fb9019e14b4c3bef050747454297bbe9fd674cd96e3265a7b765bd1e2a","first_computed_at":"2026-05-18T03:17:11.796243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:11.796243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jYI6qYxkY5E8DAgLGNlR2HSgRK4Tb6uBaiM4hZtn5cg4Sm2zmhBrh9QvOtxM2j6POQwA8dEHmsJkd2NH52ZeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:11.797016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14abc0ed7d04d186b55caf4c77e798b5bf843390dfa7ba13b2f8b1ebf85039d0","sha256:2cecfccde02ce57d96e40242c6f744c1db1b7af42eb847e8c5985c18c7a60acb"],"state_sha256":"d054b0e98784c737e1f8bc3e194bc833022ba9c31652ffd4e57ba9d5b67798a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncOxmvM62kkAjvzPGO/I8UyGLRvsyMp8+VJg+/BXZoqEErVZt/F2aP5QXw7Z0HN7i2nqJJAe/cjMExY6Xi1wBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:56:32.400835Z","bundle_sha256":"56a977f65d5b0e4cb1ec20e0d57355e8e00f6c73e2d9735991fca602740b5980"}}