{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3KLCEVZ6XQD62FE5FVJSBURHFY","short_pith_number":"pith:3KLCEVZ6","schema_version":"1.0","canonical_sha256":"da9622573ebc07ed149d2d5320d2272e33eecc3daf2dc748f82b713701df1217","source":{"kind":"arxiv","id":"1211.2030","version":1},"attestation_state":"computed","paper":{"title":"Hardness Results on Curve/Point Set Matching with Fr\\'echet Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alper \\\"Ung\\\"or, Paul Accisano","submitted_at":"2012-11-09T02:39:00Z","abstract_excerpt":"Let P be a polygonal curve in R^d of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fr\\'echet distance from $P$ is less than a given epsilon. We show that this problem is NP-complete, regardless of whether or not points from S are allowed be visited more than once. However, we also show that if the problem instance satisfies certain restrictions, the problem is polynomial-time solvable, and we briefly outline an algorithm that computes Q."},"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":"1211.2030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-11-09T02:39:00Z","cross_cats_sorted":[],"title_canon_sha256":"056d3e6e1bac6bb12d334aab6054abcc038c5884759129a8981fe7b700230481","abstract_canon_sha256":"d5ee157b05b83e7ba6e33f697d4500a148c781d5d94e7703171def00fe65cb7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:11.925784Z","signature_b64":"MtFc5SpfwDlhsMYiJjPEi1M5GwW2bShu5hCzGRlE3tQ2jVjbA7H1CM47cJkq+yXc5AKFEefMT4rRmxfykVwcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da9622573ebc07ed149d2d5320d2272e33eecc3daf2dc748f82b713701df1217","last_reissued_at":"2026-05-18T03:41:11.925404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:11.925404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness Results on Curve/Point Set Matching with Fr\\'echet Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alper \\\"Ung\\\"or, Paul Accisano","submitted_at":"2012-11-09T02:39:00Z","abstract_excerpt":"Let P be a polygonal curve in R^d of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fr\\'echet distance from $P$ is less than a given epsilon. We show that this problem is NP-complete, regardless of whether or not points from S are allowed be visited more than once. However, we also show that if the problem instance satisfies certain restrictions, the problem is polynomial-time solvable, and we briefly outline an algorithm that computes Q."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2030","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":"1211.2030","created_at":"2026-05-18T03:41:11.925470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2030v1","created_at":"2026-05-18T03:41:11.925470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2030","created_at":"2026-05-18T03:41:11.925470+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KLCEVZ6XQD6","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KLCEVZ6XQD62FE5","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KLCEVZ6","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.01147","citing_title":"On Fr\\'echet Traveling Salesmen Problems","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY","json":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY.json","graph_json":"https://pith.science/api/pith-number/3KLCEVZ6XQD62FE5FVJSBURHFY/graph.json","events_json":"https://pith.science/api/pith-number/3KLCEVZ6XQD62FE5FVJSBURHFY/events.json","paper":"https://pith.science/paper/3KLCEVZ6"},"agent_actions":{"view_html":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY","download_json":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY.json","view_paper":"https://pith.science/paper/3KLCEVZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2030&json=true","fetch_graph":"https://pith.science/api/pith-number/3KLCEVZ6XQD62FE5FVJSBURHFY/graph.json","fetch_events":"https://pith.science/api/pith-number/3KLCEVZ6XQD62FE5FVJSBURHFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/action/storage_attestation","attest_author":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/action/author_attestation","sign_citation":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/action/citation_signature","submit_replication":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/action/replication_record"}},"created_at":"2026-05-18T03:41:11.925470+00:00","updated_at":"2026-05-18T03:41:11.925470+00:00"}