{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:FKS4T6PUA5U7UGNNCWDRH6YLID","short_pith_number":"pith:FKS4T6PU","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"},"canonical_sha256":"2aa5c9f9f40769fa19ad158713fb0b40d8a75bacee9151636a6d0eb003f42e4a","source":{"kind":"arxiv","id":"0903.0673","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:FKS4T6PUA5U7UGNNCWDRH6YLID","target":"record","payload":{"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"},"canonical_sha256":"2aa5c9f9f40769fa19ad158713fb0b40d8a75bacee9151636a6d0eb003f42e4a","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"},"source_kind":"arxiv","source_id":"0903.0673","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czLDFmVeyoVC8OqRo8CrusiDRB5qXAr1XGoG2yX4Mrudi5ngjOm57/EFzbHmBi7nkEem2Z7lvZBC2P6zxD0qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:16:38.484542Z"},"content_sha256":"956597055295559ef4eab47c98d37d90fec6ac50de5d5cb4fbd5a6c50f1f9482","schema_version":"1.0","event_id":"sha256:956597055295559ef4eab47c98d37d90fec6ac50de5d5cb4fbd5a6c50f1f9482"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:FKS4T6PUA5U7UGNNCWDRH6YLID","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umQG6knq1a3Gczb4//G2AjdjEDgXHOsR1t1/u5todleY9M+FiweU6vX1QU2xJXJFGNDjrAcT4eS0xF6GQ337AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:16:38.485179Z"},"content_sha256":"c8b04072d15cb7f7a2e04d9a15bde10b7eec3d31ce5529944705ff49fc0e5b51","schema_version":"1.0","event_id":"sha256:c8b04072d15cb7f7a2e04d9a15bde10b7eec3d31ce5529944705ff49fc0e5b51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/bundle.json","state_url":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T21:16:38Z","links":{"resolver":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID","bundle":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/bundle.json","state":"https://pith.science/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKS4T6PUA5U7UGNNCWDRH6YLID/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeA5Dl4MIWpxKfuTx5thv8dwfROfdAmY0tXjTqeih2I1EPMC8MX1tzIN6FQ/vDkLwjWSrlVC6ECnkz+/C5VbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:16:38.488700Z","bundle_sha256":"01be973fa27be776c0ce0e96bb4b6bdc7cc6e79ada3729f926c740b40279b2bf"}}