{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NDOBS3CCYBJAJJ3TR23IGCJ3SW","short_pith_number":"pith:NDOBS3CC","schema_version":"1.0","canonical_sha256":"68dc196c42c05204a7738eb683093b959ebe0dfb2a428c5f0266aa05a9fce4db","source":{"kind":"arxiv","id":"1610.06618","version":3},"attestation_state":"computed","paper":{"title":"An Efficient Optimal Algorithm for the Successive Minima Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinming Wen, Lanping Li, Wai Ho Mow, Xiaohu Tang","submitted_at":"2016-10-20T21:59:01Z","abstract_excerpt":"In many applications including integer-forcing linear multiple-input and multiple-output (MIMO) receiver design, one needs to solve a successive minima problem (SMP) on an $n$-dimensional lattice to get an optimal integer coefficient matrix $\\A^\\star\\in \\mathbb{Z}^{n\\times n}$. In this paper, we first propose an efficient optimal SMP algorithm with an $\\bigO(n^2)$ memory complexity. The main idea behind the new algorithm is it first initializes with a suitable suboptimal solution, which is then updated, via a novel algorithm with only $\\bigO(n^2)$ flops in each updating, until $\\A^{\\star}$ is "},"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":"1610.06618","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-20T21:59:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f85bb760d057de58bf35ecc6620a9608b9cc53480e9a628e37934d8d0fc95f3","abstract_canon_sha256":"a0c8c8626052f73a1dea5b134103405ce95f545df2f19ad7f96939d260cb72e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.292177Z","signature_b64":"pSnYPsMLUIVNvw6Fxu+zcwo0BSAlDEqZwpgOOVv/Z3tIiGSZcCBUsxWG2K2CLKc69fusOql0bEdKESVkz9A0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68dc196c42c05204a7738eb683093b959ebe0dfb2a428c5f0266aa05a9fce4db","last_reissued_at":"2026-05-18T00:01:39.291733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.291733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Optimal Algorithm for the Successive Minima Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinming Wen, Lanping Li, Wai Ho Mow, Xiaohu Tang","submitted_at":"2016-10-20T21:59:01Z","abstract_excerpt":"In many applications including integer-forcing linear multiple-input and multiple-output (MIMO) receiver design, one needs to solve a successive minima problem (SMP) on an $n$-dimensional lattice to get an optimal integer coefficient matrix $\\A^\\star\\in \\mathbb{Z}^{n\\times n}$. In this paper, we first propose an efficient optimal SMP algorithm with an $\\bigO(n^2)$ memory complexity. The main idea behind the new algorithm is it first initializes with a suitable suboptimal solution, which is then updated, via a novel algorithm with only $\\bigO(n^2)$ flops in each updating, until $\\A^{\\star}$ is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06618","kind":"arxiv","version":3},"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":"1610.06618","created_at":"2026-05-18T00:01:39.291796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06618v3","created_at":"2026-05-18T00:01:39.291796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06618","created_at":"2026-05-18T00:01:39.291796+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDOBS3CCYBJA","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDOBS3CCYBJAJJ3T","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDOBS3CC","created_at":"2026-05-18T12:30:32.724797+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/NDOBS3CCYBJAJJ3TR23IGCJ3SW","json":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW.json","graph_json":"https://pith.science/api/pith-number/NDOBS3CCYBJAJJ3TR23IGCJ3SW/graph.json","events_json":"https://pith.science/api/pith-number/NDOBS3CCYBJAJJ3TR23IGCJ3SW/events.json","paper":"https://pith.science/paper/NDOBS3CC"},"agent_actions":{"view_html":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW","download_json":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW.json","view_paper":"https://pith.science/paper/NDOBS3CC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06618&json=true","fetch_graph":"https://pith.science/api/pith-number/NDOBS3CCYBJAJJ3TR23IGCJ3SW/graph.json","fetch_events":"https://pith.science/api/pith-number/NDOBS3CCYBJAJJ3TR23IGCJ3SW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW/action/storage_attestation","attest_author":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW/action/author_attestation","sign_citation":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW/action/citation_signature","submit_replication":"https://pith.science/pith/NDOBS3CCYBJAJJ3TR23IGCJ3SW/action/replication_record"}},"created_at":"2026-05-18T00:01:39.291796+00:00","updated_at":"2026-05-18T00:01:39.291796+00:00"}