{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5QAYKZND7NH33QJBAEJNVYWNFT","short_pith_number":"pith:5QAYKZND","schema_version":"1.0","canonical_sha256":"ec018565a3fb4fbdc1210112dae2cd2cfc66eb54dfbec55f1bb8c5e00e49d919","source":{"kind":"arxiv","id":"2503.12746","version":1},"attestation_state":"computed","paper":{"title":"Constant Approximation of Fr\\'echet Distance in Strongly Subquadratic Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haoqiang Huang, Shuo Zhang, Siu-Wing Cheng","submitted_at":"2025-03-17T02:27:40Z","abstract_excerpt":"Let $\\tau$ and $\\sigma$ be two polygonal curves in $\\mathbb{R}^d$ for any fixed $d$. Suppose that $\\tau$ and $\\sigma$ have $n$ and $m$ vertices, respectively, and $m\\le n$. While conditional lower bounds prevent approximating the Fr\\'echet distance between $\\tau$ and $\\sigma$ within a factor of 3 in strongly subquadratic time, the current best approximation algorithm attains a ratio of $n^c$ in strongly subquadratic time, for some constant $c\\in(0,1)$. We present a randomized algorithm with running time $O(nm^{0.99}\\log(n/\\varepsilon))$ that approximates the Fr\\'echet distance within a factor "},"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":"2503.12746","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-03-17T02:27:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0dfd51d6bbb34cc74a75b6ca4a2e53d15ea7683d37eb07f5f7f84f2d7f65f4c9","abstract_canon_sha256":"b6627ab9061811765f7c7985e7543d6cebe224ba1c2a6381322cd0814d0c89dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:45.401838Z","signature_b64":"JXRj1m2RvAuwvelN5uiS8gaWCmdE4sMtBJT22aekCP1e6JW5HZb382XKZ3DhgQ0w2poNvlnJQY0DofW5tJfWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec018565a3fb4fbdc1210112dae2cd2cfc66eb54dfbec55f1bb8c5e00e49d919","last_reissued_at":"2026-07-05T10:32:45.401236Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:45.401236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Approximation of Fr\\'echet Distance in Strongly Subquadratic Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haoqiang Huang, Shuo Zhang, Siu-Wing Cheng","submitted_at":"2025-03-17T02:27:40Z","abstract_excerpt":"Let $\\tau$ and $\\sigma$ be two polygonal curves in $\\mathbb{R}^d$ for any fixed $d$. Suppose that $\\tau$ and $\\sigma$ have $n$ and $m$ vertices, respectively, and $m\\le n$. While conditional lower bounds prevent approximating the Fr\\'echet distance between $\\tau$ and $\\sigma$ within a factor of 3 in strongly subquadratic time, the current best approximation algorithm attains a ratio of $n^c$ in strongly subquadratic time, for some constant $c\\in(0,1)$. We present a randomized algorithm with running time $O(nm^{0.99}\\log(n/\\varepsilon))$ that approximates the Fr\\'echet distance within a factor "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.12746","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.12746/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.12746","created_at":"2026-07-05T10:32:45.401329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.12746v1","created_at":"2026-07-05T10:32:45.401329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.12746","created_at":"2026-07-05T10:32:45.401329+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QAYKZND7NH3","created_at":"2026-07-05T10:32:45.401329+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QAYKZND7NH33QJB","created_at":"2026-07-05T10:32:45.401329+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QAYKZND","created_at":"2026-07-05T10:32:45.401329+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/5QAYKZND7NH33QJBAEJNVYWNFT","json":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT.json","graph_json":"https://pith.science/api/pith-number/5QAYKZND7NH33QJBAEJNVYWNFT/graph.json","events_json":"https://pith.science/api/pith-number/5QAYKZND7NH33QJBAEJNVYWNFT/events.json","paper":"https://pith.science/paper/5QAYKZND"},"agent_actions":{"view_html":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT","download_json":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT.json","view_paper":"https://pith.science/paper/5QAYKZND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.12746&json=true","fetch_graph":"https://pith.science/api/pith-number/5QAYKZND7NH33QJBAEJNVYWNFT/graph.json","fetch_events":"https://pith.science/api/pith-number/5QAYKZND7NH33QJBAEJNVYWNFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT/action/storage_attestation","attest_author":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT/action/author_attestation","sign_citation":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT/action/citation_signature","submit_replication":"https://pith.science/pith/5QAYKZND7NH33QJBAEJNVYWNFT/action/replication_record"}},"created_at":"2026-07-05T10:32:45.401329+00:00","updated_at":"2026-07-05T10:32:45.401329+00:00"}