{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UFEHK42USCX2B53S6KJSGXPAHB","short_pith_number":"pith:UFEHK42U","schema_version":"1.0","canonical_sha256":"a14875735490afa0f772f293235de0385d4e79d7e772f3c44d3ac5e30e659829","source":{"kind":"arxiv","id":"1703.04040","version":1},"attestation_state":"computed","paper":{"title":"Locality-sensitive hashing of curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Francesco Silvestri","submitted_at":"2017-03-11T23:16:23Z","abstract_excerpt":"We study data structures for storing a set of polygonal curves in ${\\rm R}^d$ such that, given a query curve, we can efficiently retrieve similar curves from the set, where similarity is measured using the discrete Fr\\'echet distance or the dynamic time warping distance. To this end we devise the first locality-sensitive hashing schemes for these distance measures. A major challenge is posed by the fact that these distance measures internally optimize the alignment between the curves. We give solutions for different types of alignments including constrained and unconstrained versions. For unco"},"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":"1703.04040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-11T23:16:23Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"92dd5dcf9d5d6e943b2ae6e6eb58e4640086842297c60452f8e58feda854bbb7","abstract_canon_sha256":"af6bfd124fa2cf93f362573a5dba75845758d869b53e7f4f7eac7fe971021d5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:50.066282Z","signature_b64":"SekGLTS59Lks2WDEY1dUEaZwyKBaGyl8lAKkqnCuS93QrVVLIjUicuKzFS/dLBY00dITsKw6MXmfwKtcg5MNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14875735490afa0f772f293235de0385d4e79d7e772f3c44d3ac5e30e659829","last_reissued_at":"2026-05-18T00:48:50.065501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:50.065501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality-sensitive hashing of curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Francesco Silvestri","submitted_at":"2017-03-11T23:16:23Z","abstract_excerpt":"We study data structures for storing a set of polygonal curves in ${\\rm R}^d$ such that, given a query curve, we can efficiently retrieve similar curves from the set, where similarity is measured using the discrete Fr\\'echet distance or the dynamic time warping distance. To this end we devise the first locality-sensitive hashing schemes for these distance measures. A major challenge is posed by the fact that these distance measures internally optimize the alignment between the curves. We give solutions for different types of alignments including constrained and unconstrained versions. For unco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04040","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":"1703.04040","created_at":"2026-05-18T00:48:50.065639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04040v1","created_at":"2026-05-18T00:48:50.065639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04040","created_at":"2026-05-18T00:48:50.065639+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFEHK42USCX2","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFEHK42USCX2B53S","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFEHK42U","created_at":"2026-05-18T12:31:46.661854+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/UFEHK42USCX2B53S6KJSGXPAHB","json":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB.json","graph_json":"https://pith.science/api/pith-number/UFEHK42USCX2B53S6KJSGXPAHB/graph.json","events_json":"https://pith.science/api/pith-number/UFEHK42USCX2B53S6KJSGXPAHB/events.json","paper":"https://pith.science/paper/UFEHK42U"},"agent_actions":{"view_html":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB","download_json":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB.json","view_paper":"https://pith.science/paper/UFEHK42U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04040&json=true","fetch_graph":"https://pith.science/api/pith-number/UFEHK42USCX2B53S6KJSGXPAHB/graph.json","fetch_events":"https://pith.science/api/pith-number/UFEHK42USCX2B53S6KJSGXPAHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB/action/storage_attestation","attest_author":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB/action/author_attestation","sign_citation":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB/action/citation_signature","submit_replication":"https://pith.science/pith/UFEHK42USCX2B53S6KJSGXPAHB/action/replication_record"}},"created_at":"2026-05-18T00:48:50.065639+00:00","updated_at":"2026-05-18T00:48:50.065639+00:00"}