{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FKS4T6PUA5U7UGNNCWDRH6YLID","short_pith_number":"pith:FKS4T6PU","schema_version":"1.0","canonical_sha256":"2aa5c9f9f40769fa19ad158713fb0b40d8a75bacee9151636a6d0eb003f42e4a","source":{"kind":"arxiv","id":"0903.0673","version":1},"attestation_state":"computed","paper":{"title":"Linear-time nearest point algorithms for Coxeter lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"I. Vaughan L. Clarkson, Robby G. McKilliam, Warren D. Smith","submitted_at":"2009-03-04T01:38:50Z","abstract_excerpt":"The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices containing many of the important lattices in low dimensions. This includes $A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider the problem of finding a nearest point in a Coxeter lattice. We describe two new algorithms, one with worst case arithmetic complexity $O(n\\log{n})$ and the other with worst case complexity O(n) where $n$ is the dimension of the lattice. We show that for the particular lattices $A_n$ and $A_n^*$ the algorithms reduce to simple nearest point algorithms that already exist "},"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":"0903.0673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-04T01:38:50Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"ba3e3d3bde010012724a8924967bed8ad1f06aec005fd5ed390d79cdb1d99b78","abstract_canon_sha256":"8c2951568034d2e4285a0cbea27c11e7277fc0b3fd7f5246437b2d1a9f93c398"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.334714Z","signature_b64":"M17V9il3NvY2fDBnUPQR/DQ9F1D8pgWKBZ+CDv2Kyd6JJfiLcZrxkZZ9WIteUQT1N+qYViXHAqixumJagSPoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aa5c9f9f40769fa19ad158713fb0b40d8a75bacee9151636a6d0eb003f42e4a","last_reissued_at":"2026-05-18T00:58:20.334049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.334049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-time nearest point algorithms for Coxeter lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"I. Vaughan L. Clarkson, Robby G. McKilliam, Warren D. Smith","submitted_at":"2009-03-04T01:38:50Z","abstract_excerpt":"The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices containing many of the important lattices in low dimensions. This includes $A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider the problem of finding a nearest point in a Coxeter lattice. We describe two new algorithms, one with worst case arithmetic complexity $O(n\\log{n})$ and the other with worst case complexity O(n) where $n$ is the dimension of the lattice. We show that for the particular lattices $A_n$ and $A_n^*$ the algorithms reduce to simple nearest point algorithms that already exist "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.0673","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":"0903.0673","created_at":"2026-05-18T00:58:20.334148+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.0673v1","created_at":"2026-05-18T00:58:20.334148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.0673","created_at":"2026-05-18T00:58:20.334148+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKS4T6PUA5U7","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKS4T6PUA5U7UGNN","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKS4T6PU","created_at":"2026-05-18T12:25:59.703012+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/FKS4T6PUA5U7UGNNCWDRH6YLID","json":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID.json","graph_json":"https://pith.science/api/pith-number/FKS4T6PUA5U7UGNNCWDRH6YLID/graph.json","events_json":"https://pith.science/api/pith-number/FKS4T6PUA5U7UGNNCWDRH6YLID/events.json","paper":"https://pith.science/paper/FKS4T6PU"},"agent_actions":{"view_html":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID","download_json":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID.json","view_paper":"https://pith.science/paper/FKS4T6PU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.0673&json=true","fetch_graph":"https://pith.science/api/pith-number/FKS4T6PUA5U7UGNNCWDRH6YLID/graph.json","fetch_events":"https://pith.science/api/pith-number/FKS4T6PUA5U7UGNNCWDRH6YLID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/action/storage_attestation","attest_author":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/action/author_attestation","sign_citation":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/action/citation_signature","submit_replication":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/action/replication_record"}},"created_at":"2026-05-18T00:58:20.334148+00:00","updated_at":"2026-05-18T00:58:20.334148+00:00"}