{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7FQALY5WKA7YB4WKLBQPRWMVIJ","short_pith_number":"pith:7FQALY5W","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"},"canonical_sha256":"f96005e3b6503f80f2ca5860f8d995424f25426e8ba9255f2a7491b7f34b08c5","source":{"kind":"arxiv","id":"1803.03550","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03550","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03550v3","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03550","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"7FQALY5WKA7Y","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7FQALY5WKA7YB4WK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7FQALY5W","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7FQALY5WKA7YB4WKLBQPRWMVIJ","target":"record","payload":{"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"},"canonical_sha256":"f96005e3b6503f80f2ca5860f8d995424f25426e8ba9255f2a7491b7f34b08c5","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"},"source_kind":"arxiv","source_id":"1803.03550","source_version":3,"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-18T00:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlKDWJ9Z9IbKUni24sg6FnzhYbvKI8eCoY1QNJG88q3T8LIyy82ysTz9kZX1eUUbN+zX3NdtShn7xmq0n9QFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:15.614411Z"},"content_sha256":"b3d28780add9a51446e9588e0357182f2204aa11ab977032ae502408ecb18ce2","schema_version":"1.0","event_id":"sha256:b3d28780add9a51446e9588e0357182f2204aa11ab977032ae502408ecb18ce2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7FQALY5WKA7YB4WKLBQPRWMVIJ","target":"graph","payload":{"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"},"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-18T00:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/AFOHDshJDi7gi7r6RlQgn4SCs0dXL9fzzhk85x792p25j9P9Sr3X9UFvEDDPgYTNsQBU+yVst84ToMN5aVWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:15.615121Z"},"content_sha256":"486e4d1eb4fdf57d1d8f186b124212d56b06bc487511cc8f20c45a49564b34e9","schema_version":"1.0","event_id":"sha256:486e4d1eb4fdf57d1d8f186b124212d56b06bc487511cc8f20c45a49564b34e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/bundle.json","state_url":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/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-05-25T10:59:15Z","links":{"resolver":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ","bundle":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/bundle.json","state":"https://pith.science/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FQALY5WKA7YB4WKLBQPRWMVIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7FQALY5WKA7YB4WKLBQPRWMVIJ","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":"66d2d04cab284b6b775a83af23afac8e08987e9fea0abb4baf5e60d5ac02e4c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T15:16:25Z","title_canon_sha256":"750b42964a3cd754e1bd67a79d0a5e383082eef15120c81f6ac3259bc5dbbfaa"},"schema_version":"1.0","source":{"id":"1803.03550","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03550","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03550v3","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03550","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"7FQALY5WKA7Y","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7FQALY5WKA7YB4WK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7FQALY5W","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:486e4d1eb4fdf57d1d8f186b124212d56b06bc487511cc8f20c45a49564b34e9","target":"graph","created_at":"2026-05-18T00:20:01Z","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 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","authors_text":"Lionov Wiratma, Maarten L\\\"offler, Marc van Kreveld","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T15:16:25Z","title":"On Optimal Polyline Simplification using the Hausdorff and Fr\\'echet Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03550","kind":"arxiv","version":3},"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:b3d28780add9a51446e9588e0357182f2204aa11ab977032ae502408ecb18ce2","target":"record","created_at":"2026-05-18T00:20:01Z","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":"66d2d04cab284b6b775a83af23afac8e08987e9fea0abb4baf5e60d5ac02e4c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T15:16:25Z","title_canon_sha256":"750b42964a3cd754e1bd67a79d0a5e383082eef15120c81f6ac3259bc5dbbfaa"},"schema_version":"1.0","source":{"id":"1803.03550","kind":"arxiv","version":3}},"canonical_sha256":"f96005e3b6503f80f2ca5860f8d995424f25426e8ba9255f2a7491b7f34b08c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f96005e3b6503f80f2ca5860f8d995424f25426e8ba9255f2a7491b7f34b08c5","first_computed_at":"2026-05-18T00:20:01.545602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:01.545602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zzn6yb1txEPPPh8CeSLXWcYsC2niD7lMv2/wLclhQA3sU2B48Ec68WrCyIGfv2OUZtrDERefoCT5uq//anGYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:01.546239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03550","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3d28780add9a51446e9588e0357182f2204aa11ab977032ae502408ecb18ce2","sha256:486e4d1eb4fdf57d1d8f186b124212d56b06bc487511cc8f20c45a49564b34e9"],"state_sha256":"f336ef0bc15cea58e237d73ffe6b98b9dcbd78fee4aa516070735c98c99bdcf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2gHYe3o8PfrnG4wvASs3kUAs5lR5bAuDLVJOlGMRV7yfMnmwIm7WMwqNRgqLs1iofPCzBIDHauXUbKxZ1p0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:59:15.618797Z","bundle_sha256":"b78f19693e6b5c0341dd4cc18441005b336691d6314b26c9ea886e431cfbc2e6"}}