{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GNSO6RT7KAYBZHKDRNCMS2XTZJ","short_pith_number":"pith:GNSO6RT7","schema_version":"1.0","canonical_sha256":"3364ef467f50301c9d438b44c96af3ca58414485d5167fd526bd1bce28573ff5","source":{"kind":"arxiv","id":"1309.3858","version":1},"attestation_state":"computed","paper":{"title":"Geodesic-Preserving Polygon Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Pilz, Birgit Vogtenhuber, Matias Korman, Oswin Aichholzer, Thomas Hackl","submitted_at":"2013-09-16T08:50:17Z","abstract_excerpt":"Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve is often related to the reflex vertices of the polygon. In this paper, we give an easy-to-describe linear-time method to replace an input polygon $\\mathcal{P}$ by a polygon $\\mathcal{P}'$ such that (1) $\\mathcal{P}'$ contains $\\mathcal{P}$, (2) $\\mathcal{P}'$ has its reflex vertices at the same positions as $\\mathcal{P}$, and (3) the number of"},"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":"1309.3858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-09-16T08:50:17Z","cross_cats_sorted":[],"title_canon_sha256":"83638de018ca0146607c661ccb36b5c8116b940033eb99d34c5afd640a097f15","abstract_canon_sha256":"4e841c68322558adb7d71a8d15501add07284d2de7a6f850d4b0ec2bef146d3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:12.140278Z","signature_b64":"SsWvk83AlbP76AD4ZLLUvQ8H1HogOz9v3omTfej5BtTA5DWM/Tz+uJpP+KAiIURJZs3GZaUXRophoxhA4c/LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3364ef467f50301c9d438b44c96af3ca58414485d5167fd526bd1bce28573ff5","last_reissued_at":"2026-05-18T03:13:12.139430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:12.139430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geodesic-Preserving Polygon Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Pilz, Birgit Vogtenhuber, Matias Korman, Oswin Aichholzer, Thomas Hackl","submitted_at":"2013-09-16T08:50:17Z","abstract_excerpt":"Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve is often related to the reflex vertices of the polygon. In this paper, we give an easy-to-describe linear-time method to replace an input polygon $\\mathcal{P}$ by a polygon $\\mathcal{P}'$ such that (1) $\\mathcal{P}'$ contains $\\mathcal{P}$, (2) $\\mathcal{P}'$ has its reflex vertices at the same positions as $\\mathcal{P}$, and (3) the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3858","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":"1309.3858","created_at":"2026-05-18T03:13:12.139578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3858v1","created_at":"2026-05-18T03:13:12.139578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3858","created_at":"2026-05-18T03:13:12.139578+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNSO6RT7KAYB","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNSO6RT7KAYBZHKD","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNSO6RT7","created_at":"2026-05-18T12:27:45.050594+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/GNSO6RT7KAYBZHKDRNCMS2XTZJ","json":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ.json","graph_json":"https://pith.science/api/pith-number/GNSO6RT7KAYBZHKDRNCMS2XTZJ/graph.json","events_json":"https://pith.science/api/pith-number/GNSO6RT7KAYBZHKDRNCMS2XTZJ/events.json","paper":"https://pith.science/paper/GNSO6RT7"},"agent_actions":{"view_html":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ","download_json":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ.json","view_paper":"https://pith.science/paper/GNSO6RT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3858&json=true","fetch_graph":"https://pith.science/api/pith-number/GNSO6RT7KAYBZHKDRNCMS2XTZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GNSO6RT7KAYBZHKDRNCMS2XTZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/action/storage_attestation","attest_author":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/action/author_attestation","sign_citation":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/action/citation_signature","submit_replication":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/action/replication_record"}},"created_at":"2026-05-18T03:13:12.139578+00:00","updated_at":"2026-05-18T03:13:12.139578+00:00"}