{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DLOQC7ORWTFCTV7ADLLUCIZ6YJ","short_pith_number":"pith:DLOQC7OR","schema_version":"1.0","canonical_sha256":"1add017dd1b4ca29d7e01ad741233ec24278992e88ea439c230c73aafa27a05e","source":{"kind":"arxiv","id":"1405.7014","version":1},"attestation_state":"computed","paper":{"title":"Finding a closest point in a lattice of Voronoi's first kind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Grant, I. Vaughan L. Clarkson, Robby G. McKilliam","submitted_at":"2014-05-27T19:05:57Z","abstract_excerpt":"We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice vectors that converges to a closest lattice point is found. We show that the series converges after at most $n$ terms. Each vector in the series can be efficiently computed in $O(n^3)$ operations using an algorithm to compute a minimum cut in an undirected flow network."},"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":"1405.7014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-27T19:05:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db54e10ee3346b2ebaec11e92741a2b5967909519094abecc43c88ce9d8a31bb","abstract_canon_sha256":"1cf22d70586c32d569156038c706058d2dce1d22abb2bd5408db70550212c405"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:59.849496Z","signature_b64":"FZSx/Rcz2qNDMJm0MHvmwiq+sQ5QaHu4/UvCjsScle0/bYJI/BmOVZ573ne3qBfbQFnAeTiEeCGcD0qG7lvVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1add017dd1b4ca29d7e01ad741233ec24278992e88ea439c230c73aafa27a05e","last_reissued_at":"2026-05-18T02:50:59.848909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:59.848909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a closest point in a lattice of Voronoi's first kind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Grant, I. Vaughan L. Clarkson, Robby G. McKilliam","submitted_at":"2014-05-27T19:05:57Z","abstract_excerpt":"We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice vectors that converges to a closest lattice point is found. We show that the series converges after at most $n$ terms. Each vector in the series can be efficiently computed in $O(n^3)$ operations using an algorithm to compute a minimum cut in an undirected flow network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7014","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":"1405.7014","created_at":"2026-05-18T02:50:59.849003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7014v1","created_at":"2026-05-18T02:50:59.849003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7014","created_at":"2026-05-18T02:50:59.849003+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLOQC7ORWTFC","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLOQC7ORWTFCTV7A","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLOQC7OR","created_at":"2026-05-18T12:28:25.294606+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/DLOQC7ORWTFCTV7ADLLUCIZ6YJ","json":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ.json","graph_json":"https://pith.science/api/pith-number/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/graph.json","events_json":"https://pith.science/api/pith-number/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/events.json","paper":"https://pith.science/paper/DLOQC7OR"},"agent_actions":{"view_html":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ","download_json":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ.json","view_paper":"https://pith.science/paper/DLOQC7OR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7014&json=true","fetch_graph":"https://pith.science/api/pith-number/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/action/storage_attestation","attest_author":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/action/author_attestation","sign_citation":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/action/citation_signature","submit_replication":"https://pith.science/pith/DLOQC7ORWTFCTV7ADLLUCIZ6YJ/action/replication_record"}},"created_at":"2026-05-18T02:50:59.849003+00:00","updated_at":"2026-05-18T02:50:59.849003+00:00"}