{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YE4RCHYTDS5I7CT7WJKP4SSBSK","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":"6bac9f3c45a9a04ec3ba05b79fa89d42ef183de9b319b8417e8b6b1e5c1e909c","cross_cats_sorted":["cs.DS","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-03T19:27:52Z","title_canon_sha256":"02a587fb7a8d2bb398c44d072ba3434f581eeff76b0a612d73920d125556c484"},"schema_version":"1.0","source":{"id":"1304.1066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1066","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1066v1","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1066","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"YE4RCHYTDS5I","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YE4RCHYTDS5I7CT7","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YE4RCHYT","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:e6e75becc17744d261834553729f61a16bda98d9e5cd952cdfcaa0012a0f8b36","target":"graph","created_at":"2026-05-18T03:29:05Z","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":"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 ","authors_text":"Qi Zhou, Xiaoli Ma","cross_cats":["cs.DS","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-03T19:27:52Z","title":"An Improved LR-aided K-Best Algorithm for MIMO Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1066","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:1722c93d2610d736f7f57637662b64e0040d4f77ec7019b96a3ba6898d7b9acb","target":"record","created_at":"2026-05-18T03:29:05Z","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":"6bac9f3c45a9a04ec3ba05b79fa89d42ef183de9b319b8417e8b6b1e5c1e909c","cross_cats_sorted":["cs.DS","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-03T19:27:52Z","title_canon_sha256":"02a587fb7a8d2bb398c44d072ba3434f581eeff76b0a612d73920d125556c484"},"schema_version":"1.0","source":{"id":"1304.1066","kind":"arxiv","version":1}},"canonical_sha256":"c139111f131cba8f8a7fb254fe4a4192ae6a7442cfd76ad7d9ce3ad12c415b99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c139111f131cba8f8a7fb254fe4a4192ae6a7442cfd76ad7d9ce3ad12c415b99","first_computed_at":"2026-05-18T03:29:05.406443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:05.406443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T20ORsPwa0IHEMaQorOMBvdtBVUiu5rllqUqf3qxK3a3vmgb4vcsWpPa8L+w+mc7QVRIz/j8gOQxoLs7lIs0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:05.407006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1722c93d2610d736f7f57637662b64e0040d4f77ec7019b96a3ba6898d7b9acb","sha256:e6e75becc17744d261834553729f61a16bda98d9e5cd952cdfcaa0012a0f8b36"],"state_sha256":"1ec89e58bc0aa1e32cf7213496fa4b25c00ac9486f5ec5c98037cd65c0861819"}