{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UCKCZUQCXS57EGS2BBZ4I676P5","short_pith_number":"pith:UCKCZUQC","schema_version":"1.0","canonical_sha256":"a0942cd202bcbbf21a5a0873c47bfe7f5cf448dccf40772a02a403ee18fecd47","source":{"kind":"arxiv","id":"1404.0564","version":1},"attestation_state":"computed","paper":{"title":"New Shortest Lattice Vector Problems of Polynomial Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael C. Gastpar, Saeid Sahraei","submitted_at":"2014-04-02T14:22:27Z","abstract_excerpt":"The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be solved efficiently. Specifically, if for an $n$-dimensional lattice, a Gram matrix is known that can be written as the difference of a diagonal matrix and a positive semidefinite matrix of rank $k$ (for some constant $k$), we show that the SLV problem can be reduced to a $k$-dimensional optimization problem with countably many candidate points. Moreover, we s"},"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":"1404.0564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T14:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"e2bfa8f39ae852acf3a7f110625d5968668b9429883e7b60fdfe932290a62a18","abstract_canon_sha256":"490e4c2bb6cb6260d8fae34cbd3341ba932899810aca6e0bb9b1657a5b93fe5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:03.050192Z","signature_b64":"QIBKo+/ntQKOD1fHp6ctHnswVb+X2D9C1+SoSx6HUbjCdwRtJiYOBu41LV/VEKq7cKPkWpUt14UeNyZwbeOjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0942cd202bcbbf21a5a0873c47bfe7f5cf448dccf40772a02a403ee18fecd47","last_reissued_at":"2026-05-18T02:55:03.049813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:03.049813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Shortest Lattice Vector Problems of Polynomial Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael C. Gastpar, Saeid Sahraei","submitted_at":"2014-04-02T14:22:27Z","abstract_excerpt":"The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be solved efficiently. Specifically, if for an $n$-dimensional lattice, a Gram matrix is known that can be written as the difference of a diagonal matrix and a positive semidefinite matrix of rank $k$ (for some constant $k$), we show that the SLV problem can be reduced to a $k$-dimensional optimization problem with countably many candidate points. Moreover, we s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0564","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":"1404.0564","created_at":"2026-05-18T02:55:03.049881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0564v1","created_at":"2026-05-18T02:55:03.049881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0564","created_at":"2026-05-18T02:55:03.049881+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCKCZUQCXS57","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCKCZUQCXS57EGS2","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCKCZUQC","created_at":"2026-05-18T12:28:52.271510+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/UCKCZUQCXS57EGS2BBZ4I676P5","json":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5.json","graph_json":"https://pith.science/api/pith-number/UCKCZUQCXS57EGS2BBZ4I676P5/graph.json","events_json":"https://pith.science/api/pith-number/UCKCZUQCXS57EGS2BBZ4I676P5/events.json","paper":"https://pith.science/paper/UCKCZUQC"},"agent_actions":{"view_html":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5","download_json":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5.json","view_paper":"https://pith.science/paper/UCKCZUQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0564&json=true","fetch_graph":"https://pith.science/api/pith-number/UCKCZUQCXS57EGS2BBZ4I676P5/graph.json","fetch_events":"https://pith.science/api/pith-number/UCKCZUQCXS57EGS2BBZ4I676P5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/action/storage_attestation","attest_author":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/action/author_attestation","sign_citation":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/action/citation_signature","submit_replication":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/action/replication_record"}},"created_at":"2026-05-18T02:55:03.049881+00:00","updated_at":"2026-05-18T02:55:03.049881+00:00"}