{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CAHZLPP2BJZQJGBB4JV4JDODMO","short_pith_number":"pith:CAHZLPP2","schema_version":"1.0","canonical_sha256":"100f95bdfa0a73049821e26bc48dc363ade671038c6143cc48ea43a3eddeb50b","source":{"kind":"arxiv","id":"1405.0762","version":1},"attestation_state":"computed","paper":{"title":"Finding a Curve in a Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alper \\\"Ung\\\"or, Paul Accisano","submitted_at":"2014-05-05T01:17:13Z","abstract_excerpt":"Let $P$ be a polygonal curve in $\\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\\'echet distance from $P$ is less than a given $\\varepsilon$. In this paper, we consider this problem with the added freedom to transform the input curve $P$ by translating it, rotating it, or applying an arbitrary affine transform. We present exact and approximation algorithms for several variations of this problem."},"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":"1405.0762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-05T01:17:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dca829374a550ba06b98dd7f2ac4ed60b767b0b8f62c953bb6240af1b5eff354","abstract_canon_sha256":"9ff3c30731f85e327aad5cc500a8aa249dc7c78f78fc18c5ebe093dbc2ea76d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:40.756336Z","signature_b64":"Q7Z7Ytjk0Kj8LZ18Bifr5Xsbp/C5CvV8PWwoAPFdaehk+Ah8QdwKfmx27C4L3jMhKlhFJhC29nf2kc4wXXNeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"100f95bdfa0a73049821e26bc48dc363ade671038c6143cc48ea43a3eddeb50b","last_reissued_at":"2026-05-18T02:52:40.755883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:40.755883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a Curve in a Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alper \\\"Ung\\\"or, Paul Accisano","submitted_at":"2014-05-05T01:17:13Z","abstract_excerpt":"Let $P$ be a polygonal curve in $\\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\\'echet distance from $P$ is less than a given $\\varepsilon$. In this paper, we consider this problem with the added freedom to transform the input curve $P$ by translating it, rotating it, or applying an arbitrary affine transform. We present exact and approximation algorithms for several variations of this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0762","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":"1405.0762","created_at":"2026-05-18T02:52:40.755947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0762v1","created_at":"2026-05-18T02:52:40.755947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0762","created_at":"2026-05-18T02:52:40.755947+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAHZLPP2BJZQ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAHZLPP2BJZQJGBB","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAHZLPP2","created_at":"2026-05-18T12:28:22.404517+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/CAHZLPP2BJZQJGBB4JV4JDODMO","json":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO.json","graph_json":"https://pith.science/api/pith-number/CAHZLPP2BJZQJGBB4JV4JDODMO/graph.json","events_json":"https://pith.science/api/pith-number/CAHZLPP2BJZQJGBB4JV4JDODMO/events.json","paper":"https://pith.science/paper/CAHZLPP2"},"agent_actions":{"view_html":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO","download_json":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO.json","view_paper":"https://pith.science/paper/CAHZLPP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0762&json=true","fetch_graph":"https://pith.science/api/pith-number/CAHZLPP2BJZQJGBB4JV4JDODMO/graph.json","fetch_events":"https://pith.science/api/pith-number/CAHZLPP2BJZQJGBB4JV4JDODMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO/action/storage_attestation","attest_author":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO/action/author_attestation","sign_citation":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO/action/citation_signature","submit_replication":"https://pith.science/pith/CAHZLPP2BJZQJGBB4JV4JDODMO/action/replication_record"}},"created_at":"2026-05-18T02:52:40.755947+00:00","updated_at":"2026-05-18T02:52:40.755947+00:00"}