{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Q6MSBOLJ6MTP75LOBM3TI6D4TH","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":"e014a7a21f13d2d81aa0eb757baae4e027e2a2a2e40cdc163789331238f20138","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-20T16:14:17Z","title_canon_sha256":"b93d424a7bf9e21ba7f47af3cda56e767cb65cb9d0003029b25b9be08b048d0e"},"schema_version":"1.0","source":{"id":"1107.4021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4021","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4021v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4021","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"Q6MSBOLJ6MTP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q6MSBOLJ6MTP75LO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q6MSBOLJ","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:3a4983fc1fd362c18047cc79a52432e6ccd5a499f6ce61a174ab38dac86e3807","target":"graph","created_at":"2026-05-18T00:57:57Z","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 work identifies the first lattice decoding solution that achieves, in the general outage-limited MIMO setting and in the high-rate and high-SNR limit, both a vanishing gap to the error-performance of the (DMT optimal) exact solution of preprocessed lattice decoding, as well as a computational complexity that is subexponential in the number of codeword bits. The proposed solution employs lattice reduction (LR)-aided regularized (lattice) sphere decoding and proper timeout policies. These performance and complexity guarantees hold for most MIMO scenarios, all reasonable fading statistics, al","authors_text":"Arun Singh, Joakim Jalden, Petros Elia","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-20T16:14:17Z","title":"Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4021","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:8ed2a0e9012a341f6d727adffcd36909b28c7aa4cebe0b9a9eaa3265cbc02ce0","target":"record","created_at":"2026-05-18T00:57:57Z","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":"e014a7a21f13d2d81aa0eb757baae4e027e2a2a2e40cdc163789331238f20138","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-20T16:14:17Z","title_canon_sha256":"b93d424a7bf9e21ba7f47af3cda56e767cb65cb9d0003029b25b9be08b048d0e"},"schema_version":"1.0","source":{"id":"1107.4021","kind":"arxiv","version":1}},"canonical_sha256":"879920b969f326fff56e0b3734787c99dea18cdc4095a3159b499690f256b9fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"879920b969f326fff56e0b3734787c99dea18cdc4095a3159b499690f256b9fb","first_computed_at":"2026-05-18T00:57:57.315612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.315612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pBiglBIT5a2wMyjGf/UBAsuavV8sS+RUAUhv8IAFMty+pvqXCHMKKu3Vd+vKzCs+OwRg6LknMQ27eg992OtVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.316157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ed2a0e9012a341f6d727adffcd36909b28c7aa4cebe0b9a9eaa3265cbc02ce0","sha256:3a4983fc1fd362c18047cc79a52432e6ccd5a499f6ce61a174ab38dac86e3807"],"state_sha256":"28567ee7c86f00ac0d96345eb1efe522be14418b12325f18f711dca0b648d625"}