{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C6CSMZHNG7UDQOKMBISXPNLTLL","short_pith_number":"pith:C6CSMZHN","schema_version":"1.0","canonical_sha256":"17852664ed37e838394c0a2577b5735ad7501292fe14b6b947c9ba4df73ce79f","source":{"kind":"arxiv","id":"1501.03724","version":1},"attestation_state":"computed","paper":{"title":"A faster algorithm for the discrete Fr\\'echet distance under translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Micha Sharir, Rinat Ben Avraham","submitted_at":"2015-01-15T16:00:50Z","abstract_excerpt":"The discrete Fr\\'echet distance is a useful similarity measure for comparing two sequences of points $P=(p_1,\\ldots, p_m)$ and $Q=(q_1,\\ldots,q_n)$. In many applications, the quality of the matching can be improved if we let $Q$ undergo some transformation relative to $P$. In this paper we consider the problem of finding a translation of $Q$ that brings the discrete Fr\\'echet distance between $P$ and $Q$ to a minimum. We devise an algorithm that computes the minimum discrete Fr\\'echet distance under translation in $\\mathbb{R}^2$, and runs in $O(m^3n^2(1+\\log(n/m))\\log(m+n))$ time, assuming $m\\"},"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":"1501.03724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-15T16:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"aa3daf6f898ada215b43bbce7b456663369e8e51b19241c893784141c87e5fb6","abstract_canon_sha256":"b196783b501b7f96692a2a72283de7478f33edd77dea5c02868e93a7b77fb870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:17.934114Z","signature_b64":"GtU3/EIVU/P0L74OLzF2Whd47oyWc40Kv4FVw9oPEyk/NaXZyA1P1BSWawfHHUEzh/8QdaRkBzOQxxYeo+ZsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17852664ed37e838394c0a2577b5735ad7501292fe14b6b947c9ba4df73ce79f","last_reissued_at":"2026-05-18T02:29:17.933674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:17.933674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A faster algorithm for the discrete Fr\\'echet distance under translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Micha Sharir, Rinat Ben Avraham","submitted_at":"2015-01-15T16:00:50Z","abstract_excerpt":"The discrete Fr\\'echet distance is a useful similarity measure for comparing two sequences of points $P=(p_1,\\ldots, p_m)$ and $Q=(q_1,\\ldots,q_n)$. In many applications, the quality of the matching can be improved if we let $Q$ undergo some transformation relative to $P$. In this paper we consider the problem of finding a translation of $Q$ that brings the discrete Fr\\'echet distance between $P$ and $Q$ to a minimum. We devise an algorithm that computes the minimum discrete Fr\\'echet distance under translation in $\\mathbb{R}^2$, and runs in $O(m^3n^2(1+\\log(n/m))\\log(m+n))$ time, assuming $m\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03724","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.03724","created_at":"2026-05-18T02:29:17.933731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03724v1","created_at":"2026-05-18T02:29:17.933731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03724","created_at":"2026-05-18T02:29:17.933731+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6CSMZHNG7UD","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6CSMZHNG7UDQOKM","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6CSMZHN","created_at":"2026-05-18T12:29:14.074870+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/C6CSMZHNG7UDQOKMBISXPNLTLL","json":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL.json","graph_json":"https://pith.science/api/pith-number/C6CSMZHNG7UDQOKMBISXPNLTLL/graph.json","events_json":"https://pith.science/api/pith-number/C6CSMZHNG7UDQOKMBISXPNLTLL/events.json","paper":"https://pith.science/paper/C6CSMZHN"},"agent_actions":{"view_html":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL","download_json":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL.json","view_paper":"https://pith.science/paper/C6CSMZHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03724&json=true","fetch_graph":"https://pith.science/api/pith-number/C6CSMZHNG7UDQOKMBISXPNLTLL/graph.json","fetch_events":"https://pith.science/api/pith-number/C6CSMZHNG7UDQOKMBISXPNLTLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/action/storage_attestation","attest_author":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/action/author_attestation","sign_citation":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/action/citation_signature","submit_replication":"https://pith.science/pith/C6CSMZHNG7UDQOKMBISXPNLTLL/action/replication_record"}},"created_at":"2026-05-18T02:29:17.933731+00:00","updated_at":"2026-05-18T02:29:17.933731+00:00"}