{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PDCJPHKHZJBRIQ6ICF3GUQOI4J","short_pith_number":"pith:PDCJPHKH","schema_version":"1.0","canonical_sha256":"78c4979d47ca431443c811766a41c8e241fa299b9644364b9fc0b0b836e6e277","source":{"kind":"arxiv","id":"1809.02350","version":3},"attestation_state":"computed","paper":{"title":"FRESH: Fr\\'echet Similarity with Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Francesco Silvestri, Matteo Ceccarello","submitted_at":"2018-09-07T08:29:18Z","abstract_excerpt":"This paper studies the $r$-range search problem for curves under the continuous Fr\\'echet distance: given a dataset $S$ of $n$ polygonal curves and a threshold $r>0$, construct a data structure that, for any query curve $q$, efficiently returns all entries in $S$ with distance at most $r$ from $q$. We propose FRESH, an approximate and randomized approach for $r$-range search, that leverages on a locality sensitive hashing scheme for detecting candidate near neighbors of the query curve, and on a subsequent pruning step based on a cascade of curve simplifications. We experimentally compare \\fre"},"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":"1809.02350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-07T08:29:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6743e838c7193a6ab987f14219d52d27abb6072c258abafd674c71eefd98b912","abstract_canon_sha256":"2163d7509f375731aa424a0925d86e51d34eddccc0e95c681f4fe9c1325d811a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:07.697045Z","signature_b64":"xwFTneW9eLEkiSLHimmG+CwNTj527hM4u4TkGjpGnqL+4sBJUuWkdHpHC+RK5UZfnD7JEKmJ0TKur2/H4JldDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c4979d47ca431443c811766a41c8e241fa299b9644364b9fc0b0b836e6e277","last_reissued_at":"2026-05-17T23:44:07.696409Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:07.696409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FRESH: Fr\\'echet Similarity with Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Francesco Silvestri, Matteo Ceccarello","submitted_at":"2018-09-07T08:29:18Z","abstract_excerpt":"This paper studies the $r$-range search problem for curves under the continuous Fr\\'echet distance: given a dataset $S$ of $n$ polygonal curves and a threshold $r>0$, construct a data structure that, for any query curve $q$, efficiently returns all entries in $S$ with distance at most $r$ from $q$. We propose FRESH, an approximate and randomized approach for $r$-range search, that leverages on a locality sensitive hashing scheme for detecting candidate near neighbors of the query curve, and on a subsequent pruning step based on a cascade of curve simplifications. We experimentally compare \\fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02350","kind":"arxiv","version":3},"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":"1809.02350","created_at":"2026-05-17T23:44:07.696509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02350v3","created_at":"2026-05-17T23:44:07.696509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02350","created_at":"2026-05-17T23:44:07.696509+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDCJPHKHZJBR","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDCJPHKHZJBRIQ6I","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDCJPHKH","created_at":"2026-05-18T12:32:43.782077+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/PDCJPHKHZJBRIQ6ICF3GUQOI4J","json":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J.json","graph_json":"https://pith.science/api/pith-number/PDCJPHKHZJBRIQ6ICF3GUQOI4J/graph.json","events_json":"https://pith.science/api/pith-number/PDCJPHKHZJBRIQ6ICF3GUQOI4J/events.json","paper":"https://pith.science/paper/PDCJPHKH"},"agent_actions":{"view_html":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J","download_json":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J.json","view_paper":"https://pith.science/paper/PDCJPHKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02350&json=true","fetch_graph":"https://pith.science/api/pith-number/PDCJPHKHZJBRIQ6ICF3GUQOI4J/graph.json","fetch_events":"https://pith.science/api/pith-number/PDCJPHKHZJBRIQ6ICF3GUQOI4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J/action/storage_attestation","attest_author":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J/action/author_attestation","sign_citation":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J/action/citation_signature","submit_replication":"https://pith.science/pith/PDCJPHKHZJBRIQ6ICF3GUQOI4J/action/replication_record"}},"created_at":"2026-05-17T23:44:07.696509+00:00","updated_at":"2026-05-17T23:44:07.696509+00:00"}