{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3KLCEVZ6XQD62FE5FVJSBURHFY","short_pith_number":"pith:3KLCEVZ6","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"},"canonical_sha256":"da9622573ebc07ed149d2d5320d2272e33eecc3daf2dc748f82b713701df1217","source":{"kind":"arxiv","id":"1211.2030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2030","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2030v1","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2030","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"3KLCEVZ6XQD6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3KLCEVZ6XQD62FE5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3KLCEVZ6","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3KLCEVZ6XQD62FE5FVJSBURHFY","target":"record","payload":{"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"},"canonical_sha256":"da9622573ebc07ed149d2d5320d2272e33eecc3daf2dc748f82b713701df1217","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"},"source_kind":"arxiv","source_id":"1211.2030","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w1xkvEwwi9Sq+jHqcIW4ULJeywBWJ9Jfunh9o4qydMDzT61DbBZWf3C1zvJGSfiqowh+bmgO/HjgVYA7BeKwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:53:36.013092Z"},"content_sha256":"706f114a9b7b0fc7ba477a4dcc9ba5e015fbda06f7b54f5e1a43dfa5129c9d0d","schema_version":"1.0","event_id":"sha256:706f114a9b7b0fc7ba477a4dcc9ba5e015fbda06f7b54f5e1a43dfa5129c9d0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3KLCEVZ6XQD62FE5FVJSBURHFY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tbdPabgqX4dkXT4NoK+uXDRZD8RaHtBgf9yEO8SCeBsL9ZUJ4dCKhRrFrYLEo9KXmvhMYtxrONUDZQ5K2PMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:53:36.013444Z"},"content_sha256":"7ba8b6c90e18aad9d51c4d77d3c68c076f9c1a36f51cc38a73d53fd968ea2656","schema_version":"1.0","event_id":"sha256:7ba8b6c90e18aad9d51c4d77d3c68c076f9c1a36f51cc38a73d53fd968ea2656"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/bundle.json","state_url":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T18:53:36Z","links":{"resolver":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY","bundle":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/bundle.json","state":"https://pith.science/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KLCEVZ6XQD62FE5FVJSBURHFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3KLCEVZ6XQD62FE5FVJSBURHFY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d5ee157b05b83e7ba6e33f697d4500a148c781d5d94e7703171def00fe65cb7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-11-09T02:39:00Z","title_canon_sha256":"056d3e6e1bac6bb12d334aab6054abcc038c5884759129a8981fe7b700230481"},"schema_version":"1.0","source":{"id":"1211.2030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2030","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2030v1","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2030","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"3KLCEVZ6XQD6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3KLCEVZ6XQD62FE5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3KLCEVZ6","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:7ba8b6c90e18aad9d51c4d77d3c68c076f9c1a36f51cc38a73d53fd968ea2656","target":"graph","created_at":"2026-05-18T03:41:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alper \\\"Ung\\\"or, Paul Accisano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-11-09T02:39:00Z","title":"Hardness Results on Curve/Point Set Matching with Fr\\'echet Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2030","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:706f114a9b7b0fc7ba477a4dcc9ba5e015fbda06f7b54f5e1a43dfa5129c9d0d","target":"record","created_at":"2026-05-18T03:41:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d5ee157b05b83e7ba6e33f697d4500a148c781d5d94e7703171def00fe65cb7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-11-09T02:39:00Z","title_canon_sha256":"056d3e6e1bac6bb12d334aab6054abcc038c5884759129a8981fe7b700230481"},"schema_version":"1.0","source":{"id":"1211.2030","kind":"arxiv","version":1}},"canonical_sha256":"da9622573ebc07ed149d2d5320d2272e33eecc3daf2dc748f82b713701df1217","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da9622573ebc07ed149d2d5320d2272e33eecc3daf2dc748f82b713701df1217","first_computed_at":"2026-05-18T03:41:11.925404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:11.925404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MtFc5SpfwDlhsMYiJjPEi1M5GwW2bShu5hCzGRlE3tQ2jVjbA7H1CM47cJkq+yXc5AKFEefMT4rRmxfykVwcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:11.925784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:706f114a9b7b0fc7ba477a4dcc9ba5e015fbda06f7b54f5e1a43dfa5129c9d0d","sha256:7ba8b6c90e18aad9d51c4d77d3c68c076f9c1a36f51cc38a73d53fd968ea2656"],"state_sha256":"4c553b6333e9f3748549a515d1b77296feaa419c67ee37d8533b7eee1c491930"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDyzizJZePF0QH+pX1EGiPsPA1Ryi6XiLsyYwGW8ZNKygADkbufenLAjtfLd7GyDTd1pqwVK2hHKYodezfNhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T18:53:36.015557Z","bundle_sha256":"fe87ec5d7ef371ba2013ac5bbf544f1577d5c17db503c5788748c6521f1486da"}}