{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LJXB7E3XD7DLTLNIO4AKQEWF5F","short_pith_number":"pith:LJXB7E3X","schema_version":"1.0","canonical_sha256":"5a6e1f93771fc6b9ada87700a812c5e952fbc23dccd006a11f6cbc4cf0466539","source":{"kind":"arxiv","id":"1812.05656","version":1},"attestation_state":"computed","paper":{"title":"Polygon Simplification by Minimizing Convex Corners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Stephane Durocher, Yeganeh Bahoo","submitted_at":"2018-12-13T19:52:30Z","abstract_excerpt":"Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \\subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component $R'$ of $P'$, and the reflex corners of $R$ coincide with those of $R'$. A subsuming chain of $P'$ is a minimal path on the boundary of $P'$ whose two end edges coincide with two edges of $P$. Aichholzer et al. proved that every polygon $P$ has a subsuming polygon with $O(r)$ vertices, and posed an open problem to determine the computational complexity of co"},"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":"1812.05656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-13T19:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"b5251551e916cc869423f811b5ae1c5de569d03d8cc4d37e4113900ccb1e1346","abstract_canon_sha256":"6e7945fa4b4d4f275098993885dd919bc39f04a7590a325fb2910ee184d9b423"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:18.552797Z","signature_b64":"15Nv93ihqd4W+9j+a9kMO/a865iP8To6r41Wh5XhhOuVlavwN9VrIwAzuA6eas1PM9Xu2sLXMk7wawQAoHOhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a6e1f93771fc6b9ada87700a812c5e952fbc23dccd006a11f6cbc4cf0466539","last_reissued_at":"2026-05-17T23:58:18.552207Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:18.552207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polygon Simplification by Minimizing Convex Corners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Stephane Durocher, Yeganeh Bahoo","submitted_at":"2018-12-13T19:52:30Z","abstract_excerpt":"Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \\subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component $R'$ of $P'$, and the reflex corners of $R$ coincide with those of $R'$. A subsuming chain of $P'$ is a minimal path on the boundary of $P'$ whose two end edges coincide with two edges of $P$. Aichholzer et al. proved that every polygon $P$ has a subsuming polygon with $O(r)$ vertices, and posed an open problem to determine the computational complexity of co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05656","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":"1812.05656","created_at":"2026-05-17T23:58:18.552303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05656v1","created_at":"2026-05-17T23:58:18.552303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05656","created_at":"2026-05-17T23:58:18.552303+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJXB7E3XD7DL","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJXB7E3XD7DLTLNI","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJXB7E3X","created_at":"2026-05-18T12:32:37.024351+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/LJXB7E3XD7DLTLNIO4AKQEWF5F","json":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F.json","graph_json":"https://pith.science/api/pith-number/LJXB7E3XD7DLTLNIO4AKQEWF5F/graph.json","events_json":"https://pith.science/api/pith-number/LJXB7E3XD7DLTLNIO4AKQEWF5F/events.json","paper":"https://pith.science/paper/LJXB7E3X"},"agent_actions":{"view_html":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F","download_json":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F.json","view_paper":"https://pith.science/paper/LJXB7E3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05656&json=true","fetch_graph":"https://pith.science/api/pith-number/LJXB7E3XD7DLTLNIO4AKQEWF5F/graph.json","fetch_events":"https://pith.science/api/pith-number/LJXB7E3XD7DLTLNIO4AKQEWF5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F/action/storage_attestation","attest_author":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F/action/author_attestation","sign_citation":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F/action/citation_signature","submit_replication":"https://pith.science/pith/LJXB7E3XD7DLTLNIO4AKQEWF5F/action/replication_record"}},"created_at":"2026-05-17T23:58:18.552303+00:00","updated_at":"2026-05-17T23:58:18.552303+00:00"}