{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LCN42V7NEGJYYSYIM5PN453YNT","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":"0efc2736f68536633c2590eea9404334c94873b44a605614e0a0946934050700","cross_cats_sorted":["math.CO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-07T10:51:41Z","title_canon_sha256":"834556664b8425c16f577cd49e837f883236fc69070ad791bfdaa02159759e30"},"schema_version":"1.0","source":{"id":"1310.1726","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1726","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1726v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1726","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"LCN42V7NEGJY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LCN42V7NEGJYYSYI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LCN42V7N","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:bf2abdaaba5e5366bc398d7ef272f330d09fe3849bb1a7df748c4a9805817f52","target":"graph","created_at":"2026-05-18T03:11:10Z","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":"In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present an $O(n^3)$ algorithm of constructing a 4-connected triangulation of $P$. Thus, our algorithm solves a longstanding open problem in computational geometry and geometric graph theory. We also provide a simple method for constructing a noncomplex triangulation of $P$ which requires $O(n^2)$ steps. This method provides a new insight to the structure of 4-connect","authors_text":"Ajit Arvind Diwan, Bodhayan Roy, Subir Kumar Ghosh","cross_cats":["math.CO","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-07T10:51:41Z","title":"Four-connected triangulations of planar point sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1726","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:024ec39e129695e6dd73586ab50822f820786bf1a099d0ae87e95d2f8d8d88d2","target":"record","created_at":"2026-05-18T03:11:10Z","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":"0efc2736f68536633c2590eea9404334c94873b44a605614e0a0946934050700","cross_cats_sorted":["math.CO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-07T10:51:41Z","title_canon_sha256":"834556664b8425c16f577cd49e837f883236fc69070ad791bfdaa02159759e30"},"schema_version":"1.0","source":{"id":"1310.1726","kind":"arxiv","version":1}},"canonical_sha256":"589bcd57ed21938c4b08675ede77786cd2f69b82ea89a484e0cee2b95f73a01d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"589bcd57ed21938c4b08675ede77786cd2f69b82ea89a484e0cee2b95f73a01d","first_computed_at":"2026-05-18T03:11:10.823187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:10.823187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"px+FqNUOvJQyVdqMXy52V6m/wbJBwxi8AOyfoWA2fNScZieu1qcvRrs2RwBQx8Ey698ecrlhjaw4FjQEGo/rDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:10.824072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1726","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:024ec39e129695e6dd73586ab50822f820786bf1a099d0ae87e95d2f8d8d88d2","sha256:bf2abdaaba5e5366bc398d7ef272f330d09fe3849bb1a7df748c4a9805817f52"],"state_sha256":"1ca957b05eae866a583747f8bcc0d5de18bf25f4eb254bf19885bec2ec7d4fb9"}