{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:43VOFY7UWNWBF6Y3AVJKSH3CHN","short_pith_number":"pith:43VOFY7U","schema_version":"1.0","canonical_sha256":"e6eae2e3f4b36c12fb1b0552a91f623b598f8d17356b8db2961dd6e3e3f7e008","source":{"kind":"arxiv","id":"1901.01504","version":1},"attestation_state":"computed","paper":{"title":"Walking the Dog Fast in Practice: Algorithm Engineering of the Fr\\'echet Distance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Nusser, Karl Bringmann, Marvin K\\\"unnemann","submitted_at":"2019-01-06T06:16:48Z","abstract_excerpt":"The Fr\\'echet distance provides a natural and intuitive measure for the popular task of computing the similarity of two (polygonal) curves. While a simple algorithm computes it in near-quadratic time, a strongly subquadratic algorithm cannot exist unless the Strong Exponential Time Hypothesis fails. Still, fast practical implementations of the Fr\\'echet distance, in particular for realistic input curves, are highly desirable. This has even lead to a designated competition, the ACM SIGSPATIAL GIS Cup 2017: Here, the challenge was to implement a near-neighbor data structure under the Fr\\'echet d"},"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":"1901.01504","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2019-01-06T06:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"1fc8e37c0da822ad0c88e373338ed3d91ca8045ec03dd2cf6d15222f73683a78","abstract_canon_sha256":"13df5e9c0d7eccd84fb3afbbcf5134ad454ba077d72a591e5fa62697fb59248e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:51.845586Z","signature_b64":"fsjWaA1CesYTUZ3bEOZt2JMWwmrht30AMe5TEbcpFkGKZG8dEGJB+mEChujzgfwsTlfzNsqgHzjGbGYIek7zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6eae2e3f4b36c12fb1b0552a91f623b598f8d17356b8db2961dd6e3e3f7e008","last_reissued_at":"2026-05-17T23:56:51.845233Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:51.845233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walking the Dog Fast in Practice: Algorithm Engineering of the Fr\\'echet Distance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Nusser, Karl Bringmann, Marvin K\\\"unnemann","submitted_at":"2019-01-06T06:16:48Z","abstract_excerpt":"The Fr\\'echet distance provides a natural and intuitive measure for the popular task of computing the similarity of two (polygonal) curves. While a simple algorithm computes it in near-quadratic time, a strongly subquadratic algorithm cannot exist unless the Strong Exponential Time Hypothesis fails. Still, fast practical implementations of the Fr\\'echet distance, in particular for realistic input curves, are highly desirable. This has even lead to a designated competition, the ACM SIGSPATIAL GIS Cup 2017: Here, the challenge was to implement a near-neighbor data structure under the Fr\\'echet d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01504","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":"1901.01504","created_at":"2026-05-17T23:56:51.845288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01504v1","created_at":"2026-05-17T23:56:51.845288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01504","created_at":"2026-05-17T23:56:51.845288+00:00"},{"alias_kind":"pith_short_12","alias_value":"43VOFY7UWNWB","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"43VOFY7UWNWBF6Y3","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"43VOFY7U","created_at":"2026-05-18T12:33:10.108867+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/43VOFY7UWNWBF6Y3AVJKSH3CHN","json":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN.json","graph_json":"https://pith.science/api/pith-number/43VOFY7UWNWBF6Y3AVJKSH3CHN/graph.json","events_json":"https://pith.science/api/pith-number/43VOFY7UWNWBF6Y3AVJKSH3CHN/events.json","paper":"https://pith.science/paper/43VOFY7U"},"agent_actions":{"view_html":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN","download_json":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN.json","view_paper":"https://pith.science/paper/43VOFY7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01504&json=true","fetch_graph":"https://pith.science/api/pith-number/43VOFY7UWNWBF6Y3AVJKSH3CHN/graph.json","fetch_events":"https://pith.science/api/pith-number/43VOFY7UWNWBF6Y3AVJKSH3CHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN/action/storage_attestation","attest_author":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN/action/author_attestation","sign_citation":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN/action/citation_signature","submit_replication":"https://pith.science/pith/43VOFY7UWNWBF6Y3AVJKSH3CHN/action/replication_record"}},"created_at":"2026-05-17T23:56:51.845288+00:00","updated_at":"2026-05-17T23:56:51.845288+00:00"}