{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YAWAXWYOG3DULEADVPWTRKIT6W","short_pith_number":"pith:YAWAXWYO","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"},"canonical_sha256":"c02c0bdb0e36c7459003abed38a913f5a3aac6dd992a5c8098ae4c4a1afda9c6","source":{"kind":"arxiv","id":"1509.02576","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YAWAXWYOG3DULEADVPWTRKIT6W","target":"record","payload":{"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"},"canonical_sha256":"c02c0bdb0e36c7459003abed38a913f5a3aac6dd992a5c8098ae4c4a1afda9c6","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"},"source_kind":"arxiv","source_id":"1509.02576","source_version":2,"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-18T01:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwp+JCRpFNqogv69X/TTH/ww9GSSbmvhyUhyZNUSaN3Cu2c0rww0l7SRx2IbRtp4XikRjZ6TggeqL+YkdwjiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:34:39.750653Z"},"content_sha256":"7ecfd4f2bce658f5bbc69c78762a8b7e277c0d15c579d85d7a431679fa30951b","schema_version":"1.0","event_id":"sha256:7ecfd4f2bce658f5bbc69c78762a8b7e277c0d15c579d85d7a431679fa30951b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YAWAXWYOG3DULEADVPWTRKIT6W","target":"graph","payload":{"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"},"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-18T01:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9wCrlNNvfBcChnJDLgL4Y5UPY3veBHYRh4/1ruxW9AhkqdBrGSPPwAg7hobwjdcYRRO10gzLnSpuIHcoPncBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:34:39.751276Z"},"content_sha256":"c41d579a0db2a244884f662aec5691532e8c9e6b9fbea0d29f8cfe6b16d6be9d","schema_version":"1.0","event_id":"sha256:c41d579a0db2a244884f662aec5691532e8c9e6b9fbea0d29f8cfe6b16d6be9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/bundle.json","state_url":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAWAXWYOG3DULEADVPWTRKIT6W/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-06-06T18:34:39Z","links":{"resolver":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W","bundle":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/bundle.json","state":"https://pith.science/pith/YAWAXWYOG3DULEADVPWTRKIT6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAWAXWYOG3DULEADVPWTRKIT6W/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HV+78XicPQe6/cEjBLFbPQpw8eDDB3GWG18HD9m8ZDpkspVNdRZvuW98US3MxpwhDBTMNRqZhq/c/0+nkWc/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:34:39.754253Z","bundle_sha256":"c9806e7efdf656c1676d51839339e7077aeb6f1c976981a657657b5c0bea280e"}}