{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QOSABOZ3YW2UFJ4F7U63IZLTFL","short_pith_number":"pith:QOSABOZ3","schema_version":"1.0","canonical_sha256":"83a400bb3bc5b542a785fd3db465732ac08fa31710dd4ed742e8ab7d7dbe4a91","source":{"kind":"arxiv","id":"1903.02353","version":1},"attestation_state":"computed","paper":{"title":"The $k$-Fr\\'echet distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hugo A Akitaya, J\\'er\\^ome Urhausen, Leonie Ryvkin, Maike Buchin","submitted_at":"2019-03-06T13:14:02Z","abstract_excerpt":"We introduce a new distance measure for comparing polygonal chains: the $k$-Fr\\'echet distance. As the name implies, it is closely related to the well-studied Fr\\'echet distance but detects similarities between curves that resemble each other only piecewise. The parameter $k$ denotes the number of subcurves into which we divide the input curves. The $k$-Fr\\'echet distance provides a nice transition between (weak) Fr\\'echet distance and Hausdorff distance. However, we show that deciding this distance measure turns out to be NP-complete, which is interesting since both (weak) Fr\\'echet and Hausd"},"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":"1903.02353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-06T13:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"5e6fa3876f8be7e4ef2b579e75a81587308da88cada81172952e3753adabf3a0","abstract_canon_sha256":"964fe0a192215495bfc0e75d5d874730f3b087243448c5ae124b6abb28be7e0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.524364Z","signature_b64":"K71WkLqybze8z4+aJyosWM8HP31xj0ecDPxH/IsAPNjQUvOhq/2xFfmO4QON3/YONYWglEIGaiuZv8Of0WtCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a400bb3bc5b542a785fd3db465732ac08fa31710dd4ed742e8ab7d7dbe4a91","last_reissued_at":"2026-05-17T23:51:55.523863Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.523863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $k$-Fr\\'echet distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hugo A Akitaya, J\\'er\\^ome Urhausen, Leonie Ryvkin, Maike Buchin","submitted_at":"2019-03-06T13:14:02Z","abstract_excerpt":"We introduce a new distance measure for comparing polygonal chains: the $k$-Fr\\'echet distance. As the name implies, it is closely related to the well-studied Fr\\'echet distance but detects similarities between curves that resemble each other only piecewise. The parameter $k$ denotes the number of subcurves into which we divide the input curves. The $k$-Fr\\'echet distance provides a nice transition between (weak) Fr\\'echet distance and Hausdorff distance. However, we show that deciding this distance measure turns out to be NP-complete, which is interesting since both (weak) Fr\\'echet and Hausd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02353","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":"1903.02353","created_at":"2026-05-17T23:51:55.523942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02353v1","created_at":"2026-05-17T23:51:55.523942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02353","created_at":"2026-05-17T23:51:55.523942+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOSABOZ3YW2U","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOSABOZ3YW2UFJ4F","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOSABOZ3","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.08141","citing_title":"Rock Climber Distance: Frogs versus Dogs","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL","json":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL.json","graph_json":"https://pith.science/api/pith-number/QOSABOZ3YW2UFJ4F7U63IZLTFL/graph.json","events_json":"https://pith.science/api/pith-number/QOSABOZ3YW2UFJ4F7U63IZLTFL/events.json","paper":"https://pith.science/paper/QOSABOZ3"},"agent_actions":{"view_html":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL","download_json":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL.json","view_paper":"https://pith.science/paper/QOSABOZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02353&json=true","fetch_graph":"https://pith.science/api/pith-number/QOSABOZ3YW2UFJ4F7U63IZLTFL/graph.json","fetch_events":"https://pith.science/api/pith-number/QOSABOZ3YW2UFJ4F7U63IZLTFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL/action/storage_attestation","attest_author":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL/action/author_attestation","sign_citation":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL/action/citation_signature","submit_replication":"https://pith.science/pith/QOSABOZ3YW2UFJ4F7U63IZLTFL/action/replication_record"}},"created_at":"2026-05-17T23:51:55.523942+00:00","updated_at":"2026-05-17T23:51:55.523942+00:00"}