{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YAWAXWYOG3DULEADVPWTRKIT6W","short_pith_number":"pith:YAWAXWYO","schema_version":"1.0","canonical_sha256":"c02c0bdb0e36c7459003abed38a913f5a3aac6dd992a5c8098ae4c4a1afda9c6","source":{"kind":"arxiv","id":"1509.02576","version":2},"attestation_state":"computed","paper":{"title":"Complexity and Algorithms for the Discrete Fr\\'echet Distance Upper Bound with Imprecise Input","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Binhai Zhu, Chenglin Fan","submitted_at":"2015-09-08T22:59:44Z","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."},"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":"1509.02576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-08T22:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"0c618b44a9b053dd3ea03629baac7a8a1478e0e7138a5701617c02f8dee70da6","abstract_canon_sha256":"57c957a7017b547818ebcef8607a79eb525f8dd82e56e548abd1878eed239895"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:23.719245Z","signature_b64":"Of8zthp9emnb5vTVrHlgbeu6ZmrCSwa1Fjhb69QP/sF2P2TYChBLtRNH59JGdMF3UZt1qVtEi3Fs+W1HDaw7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c02c0bdb0e36c7459003abed38a913f5a3aac6dd992a5c8098ae4c4a1afda9c6","last_reissued_at":"2026-05-18T01:33:23.718769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:23.718769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Algorithms for the Discrete Fr\\'echet Distance Upper Bound with Imprecise Input","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Binhai Zhu, Chenglin Fan","submitted_at":"2015-09-08T22:59:44Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02576","kind":"arxiv","version":2},"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":"1509.02576","created_at":"2026-05-18T01:33:23.718844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02576v2","created_at":"2026-05-18T01:33:23.718844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02576","created_at":"2026-05-18T01:33:23.718844+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAWAXWYOG3DU","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAWAXWYOG3DULEAD","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAWAXWYO","created_at":"2026-05-18T12:29:50.041715+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/YAWAXWYOG3DULEADVPWTRKIT6W","json":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W.json","graph_json":"https://pith.science/api/pith-number/YAWAXWYOG3DULEADVPWTRKIT6W/graph.json","events_json":"https://pith.science/api/pith-number/YAWAXWYOG3DULEADVPWTRKIT6W/events.json","paper":"https://pith.science/paper/YAWAXWYO"},"agent_actions":{"view_html":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W","download_json":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W.json","view_paper":"https://pith.science/paper/YAWAXWYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02576&json=true","fetch_graph":"https://pith.science/api/pith-number/YAWAXWYOG3DULEADVPWTRKIT6W/graph.json","fetch_events":"https://pith.science/api/pith-number/YAWAXWYOG3DULEADVPWTRKIT6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/action/storage_attestation","attest_author":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/action/author_attestation","sign_citation":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/action/citation_signature","submit_replication":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/action/replication_record"}},"created_at":"2026-05-18T01:33:23.718844+00:00","updated_at":"2026-05-18T01:33:23.718844+00:00"}