{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CM6AIW6IWQ6FAN2AFIFA7NDTWZ","short_pith_number":"pith:CM6AIW6I","schema_version":"1.0","canonical_sha256":"133c045bc8b43c5037402a0a0fb473b66387288873c47ec957ee82f0532d0c3f","source":{"kind":"arxiv","id":"2604.24135","version":1},"attestation_state":"computed","paper":{"title":"Near-tight Bounds for Computing the Fr\\'echet Distance in d-Dimensional Grid Graphs and the Implications for {\\lambda}-low Dense Curves","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Fréchet distance between n-vertex paths in d-dimensional grids can be (1+ε)-approximated in Õ((n/ε)^{2-2/d} + n) time.","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Frederikke Uldahl, Ivor van der Hoog, Jacobus Conradi","submitted_at":"2026-04-27T07:42:51Z","abstract_excerpt":"The Fr\\'echet distance is a popular distance measure between trajectories or curves in space, or between walks in graphs. We study computing the Fr\\'echet distance between walks in the $d$-dimensional grid graphs, i.e. $\\mathbb{Z}^d$ where points share an edge if they differ by one in one coordinate.\n  We give an algorithm, that for two simple paths on $n$ vertices, $(1+\\varepsilon)$-approximates the Fr\\'echet distance in time $\\widetilde{O}((\\frac{n}{\\varepsilon})^{2-2/d} +n)$. We complement this by a near-matching fine-grained lower bound: for constant dimensions $d \\geq 3$, there is no $O(("},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2604.24135","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-04-27T07:42:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7476946eccdb7c3c2a2c2797a0bb6a87c3e8f1bcc40612244ba9a7f6076882ff","abstract_canon_sha256":"2fc967aea039ca9a9fdf3abbce2d18ca4283a8d7a47e50ec892a01a03f0de749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:39.430081Z","signature_b64":"I+mtB+w4lnTvSpTxOG0K/sfFouLQM0BKmE3Vq96xZtJDXOJ0Tdjx6hjKIfOGZsCLQV392iC13QEY0l0FqGJFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"133c045bc8b43c5037402a0a0fb473b66387288873c47ec957ee82f0532d0c3f","last_reissued_at":"2026-05-20T00:00:39.429366Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:39.429366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-tight Bounds for Computing the Fr\\'echet Distance in d-Dimensional Grid Graphs and the Implications for {\\lambda}-low Dense Curves","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Fréchet distance between n-vertex paths in d-dimensional grids can be (1+ε)-approximated in Õ((n/ε)^{2-2/d} + n) time.","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Frederikke Uldahl, Ivor van der Hoog, Jacobus Conradi","submitted_at":"2026-04-27T07:42:51Z","abstract_excerpt":"The Fr\\'echet distance is a popular distance measure between trajectories or curves in space, or between walks in graphs. We study computing the Fr\\'echet distance between walks in the $d$-dimensional grid graphs, i.e. $\\mathbb{Z}^d$ where points share an edge if they differ by one in one coordinate.\n  We give an algorithm, that for two simple paths on $n$ vertices, $(1+\\varepsilon)$-approximates the Fr\\'echet distance in time $\\widetilde{O}((\\frac{n}{\\varepsilon})^{2-2/d} +n)$. We complement this by a near-matching fine-grained lower bound: for constant dimensions $d \\geq 3$, there is no $O(("},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We give an algorithm, that for two simple paths on n vertices, (1+ε)-approximates the Fréchet distance in time Õ((n/ε)^{2-2/d} +n). We complement this by a near-matching fine-grained lower bound: for constant dimensions d ≥ 3, there is no O((ε^{2/d}(n/ε)^{2-2/d})^{1-δ}) algorithm for any δ>0 unless the Orthogonal Vector Hypothesis fails.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The Orthogonal Vector Hypothesis must hold for the conditional lower bound to apply; the curves must be simple paths on the grid graph.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Near-tight (1+ε)-approximation algorithms and OVH-based lower bounds are given for Fréchet distance on d-dimensional grid graphs, with tightness results for λ-low dense curves.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Fréchet distance between n-vertex paths in d-dimensional grids can be (1+ε)-approximated in Õ((n/ε)^{2-2/d} + n) time.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c698842565fe63189aac2fa88bc2bf063bd63b9a347e9e784597377b3a85d0dc"},"source":{"id":"2604.24135","kind":"arxiv","version":1},"verdict":{"id":"0a38e0fb-5494-4656-bda0-9704170eab89","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T17:25:31.400822Z","strongest_claim":"We give an algorithm, that for two simple paths on n vertices, (1+ε)-approximates the Fréchet distance in time Õ((n/ε)^{2-2/d} +n). We complement this by a near-matching fine-grained lower bound: for constant dimensions d ≥ 3, there is no O((ε^{2/d}(n/ε)^{2-2/d})^{1-δ}) algorithm for any δ>0 unless the Orthogonal Vector Hypothesis fails.","one_line_summary":"Near-tight (1+ε)-approximation algorithms and OVH-based lower bounds are given for Fréchet distance on d-dimensional grid graphs, with tightness results for λ-low dense curves.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The Orthogonal Vector Hypothesis must hold for the conditional lower bound to apply; the curves must be simple paths on the grid graph.","pith_extraction_headline":"Fréchet distance between n-vertex paths in d-dimensional grids can be (1+ε)-approximated in Õ((n/ε)^{2-2/d} + n) time."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.24135/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T22:23:56.680699Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"811d1f37b28c115c90863647a10cb614f6c313e569a28b59c87818519618c573"},"references":{"count":7,"sample":[{"doi":"10.1145/3196959.3196972","year":2018,"title":"Subtrajectory clustering: Models and algorithms.ACM SIGMOD-SIGACT- SIGAI Symposium on Principles of Database Systems (PODS), pages 75–87, 2018.doi: 10.1145/3196959.3196972","work_id":"f5788104-6928-4331-89b7-5911b5f9757e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.2514/1.g002308","year":2017,"title":"5 Alessandro Bombelli, Lluis Soler, Eric Trumbauer, and Kenneth D Mease","work_id":"07bad610-b381-4624-b78d-43986dcc0b46","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3423334.3431451","year":2011,"title":"11 Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, and Jun Luo","work_id":"9833ac29-5054-4d73-b4ad-774d8787ff90","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-642-33090-2_34","year":2012,"title":"pages 58-74. J. Conradi, I. van der Hoog, F. Uldahl, E. Rotenberg 15 19 Mark de Berg, Marcel Roeloffzen, and Bettina Speckmann. Kinetic compressed quadtrees in the black-box model with applications to","work_id":"a5bd8c01-d5a7-47f2-a44e-856f004cbaef","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s00454-012-9402-z","year":2016,"title":"21 Anne Driemel, Amer Krivošija, and Christian Sohler","work_id":"5d8aabb7-aca8-40b9-a8f0-27753a388afe","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":7,"snapshot_sha256":"18607aacee73511b8320d7acc87a92547fd2e25a8ea85c1a13b190e3c914d378","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":"2604.24135","created_at":"2026-05-20T00:00:39.429472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.24135v1","created_at":"2026-05-20T00:00:39.429472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24135","created_at":"2026-05-20T00:00:39.429472+00:00"},{"alias_kind":"pith_short_12","alias_value":"CM6AIW6IWQ6F","created_at":"2026-05-20T00:00:39.429472+00:00"},{"alias_kind":"pith_short_16","alias_value":"CM6AIW6IWQ6FAN2A","created_at":"2026-05-20T00:00:39.429472+00:00"},{"alias_kind":"pith_short_8","alias_value":"CM6AIW6I","created_at":"2026-05-20T00:00:39.429472+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/CM6AIW6IWQ6FAN2AFIFA7NDTWZ","json":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ.json","graph_json":"https://pith.science/api/pith-number/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/graph.json","events_json":"https://pith.science/api/pith-number/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/events.json","paper":"https://pith.science/paper/CM6AIW6I"},"agent_actions":{"view_html":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ","download_json":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ.json","view_paper":"https://pith.science/paper/CM6AIW6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.24135&json=true","fetch_graph":"https://pith.science/api/pith-number/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/action/storage_attestation","attest_author":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/action/author_attestation","sign_citation":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/action/citation_signature","submit_replication":"https://pith.science/pith/CM6AIW6IWQ6FAN2AFIFA7NDTWZ/action/replication_record"}},"created_at":"2026-05-20T00:00:39.429472+00:00","updated_at":"2026-05-20T00:00:39.429472+00:00"}