{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T3IJ2DXBNYKSTPKJU2VHZ3NGYQ","short_pith_number":"pith:T3IJ2DXB","canonical_record":{"source":{"id":"1603.07401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T00:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"77c0957c8d7113005fda3d0bca257f5e266e4d6ec12eba4694be6a5645be26f8","abstract_canon_sha256":"83ebb632966e94ec3df566beb6e094e75476dcfe2f364faabe5db81ccec31490"},"schema_version":"1.0"},"canonical_sha256":"9ed09d0ee16e1529bd49a6aa7ceda6c43da53a1583406484493dd40e4d0a71a3","source":{"kind":"arxiv","id":"1603.07401","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07401","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07401v2","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07401","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"T3IJ2DXBNYKS","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3IJ2DXBNYKSTPKJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3IJ2DXB","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T3IJ2DXBNYKSTPKJU2VHZ3NGYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T00:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"77c0957c8d7113005fda3d0bca257f5e266e4d6ec12eba4694be6a5645be26f8","abstract_canon_sha256":"83ebb632966e94ec3df566beb6e094e75476dcfe2f364faabe5db81ccec31490"},"schema_version":"1.0"},"canonical_sha256":"9ed09d0ee16e1529bd49a6aa7ceda6c43da53a1583406484493dd40e4d0a71a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:13.623513Z","signature_b64":"92OatuuEP+/VZw4KuoZ77ddk7lUZrYSJSS8kCesuEukR/WGrEPqMTcY1vM/Wh66es8/WaakxnKdgvUeQPMpPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed09d0ee16e1529bd49a6aa7ceda6c43da53a1583406484493dd40e4d0a71a3","last_reissued_at":"2026-05-18T00:39:13.622837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:13.622837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07401","source_version":2,"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:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nF4o9hxh3f3tnj1a7U1bbqJpZCiQnHYNmJyYKpPDY3jlL1g365UqiIAwesd74EqDLDM1HBI6fBgFSLUoi1cABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:03:33.409715Z"},"content_sha256":"44926187310cc6ff9b9b3ec25a2438d154423989ef948faa274e7f128d30f9dd","schema_version":"1.0","event_id":"sha256:44926187310cc6ff9b9b3ec25a2438d154423989ef948faa274e7f128d30f9dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T3IJ2DXBNYKSTPKJU2VHZ3NGYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognizing Weakly Simple Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Greg Aloupis, Hugo Akitaya, Jeff Erickson","submitted_at":"2016-03-24T00:53:05Z","abstract_excerpt":"We present an $O(n\\log n)$-time algorithm that determines whether a given planar $n$-gon is weakly simple. This improves upon an $O(n^2\\log n)$-time algorithm by Chang, Erickson, and Xu (2015). Weakly simple polygons are required as input for several geometric algorithms. As such, how to recognize simple or weakly simple polygons is a fundamental question."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07401","kind":"arxiv","version":2},"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:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoW4nGqHnojT7NXg8sz901FHldnzgJUe5jPPjZjiA0VUVVdloZn6HwrOYJRGnPkDUaVirFNdcV0caD1UTJkSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:03:33.410182Z"},"content_sha256":"4c87b350060d24becf76bc31bc8e96f5b9d8cc0a06291e5d11ca24e394bdf601","schema_version":"1.0","event_id":"sha256:4c87b350060d24becf76bc31bc8e96f5b9d8cc0a06291e5d11ca24e394bdf601"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3IJ2DXBNYKSTPKJU2VHZ3NGYQ/bundle.json","state_url":"https://pith.science/pith/T3IJ2DXBNYKSTPKJU2VHZ3NGYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3IJ2DXBNYKSTPKJU2VHZ3NGYQ/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-28T17:03:33Z","links":{"resolver":"https://pith.science/pith/T3IJ2DXBNYKSTPKJU2VHZ3NGYQ","bundle":"https://pith.science/pith/T3IJ2DXBNYKSTPKJU2VHZ3NGYQ/bundle.json","state":"https://pith.science/pith/T3IJ2DXBNYKSTPKJU2VHZ3NGYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3IJ2DXBNYKSTPKJU2VHZ3NGYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T3IJ2DXBNYKSTPKJU2VHZ3NGYQ","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":"83ebb632966e94ec3df566beb6e094e75476dcfe2f364faabe5db81ccec31490","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T00:53:05Z","title_canon_sha256":"77c0957c8d7113005fda3d0bca257f5e266e4d6ec12eba4694be6a5645be26f8"},"schema_version":"1.0","source":{"id":"1603.07401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07401","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07401v2","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07401","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"T3IJ2DXBNYKS","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3IJ2DXBNYKSTPKJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3IJ2DXB","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:4c87b350060d24becf76bc31bc8e96f5b9d8cc0a06291e5d11ca24e394bdf601","target":"graph","created_at":"2026-05-18T00:39:13Z","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":"We present an $O(n\\log n)$-time algorithm that determines whether a given planar $n$-gon is weakly simple. This improves upon an $O(n^2\\log n)$-time algorithm by Chang, Erickson, and Xu (2015). Weakly simple polygons are required as input for several geometric algorithms. As such, how to recognize simple or weakly simple polygons is a fundamental question.","authors_text":"Csaba D. T\\'oth, Greg Aloupis, Hugo Akitaya, Jeff Erickson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T00:53:05Z","title":"Recognizing Weakly Simple Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07401","kind":"arxiv","version":2},"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:44926187310cc6ff9b9b3ec25a2438d154423989ef948faa274e7f128d30f9dd","target":"record","created_at":"2026-05-18T00:39:13Z","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":"83ebb632966e94ec3df566beb6e094e75476dcfe2f364faabe5db81ccec31490","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-24T00:53:05Z","title_canon_sha256":"77c0957c8d7113005fda3d0bca257f5e266e4d6ec12eba4694be6a5645be26f8"},"schema_version":"1.0","source":{"id":"1603.07401","kind":"arxiv","version":2}},"canonical_sha256":"9ed09d0ee16e1529bd49a6aa7ceda6c43da53a1583406484493dd40e4d0a71a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ed09d0ee16e1529bd49a6aa7ceda6c43da53a1583406484493dd40e4d0a71a3","first_computed_at":"2026-05-18T00:39:13.622837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:13.622837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"92OatuuEP+/VZw4KuoZ77ddk7lUZrYSJSS8kCesuEukR/WGrEPqMTcY1vM/Wh66es8/WaakxnKdgvUeQPMpPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:13.623513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44926187310cc6ff9b9b3ec25a2438d154423989ef948faa274e7f128d30f9dd","sha256:4c87b350060d24becf76bc31bc8e96f5b9d8cc0a06291e5d11ca24e394bdf601"],"state_sha256":"661e6c2bdc2a6b90b2cd45594627710768addaf57a73931eb46f9218a8f3ed23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31ZZE9DkMNTalE15rXfWKyV/wV1MrDITfQbEXMpl4YCebd7dDEl4hUNwwdehIUzQXAFIFGYebWfDa0Bbn4tEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:03:33.412920Z","bundle_sha256":"ededf89585092b9a81e0302055d54698d3f52dda576d5a89ce7ad326d157266a"}}