{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FYT2UIA4P3XGKDVU5KVDH6N3YQ","short_pith_number":"pith:FYT2UIA4","schema_version":"1.0","canonical_sha256":"2e27aa201c7eee650eb4eaaa33f9bbc406ad16e969c89f943b7748a783749ad9","source":{"kind":"arxiv","id":"1810.05400","version":1},"attestation_state":"computed","paper":{"title":"Interference Alignment Schemes Using Latin Square for Kx3 MIMO X Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jong-Seon No, Jong-Yoon Yoon, Sang-Hyo Kim, Young-Sik Moon","submitted_at":"2018-10-12T08:27:29Z","abstract_excerpt":"In this paper, we study an interference alignment (IA) scheme with finite time extension and beamformer selection method with low computational complexity for X channel. An IA scheme with a chain structure by the Latin square is proposed for Kx3 multiple-input multiple-output (MIMO) X channel. Since the proposed scheme can have a larger set of possible beamformers than the conventional schemes, its performance is improved by the efficient beamformer selection for a given channel. Also, we propose a condition number (CN) based beamformer selection method with low computational complexity and it"},"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":"1810.05400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-12T08:27:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcdb375f97d0e055d3832c0266cb591ee91f043607b04b3e5fd2270350d436e2","abstract_canon_sha256":"ef14f35bc5c75c0341b33e6c3f2be17a6983c6c5c0eccd016510a2520acdb9d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:30.699837Z","signature_b64":"T13J+9BlQe0VQQNlaOh3BAV1I6W1HHbE7dihzAuhEdV4npVcQ079NYWGIMqNYwd1ygnvUtGGysW3nLO/oWQVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e27aa201c7eee650eb4eaaa33f9bbc406ad16e969c89f943b7748a783749ad9","last_reissued_at":"2026-05-18T00:03:30.699333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:30.699333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference Alignment Schemes Using Latin Square for Kx3 MIMO X Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jong-Seon No, Jong-Yoon Yoon, Sang-Hyo Kim, Young-Sik Moon","submitted_at":"2018-10-12T08:27:29Z","abstract_excerpt":"In this paper, we study an interference alignment (IA) scheme with finite time extension and beamformer selection method with low computational complexity for X channel. An IA scheme with a chain structure by the Latin square is proposed for Kx3 multiple-input multiple-output (MIMO) X channel. Since the proposed scheme can have a larger set of possible beamformers than the conventional schemes, its performance is improved by the efficient beamformer selection for a given channel. Also, we propose a condition number (CN) based beamformer selection method with low computational complexity and it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05400","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":"1810.05400","created_at":"2026-05-18T00:03:30.699402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05400v1","created_at":"2026-05-18T00:03:30.699402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05400","created_at":"2026-05-18T00:03:30.699402+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYT2UIA4P3XG","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYT2UIA4P3XGKDVU","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYT2UIA4","created_at":"2026-05-18T12:32:25.280505+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/FYT2UIA4P3XGKDVU5KVDH6N3YQ","json":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ.json","graph_json":"https://pith.science/api/pith-number/FYT2UIA4P3XGKDVU5KVDH6N3YQ/graph.json","events_json":"https://pith.science/api/pith-number/FYT2UIA4P3XGKDVU5KVDH6N3YQ/events.json","paper":"https://pith.science/paper/FYT2UIA4"},"agent_actions":{"view_html":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ","download_json":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ.json","view_paper":"https://pith.science/paper/FYT2UIA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05400&json=true","fetch_graph":"https://pith.science/api/pith-number/FYT2UIA4P3XGKDVU5KVDH6N3YQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FYT2UIA4P3XGKDVU5KVDH6N3YQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ/action/storage_attestation","attest_author":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ/action/author_attestation","sign_citation":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ/action/citation_signature","submit_replication":"https://pith.science/pith/FYT2UIA4P3XGKDVU5KVDH6N3YQ/action/replication_record"}},"created_at":"2026-05-18T00:03:30.699402+00:00","updated_at":"2026-05-18T00:03:30.699402+00:00"}