{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GNSO6RT7KAYBZHKDRNCMS2XTZJ","short_pith_number":"pith:GNSO6RT7","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"},"canonical_sha256":"3364ef467f50301c9d438b44c96af3ca58414485d5167fd526bd1bce28573ff5","source":{"kind":"arxiv","id":"1309.3858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3858","created_at":"2026-05-18T03:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3858v1","created_at":"2026-05-18T03:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3858","created_at":"2026-05-18T03:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"GNSO6RT7KAYB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GNSO6RT7KAYBZHKD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GNSO6RT7","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GNSO6RT7KAYBZHKDRNCMS2XTZJ","target":"record","payload":{"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"},"canonical_sha256":"3364ef467f50301c9d438b44c96af3ca58414485d5167fd526bd1bce28573ff5","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"},"source_kind":"arxiv","source_id":"1309.3858","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-18T03:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcrfYIIKKX/UUusgMk4lGwZROnFDE9uk0w8WA1cssyr2dRfUo10uiELnklWShhZekvxHXx2jqxgl9j88W5wPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:31:06.112584Z"},"content_sha256":"a7dff6613762db1c92fbd16282429968e619fe3f52677c81f8ff0fd88342e6b0","schema_version":"1.0","event_id":"sha256:a7dff6613762db1c92fbd16282429968e619fe3f52677c81f8ff0fd88342e6b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GNSO6RT7KAYBZHKDRNCMS2XTZJ","target":"graph","payload":{"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"},"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-18T03:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtnZ50pOBRo2K1AEcPD6xtX+O/wX1JGErHGoLUWr0WjECb/RfXOOvYiuZq3EQxwLdD5Gp4WbekZZQfinF5icCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:31:06.112943Z"},"content_sha256":"845d2edb1161497ab3a3d71f507c905b7e83e3d9dad78116255ad85b036ed937","schema_version":"1.0","event_id":"sha256:845d2edb1161497ab3a3d71f507c905b7e83e3d9dad78116255ad85b036ed937"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/bundle.json","state_url":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/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-27T01:31:06Z","links":{"resolver":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ","bundle":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/bundle.json","state":"https://pith.science/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNSO6RT7KAYBZHKDRNCMS2XTZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GNSO6RT7KAYBZHKDRNCMS2XTZJ","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":"4e841c68322558adb7d71a8d15501add07284d2de7a6f850d4b0ec2bef146d3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-09-16T08:50:17Z","title_canon_sha256":"83638de018ca0146607c661ccb36b5c8116b940033eb99d34c5afd640a097f15"},"schema_version":"1.0","source":{"id":"1309.3858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3858","created_at":"2026-05-18T03:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3858v1","created_at":"2026-05-18T03:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3858","created_at":"2026-05-18T03:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"GNSO6RT7KAYB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GNSO6RT7KAYBZHKD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GNSO6RT7","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:845d2edb1161497ab3a3d71f507c905b7e83e3d9dad78116255ad85b036ed937","target":"graph","created_at":"2026-05-18T03:13:12Z","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":"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","authors_text":"Alexander Pilz, Birgit Vogtenhuber, Matias Korman, Oswin Aichholzer, Thomas Hackl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-09-16T08:50:17Z","title":"Geodesic-Preserving Polygon Simplification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3858","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:a7dff6613762db1c92fbd16282429968e619fe3f52677c81f8ff0fd88342e6b0","target":"record","created_at":"2026-05-18T03:13:12Z","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":"4e841c68322558adb7d71a8d15501add07284d2de7a6f850d4b0ec2bef146d3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-09-16T08:50:17Z","title_canon_sha256":"83638de018ca0146607c661ccb36b5c8116b940033eb99d34c5afd640a097f15"},"schema_version":"1.0","source":{"id":"1309.3858","kind":"arxiv","version":1}},"canonical_sha256":"3364ef467f50301c9d438b44c96af3ca58414485d5167fd526bd1bce28573ff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3364ef467f50301c9d438b44c96af3ca58414485d5167fd526bd1bce28573ff5","first_computed_at":"2026-05-18T03:13:12.139430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:12.139430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SsWvk83AlbP76AD4ZLLUvQ8H1HogOz9v3omTfej5BtTA5DWM/Tz+uJpP+KAiIURJZs3GZaUXRophoxhA4c/LAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:12.140278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7dff6613762db1c92fbd16282429968e619fe3f52677c81f8ff0fd88342e6b0","sha256:845d2edb1161497ab3a3d71f507c905b7e83e3d9dad78116255ad85b036ed937"],"state_sha256":"0d781e56d6890e2de2ca12e84f379a24cc29078e87c2fae323d2b37b17fa8569"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMuvNOlyX9FEdD/t04K326bD6K4sRFcHm1dBGXB8qHs6I6rpk0SVLCi7MqhBg5k1wVWbT346iVtHDzFcRqE1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:31:06.115326Z","bundle_sha256":"d8ac30284b7585d8e3e86a5d5894c52e1a7cfea0f5d33b8ce35812edd2e908e1"}}