{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NTE4CWFHJOF76CS6Z3CPHHV7KH","short_pith_number":"pith:NTE4CWFH","schema_version":"1.0","canonical_sha256":"6cc9c158a74b8bff0a5ecec4f39ebf51dc6ec5e675a13c0ca2c66c3043530c4c","source":{"kind":"arxiv","id":"1209.4403","version":3},"attestation_state":"computed","paper":{"title":"Four Soviets Walk the Dog-Improved Bounds for Computing the Fr\\'echet Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Kevin Buchin, Maike Buchin, Wolfgang Mulzer, Wouter Meulemans","submitted_at":"2012-09-20T01:06:39Z","abstract_excerpt":"Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One popular measure is the Fr\\'echet distance. Since it was proposed by Alt and Godau in 1992, many variants and extensions have been studied. Nonetheless, even more than 20 years later, the original $O(n^2 \\log n)$ algorithm by Alt and Godau for computing the Fr\\'echet distance remains the state of the art (here, $n$ denotes the number of edges on each curve). This has led Helmut Alt to conjecture that the associated decision problem is 3SUM-hard.\n  In recent work, Agarwal et al. show h"},"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":"1209.4403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-20T01:06:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b26eb7fa9e744bf26bb826db3ef4f74803b06e9cc2967cc5b04961fe16f6e47a","abstract_canon_sha256":"a6073632089bfd721c0439ff9170d056ffd9f251f15f35296528896fc4335972"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:09.993164Z","signature_b64":"uRBfAxw2He5ddGjBVs46oXSNaZxS9mIbdCT4TMPkSHQVwPSnjy41SDLwkQ3IsVZte5rTdKUQORnEdGvHbCzzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc9c158a74b8bff0a5ecec4f39ebf51dc6ec5e675a13c0ca2c66c3043530c4c","last_reissued_at":"2026-05-18T00:43:09.992409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:09.992409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four Soviets Walk the Dog-Improved Bounds for Computing the Fr\\'echet Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Kevin Buchin, Maike Buchin, Wolfgang Mulzer, Wouter Meulemans","submitted_at":"2012-09-20T01:06:39Z","abstract_excerpt":"Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One popular measure is the Fr\\'echet distance. Since it was proposed by Alt and Godau in 1992, many variants and extensions have been studied. Nonetheless, even more than 20 years later, the original $O(n^2 \\log n)$ algorithm by Alt and Godau for computing the Fr\\'echet distance remains the state of the art (here, $n$ denotes the number of edges on each curve). This has led Helmut Alt to conjecture that the associated decision problem is 3SUM-hard.\n  In recent work, Agarwal et al. show h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4403","kind":"arxiv","version":3},"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":"1209.4403","created_at":"2026-05-18T00:43:09.992554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4403v3","created_at":"2026-05-18T00:43:09.992554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4403","created_at":"2026-05-18T00:43:09.992554+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTE4CWFHJOF7","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTE4CWFHJOF76CS6","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTE4CWFH","created_at":"2026-05-18T12:27:16.716162+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/NTE4CWFHJOF76CS6Z3CPHHV7KH","json":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH.json","graph_json":"https://pith.science/api/pith-number/NTE4CWFHJOF76CS6Z3CPHHV7KH/graph.json","events_json":"https://pith.science/api/pith-number/NTE4CWFHJOF76CS6Z3CPHHV7KH/events.json","paper":"https://pith.science/paper/NTE4CWFH"},"agent_actions":{"view_html":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH","download_json":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH.json","view_paper":"https://pith.science/paper/NTE4CWFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4403&json=true","fetch_graph":"https://pith.science/api/pith-number/NTE4CWFHJOF76CS6Z3CPHHV7KH/graph.json","fetch_events":"https://pith.science/api/pith-number/NTE4CWFHJOF76CS6Z3CPHHV7KH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH/action/storage_attestation","attest_author":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH/action/author_attestation","sign_citation":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH/action/citation_signature","submit_replication":"https://pith.science/pith/NTE4CWFHJOF76CS6Z3CPHHV7KH/action/replication_record"}},"created_at":"2026-05-18T00:43:09.992554+00:00","updated_at":"2026-05-18T00:43:09.992554+00:00"}