{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:FKS4T6PUA5U7UGNNCWDRH6YLID","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":"8c2951568034d2e4285a0cbea27c11e7277fc0b3fd7f5246437b2d1a9f93c398","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-04T01:38:50Z","title_canon_sha256":"ba3e3d3bde010012724a8924967bed8ad1f06aec005fd5ed390d79cdb1d99b78"},"schema_version":"1.0","source":{"id":"0903.0673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.0673","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0903.0673v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.0673","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"FKS4T6PUA5U7","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FKS4T6PUA5U7UGNN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FKS4T6PU","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:c8b04072d15cb7f7a2e04d9a15bde10b7eec3d31ce5529944705ff49fc0e5b51","target":"graph","created_at":"2026-05-18T00:58:20Z","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 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 ","authors_text":"I. Vaughan L. Clarkson, Robby G. McKilliam, Warren D. Smith","cross_cats":["math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-04T01:38:50Z","title":"Linear-time nearest point algorithms for Coxeter lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.0673","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:956597055295559ef4eab47c98d37d90fec6ac50de5d5cb4fbd5a6c50f1f9482","target":"record","created_at":"2026-05-18T00:58:20Z","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":"8c2951568034d2e4285a0cbea27c11e7277fc0b3fd7f5246437b2d1a9f93c398","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-04T01:38:50Z","title_canon_sha256":"ba3e3d3bde010012724a8924967bed8ad1f06aec005fd5ed390d79cdb1d99b78"},"schema_version":"1.0","source":{"id":"0903.0673","kind":"arxiv","version":1}},"canonical_sha256":"2aa5c9f9f40769fa19ad158713fb0b40d8a75bacee9151636a6d0eb003f42e4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aa5c9f9f40769fa19ad158713fb0b40d8a75bacee9151636a6d0eb003f42e4a","first_computed_at":"2026-05-18T00:58:20.334049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.334049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M17V9il3NvY2fDBnUPQR/DQ9F1D8pgWKBZ+CDv2Kyd6JJfiLcZrxkZZ9WIteUQT1N+qYViXHAqixumJagSPoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.334714Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.0673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:956597055295559ef4eab47c98d37d90fec6ac50de5d5cb4fbd5a6c50f1f9482","sha256:c8b04072d15cb7f7a2e04d9a15bde10b7eec3d31ce5529944705ff49fc0e5b51"],"state_sha256":"c387a1de83b2fc3a189e4cd8e197e34a5f021acf354efff5a3d5e7bafdbebc0e"}