{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YAWAXWYOG3DULEADVPWTRKIT6W","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":"57c957a7017b547818ebcef8607a79eb525f8dd82e56e548abd1878eed239895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-08T22:59:44Z","title_canon_sha256":"0c618b44a9b053dd3ea03629baac7a8a1478e0e7138a5701617c02f8dee70da6"},"schema_version":"1.0","source":{"id":"1509.02576","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02576","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02576v2","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02576","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"YAWAXWYOG3DU","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YAWAXWYOG3DULEAD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YAWAXWYO","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:c41d579a0db2a244884f662aec5691532e8c9e6b9fbea0d29f8cfe6b16d6be9d","target":"graph","created_at":"2026-05-18T01:33:23Z","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":"We study the problem of computing the upper bound of the discrete Fr\\'{e}chet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn \\emph{et al}. If shortcuts are allowed, we show that the upper bound of the discrete Fr\\'{e}chet distance with shortcuts for imprecise input can be computed in polynomial time and we present several efficient algorithms.","authors_text":"Binhai Zhu, Chenglin Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-08T22:59:44Z","title":"Complexity and Algorithms for the Discrete Fr\\'echet Distance Upper Bound with Imprecise Input"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02576","kind":"arxiv","version":2},"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:7ecfd4f2bce658f5bbc69c78762a8b7e277c0d15c579d85d7a431679fa30951b","target":"record","created_at":"2026-05-18T01:33:23Z","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":"57c957a7017b547818ebcef8607a79eb525f8dd82e56e548abd1878eed239895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-08T22:59:44Z","title_canon_sha256":"0c618b44a9b053dd3ea03629baac7a8a1478e0e7138a5701617c02f8dee70da6"},"schema_version":"1.0","source":{"id":"1509.02576","kind":"arxiv","version":2}},"canonical_sha256":"c02c0bdb0e36c7459003abed38a913f5a3aac6dd992a5c8098ae4c4a1afda9c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c02c0bdb0e36c7459003abed38a913f5a3aac6dd992a5c8098ae4c4a1afda9c6","first_computed_at":"2026-05-18T01:33:23.718769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:23.718769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Of8zthp9emnb5vTVrHlgbeu6ZmrCSwa1Fjhb69QP/sF2P2TYChBLtRNH59JGdMF3UZt1qVtEi3Fs+W1HDaw7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:23.719245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02576","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ecfd4f2bce658f5bbc69c78762a8b7e277c0d15c579d85d7a431679fa30951b","sha256:c41d579a0db2a244884f662aec5691532e8c9e6b9fbea0d29f8cfe6b16d6be9d"],"state_sha256":"56a806f9284a8054d3afa09e67647bcb19377ae5863d05c855a42fa96d7bd20e"}