{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7FQALY5WKA7YB4WKLBQPRWMVIJ","short_pith_number":"pith:7FQALY5W","schema_version":"1.0","canonical_sha256":"f96005e3b6503f80f2ca5860f8d995424f25426e8ba9255f2a7491b7f34b08c5","source":{"kind":"arxiv","id":"1803.03550","version":3},"attestation_state":"computed","paper":{"title":"On Optimal Polyline Simplification using the Hausdorff and Fr\\'echet Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lionov Wiratma, Maarten L\\\"offler, Marc van Kreveld","submitted_at":"2018-03-09T15:16:25Z","abstract_excerpt":"We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fr\\'echet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given $\\varepsilon$ > 0, choose a minimum size subsequence of the vertices of the input such that the Hausdorff or Fr\\'echet distance between the input and output polylines is at most $\\varepsilon$. We analyze how the well-known Douglas-Peucker and Imai-Iri simplification algorithms perform compared to the optimum possible, also in the situation where t"},"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":"1803.03550","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T15:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"750b42964a3cd754e1bd67a79d0a5e383082eef15120c81f6ac3259bc5dbbfaa","abstract_canon_sha256":"66d2d04cab284b6b775a83af23afac8e08987e9fea0abb4baf5e60d5ac02e4c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:01.546239Z","signature_b64":"zzn6yb1txEPPPh8CeSLXWcYsC2niD7lMv2/wLclhQA3sU2B48Ec68WrCyIGfv2OUZtrDERefoCT5uq//anGYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f96005e3b6503f80f2ca5860f8d995424f25426e8ba9255f2a7491b7f34b08c5","last_reissued_at":"2026-05-18T00:20:01.545602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:01.545602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimal Polyline Simplification using the Hausdorff and Fr\\'echet Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lionov Wiratma, Maarten L\\\"offler, Marc van Kreveld","submitted_at":"2018-03-09T15:16:25Z","abstract_excerpt":"We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fr\\'echet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given $\\varepsilon$ > 0, choose a minimum size subsequence of the vertices of the input such that the Hausdorff or Fr\\'echet distance between the input and output polylines is at most $\\varepsilon$. We analyze how the well-known Douglas-Peucker and Imai-Iri simplification algorithms perform compared to the optimum possible, also in the situation where t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03550","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":"1803.03550","created_at":"2026-05-18T00:20:01.545677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03550v3","created_at":"2026-05-18T00:20:01.545677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03550","created_at":"2026-05-18T00:20:01.545677+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FQALY5WKA7Y","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FQALY5WKA7YB4WK","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FQALY5W","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04420","citing_title":"Sublinear data structures for short Fr\\'echet queries","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ","json":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ.json","graph_json":"https://pith.science/api/pith-number/7FQALY5WKA7YB4WKLBQPRWMVIJ/graph.json","events_json":"https://pith.science/api/pith-number/7FQALY5WKA7YB4WKLBQPRWMVIJ/events.json","paper":"https://pith.science/paper/7FQALY5W"},"agent_actions":{"view_html":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ","download_json":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ.json","view_paper":"https://pith.science/paper/7FQALY5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03550&json=true","fetch_graph":"https://pith.science/api/pith-number/7FQALY5WKA7YB4WKLBQPRWMVIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7FQALY5WKA7YB4WKLBQPRWMVIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/action/storage_attestation","attest_author":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/action/author_attestation","sign_citation":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/action/citation_signature","submit_replication":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/action/replication_record"}},"created_at":"2026-05-18T00:20:01.545677+00:00","updated_at":"2026-05-18T00:20:01.545677+00:00"}