{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NQLWULPHO5M5Y7WDB4IEUAVDJN","short_pith_number":"pith:NQLWULPH","canonical_record":{"source":{"id":"1806.02647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-06-07T12:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"99d172e31b8b1e85b3e19812109f96ee4a6e7396546d95cd88a02cefe1ffee17","abstract_canon_sha256":"b5e319197812ecb8906e83e4e6ac3a4463695c7cbef2ec79e07fcf70d87e5a16"},"schema_version":"1.0"},"canonical_sha256":"6c176a2de77759dc7ec30f104a02a34b700cdca06c1bb44f61769be93f2caae5","source":{"kind":"arxiv","id":"1806.02647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02647","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02647v1","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02647","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"NQLWULPHO5M5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NQLWULPHO5M5Y7WD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NQLWULPH","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NQLWULPHO5M5Y7WDB4IEUAVDJN","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-06-07T12:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"99d172e31b8b1e85b3e19812109f96ee4a6e7396546d95cd88a02cefe1ffee17","abstract_canon_sha256":"b5e319197812ecb8906e83e4e6ac3a4463695c7cbef2ec79e07fcf70d87e5a16"},"schema_version":"1.0"},"canonical_sha256":"6c176a2de77759dc7ec30f104a02a34b700cdca06c1bb44f61769be93f2caae5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:56.096282Z","signature_b64":"CYTwWhrercszOom+ZckbdSiOV2i8cb0+AtqwaJ4UciKsoo/Wnk+zkh5loK3GXDUkcKKCx7qIizRjrGEi3LORCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c176a2de77759dc7ec30f104a02a34b700cdca06c1bb44f61769be93f2caae5","last_reissued_at":"2026-05-18T00:13:56.095578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:56.095578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02647","source_version":1,"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:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87kcC9HWtj526erT/Nn/xP6pE9vtYQLUxFkP9c6P/2EOvxsIA43hLLnIm6mwZ9iKyCuwXLPpOY4zudQr9itJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:14:53.946163Z"},"content_sha256":"6d209709cf25ed84f2936c3a81f2cecbe3875fd94da1d134e1dfb33139d89557","schema_version":"1.0","event_id":"sha256:6d209709cf25ed84f2936c3a81f2cecbe3875fd94da1d134e1dfb33139d89557"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NQLWULPHO5M5Y7WDB4IEUAVDJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Progressive Simplification of Polygonal Curves","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kevin Buchin, Maximilian Konzack, Wim Reddingius","submitted_at":"2018-06-07T12:51:07Z","abstract_excerpt":"Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of detail. We present an $O(n^3m)$-time algorithm that takes a polygonal curve of n vertices and produces a set of consistent simplifications for m scales while minimizing the cumulative simplification complexity. This algorithm is compatible with distance measures such as the Hausdorff, the Fr\\'echet and area-based distances, and enables simplification for con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02647","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"},"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:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LAnGmeuO/al25GtkIPjfRyWZKuJU5O4Pwhb1R600yVeHrAdzwsVST36zjf8AWrOEafxlPlp0Hh31dKUMIRBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:14:53.946840Z"},"content_sha256":"7f6aa92a6307ad96cb5a87f0b27539023685ea61a7fa5a48859af4c40d71d53e","schema_version":"1.0","event_id":"sha256:7f6aa92a6307ad96cb5a87f0b27539023685ea61a7fa5a48859af4c40d71d53e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/bundle.json","state_url":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/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-22T03:14:53Z","links":{"resolver":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN","bundle":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/bundle.json","state":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NQLWULPHO5M5Y7WDB4IEUAVDJN","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":"b5e319197812ecb8906e83e4e6ac3a4463695c7cbef2ec79e07fcf70d87e5a16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-06-07T12:51:07Z","title_canon_sha256":"99d172e31b8b1e85b3e19812109f96ee4a6e7396546d95cd88a02cefe1ffee17"},"schema_version":"1.0","source":{"id":"1806.02647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02647","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02647v1","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02647","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"NQLWULPHO5M5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NQLWULPHO5M5Y7WD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NQLWULPH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:7f6aa92a6307ad96cb5a87f0b27539023685ea61a7fa5a48859af4c40d71d53e","target":"graph","created_at":"2026-05-18T00:13:56Z","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":"Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of detail. We present an $O(n^3m)$-time algorithm that takes a polygonal curve of n vertices and produces a set of consistent simplifications for m scales while minimizing the cumulative simplification complexity. This algorithm is compatible with distance measures such as the Hausdorff, the Fr\\'echet and area-based distances, and enables simplification for con","authors_text":"Kevin Buchin, Maximilian Konzack, Wim Reddingius","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-06-07T12:51:07Z","title":"Progressive Simplification of Polygonal Curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02647","kind":"arxiv","version":1},"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:6d209709cf25ed84f2936c3a81f2cecbe3875fd94da1d134e1dfb33139d89557","target":"record","created_at":"2026-05-18T00:13:56Z","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":"b5e319197812ecb8906e83e4e6ac3a4463695c7cbef2ec79e07fcf70d87e5a16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-06-07T12:51:07Z","title_canon_sha256":"99d172e31b8b1e85b3e19812109f96ee4a6e7396546d95cd88a02cefe1ffee17"},"schema_version":"1.0","source":{"id":"1806.02647","kind":"arxiv","version":1}},"canonical_sha256":"6c176a2de77759dc7ec30f104a02a34b700cdca06c1bb44f61769be93f2caae5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c176a2de77759dc7ec30f104a02a34b700cdca06c1bb44f61769be93f2caae5","first_computed_at":"2026-05-18T00:13:56.095578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:56.095578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CYTwWhrercszOom+ZckbdSiOV2i8cb0+AtqwaJ4UciKsoo/Wnk+zkh5loK3GXDUkcKKCx7qIizRjrGEi3LORCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:56.096282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d209709cf25ed84f2936c3a81f2cecbe3875fd94da1d134e1dfb33139d89557","sha256:7f6aa92a6307ad96cb5a87f0b27539023685ea61a7fa5a48859af4c40d71d53e"],"state_sha256":"82e57bf79807b52ab28aef75cae830d3f4e951a470e5865c46af32688760dafd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqgJrqH9P8EZEqaA0psn1fKz8u7ooI8tpkxgTWsMVFfWMqQxpZkwia3Hsa2K2J4q0+eBXXJ4nfufz97/chBZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T03:14:53.950355Z","bundle_sha256":"008f270d1df313e5781446ffa2e3c55ac11bef000f62c292874ada225fcaf318"}}