{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NQLWULPHO5M5Y7WDB4IEUAVDJN","short_pith_number":"pith:NQLWULPH","schema_version":"1.0","canonical_sha256":"6c176a2de77759dc7ec30f104a02a34b700cdca06c1bb44f61769be93f2caae5","source":{"kind":"arxiv","id":"1806.02647","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.02647","created_at":"2026-05-18T00:13:56.095714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02647v1","created_at":"2026-05-18T00:13:56.095714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02647","created_at":"2026-05-18T00:13:56.095714+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQLWULPHO5M5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQLWULPHO5M5Y7WD","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQLWULPH","created_at":"2026-05-18T12:32:40.477152+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/NQLWULPHO5M5Y7WDB4IEUAVDJN","json":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN.json","graph_json":"https://pith.science/api/pith-number/NQLWULPHO5M5Y7WDB4IEUAVDJN/graph.json","events_json":"https://pith.science/api/pith-number/NQLWULPHO5M5Y7WDB4IEUAVDJN/events.json","paper":"https://pith.science/paper/NQLWULPH"},"agent_actions":{"view_html":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN","download_json":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN.json","view_paper":"https://pith.science/paper/NQLWULPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02647&json=true","fetch_graph":"https://pith.science/api/pith-number/NQLWULPHO5M5Y7WDB4IEUAVDJN/graph.json","fetch_events":"https://pith.science/api/pith-number/NQLWULPHO5M5Y7WDB4IEUAVDJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/action/storage_attestation","attest_author":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/action/author_attestation","sign_citation":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/action/citation_signature","submit_replication":"https://pith.science/pith/NQLWULPHO5M5Y7WDB4IEUAVDJN/action/replication_record"}},"created_at":"2026-05-18T00:13:56.095714+00:00","updated_at":"2026-05-18T00:13:56.095714+00:00"}