{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:P73UOPYTJFH3RPOBW5NSFGTNYF","short_pith_number":"pith:P73UOPYT","schema_version":"1.0","canonical_sha256":"7ff7473f13494fb8bdc1b75b229a6dc15ff8035635d1b43d4c2ea5c26d27725e","source":{"kind":"arxiv","id":"1306.5527","version":2},"attestation_state":"computed","paper":{"title":"Computing the Fr\\'echet Distance with a Retractable Leash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kevin Buchin, Maike Buchin, Rolf van Leusden, Wolfgang Mulzer, Wouter Meulemans","submitted_at":"2013-06-24T07:33:40Z","abstract_excerpt":"All known algorithms for the Fr\\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fr\\'echet distance between polygonal curves in $R^d$ under polyhedral distance functions (e.g., $L_1$ and $L_\\infty$). We also get a $(1+\\varepsilon)$-approximation of the Fr\\'echet distance under the Euclidean metric, in qua"},"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":"1306.5527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-24T07:33:40Z","cross_cats_sorted":[],"title_canon_sha256":"bd9cdb89b6afeba9db3fd7d2bdd02eef520a6427386a939c72cd32b18b174937","abstract_canon_sha256":"ad1d2de87fd9db36dd9aca686f9b62c644379f6689bded98e048fc3d8d28cb36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.620263Z","signature_b64":"lYph3vcNCoPdqrw7r+hwUeSgyxGBbSexVuL0wlr3rSCNVUuNyCXWEliROlI70kU4KVGlj8bpLjmKUEseipqrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ff7473f13494fb8bdc1b75b229a6dc15ff8035635d1b43d4c2ea5c26d27725e","last_reissued_at":"2026-05-18T01:09:32.619815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.619815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Fr\\'echet Distance with a Retractable Leash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kevin Buchin, Maike Buchin, Rolf van Leusden, Wolfgang Mulzer, Wouter Meulemans","submitted_at":"2013-06-24T07:33:40Z","abstract_excerpt":"All known algorithms for the Fr\\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fr\\'echet distance between polygonal curves in $R^d$ under polyhedral distance functions (e.g., $L_1$ and $L_\\infty$). We also get a $(1+\\varepsilon)$-approximation of the Fr\\'echet distance under the Euclidean metric, in qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5527","kind":"arxiv","version":2},"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":"1306.5527","created_at":"2026-05-18T01:09:32.619873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5527v2","created_at":"2026-05-18T01:09:32.619873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5527","created_at":"2026-05-18T01:09:32.619873+00:00"},{"alias_kind":"pith_short_12","alias_value":"P73UOPYTJFH3","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P73UOPYTJFH3RPOB","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P73UOPYT","created_at":"2026-05-18T12:27:54.935989+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/P73UOPYTJFH3RPOBW5NSFGTNYF","json":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF.json","graph_json":"https://pith.science/api/pith-number/P73UOPYTJFH3RPOBW5NSFGTNYF/graph.json","events_json":"https://pith.science/api/pith-number/P73UOPYTJFH3RPOBW5NSFGTNYF/events.json","paper":"https://pith.science/paper/P73UOPYT"},"agent_actions":{"view_html":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF","download_json":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF.json","view_paper":"https://pith.science/paper/P73UOPYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5527&json=true","fetch_graph":"https://pith.science/api/pith-number/P73UOPYTJFH3RPOBW5NSFGTNYF/graph.json","fetch_events":"https://pith.science/api/pith-number/P73UOPYTJFH3RPOBW5NSFGTNYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/action/storage_attestation","attest_author":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/action/author_attestation","sign_citation":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/action/citation_signature","submit_replication":"https://pith.science/pith/P73UOPYTJFH3RPOBW5NSFGTNYF/action/replication_record"}},"created_at":"2026-05-18T01:09:32.619873+00:00","updated_at":"2026-05-18T01:09:32.619873+00:00"}