{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YE4RCHYTDS5I7CT7WJKP4SSBSK","short_pith_number":"pith:YE4RCHYT","schema_version":"1.0","canonical_sha256":"c139111f131cba8f8a7fb254fe4a4192ae6a7442cfd76ad7d9ce3ad12c415b99","source":{"kind":"arxiv","id":"1304.1066","version":1},"attestation_state":"computed","paper":{"title":"An Improved LR-aided K-Best Algorithm for MIMO Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Qi Zhou, Xiaoli Ma","submitted_at":"2013-04-03T19:27:52Z","abstract_excerpt":"Recently, lattice reduction (LR) technique has caught great attention for multi-input multi-output (MIMO) receiver because of its low complexity and high performance. However, when the number of antennas is large, LR-aided linear detectors and successive interference cancellation (SIC) detectors still exhibit considerable performance gap to the optimal maximum likelihood detector (MLD). To enhance the performance of the LR-aided detectors, the LR-aided K-best algorithm was developed at the cost of the extra complexity on the order $\\mathcal{O}(N_t^2 K + N_t K^2)$, where $N_t$ is the number of "},"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":"1304.1066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-03T19:27:52Z","cross_cats_sorted":["cs.DS","math.IT","math.OC"],"title_canon_sha256":"02a587fb7a8d2bb398c44d072ba3434f581eeff76b0a612d73920d125556c484","abstract_canon_sha256":"6bac9f3c45a9a04ec3ba05b79fa89d42ef183de9b319b8417e8b6b1e5c1e909c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:05.407006Z","signature_b64":"T20ORsPwa0IHEMaQorOMBvdtBVUiu5rllqUqf3qxK3a3vmgb4vcsWpPa8L+w+mc7QVRIz/j8gOQxoLs7lIs0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c139111f131cba8f8a7fb254fe4a4192ae6a7442cfd76ad7d9ce3ad12c415b99","last_reissued_at":"2026-05-18T03:29:05.406443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:05.406443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved LR-aided K-Best Algorithm for MIMO Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Qi Zhou, Xiaoli Ma","submitted_at":"2013-04-03T19:27:52Z","abstract_excerpt":"Recently, lattice reduction (LR) technique has caught great attention for multi-input multi-output (MIMO) receiver because of its low complexity and high performance. However, when the number of antennas is large, LR-aided linear detectors and successive interference cancellation (SIC) detectors still exhibit considerable performance gap to the optimal maximum likelihood detector (MLD). To enhance the performance of the LR-aided detectors, the LR-aided K-best algorithm was developed at the cost of the extra complexity on the order $\\mathcal{O}(N_t^2 K + N_t K^2)$, where $N_t$ is the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1066","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":"1304.1066","created_at":"2026-05-18T03:29:05.406512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1066v1","created_at":"2026-05-18T03:29:05.406512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1066","created_at":"2026-05-18T03:29:05.406512+00:00"},{"alias_kind":"pith_short_12","alias_value":"YE4RCHYTDS5I","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YE4RCHYTDS5I7CT7","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YE4RCHYT","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/YE4RCHYTDS5I7CT7WJKP4SSBSK","json":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK.json","graph_json":"https://pith.science/api/pith-number/YE4RCHYTDS5I7CT7WJKP4SSBSK/graph.json","events_json":"https://pith.science/api/pith-number/YE4RCHYTDS5I7CT7WJKP4SSBSK/events.json","paper":"https://pith.science/paper/YE4RCHYT"},"agent_actions":{"view_html":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK","download_json":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK.json","view_paper":"https://pith.science/paper/YE4RCHYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1066&json=true","fetch_graph":"https://pith.science/api/pith-number/YE4RCHYTDS5I7CT7WJKP4SSBSK/graph.json","fetch_events":"https://pith.science/api/pith-number/YE4RCHYTDS5I7CT7WJKP4SSBSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK/action/storage_attestation","attest_author":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK/action/author_attestation","sign_citation":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK/action/citation_signature","submit_replication":"https://pith.science/pith/YE4RCHYTDS5I7CT7WJKP4SSBSK/action/replication_record"}},"created_at":"2026-05-18T03:29:05.406512+00:00","updated_at":"2026-05-18T03:29:05.406512+00:00"}