{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LCN42V7NEGJYYSYIM5PN453YNT","short_pith_number":"pith:LCN42V7N","canonical_record":{"source":{"id":"1310.1726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-07T10:51:41Z","cross_cats_sorted":["math.CO","math.MG"],"title_canon_sha256":"834556664b8425c16f577cd49e837f883236fc69070ad791bfdaa02159759e30","abstract_canon_sha256":"0efc2736f68536633c2590eea9404334c94873b44a605614e0a0946934050700"},"schema_version":"1.0"},"canonical_sha256":"589bcd57ed21938c4b08675ede77786cd2f69b82ea89a484e0cee2b95f73a01d","source":{"kind":"arxiv","id":"1310.1726","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LCN42V7NEGJYYSYIM5PN453YNT","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-07T10:51:41Z","cross_cats_sorted":["math.CO","math.MG"],"title_canon_sha256":"834556664b8425c16f577cd49e837f883236fc69070ad791bfdaa02159759e30","abstract_canon_sha256":"0efc2736f68536633c2590eea9404334c94873b44a605614e0a0946934050700"},"schema_version":"1.0"},"canonical_sha256":"589bcd57ed21938c4b08675ede77786cd2f69b82ea89a484e0cee2b95f73a01d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.824072Z","signature_b64":"px+FqNUOvJQyVdqMXy52V6m/wbJBwxi8AOyfoWA2fNScZieu1qcvRrs2RwBQx8Ey698ecrlhjaw4FjQEGo/rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"589bcd57ed21938c4b08675ede77786cd2f69b82ea89a484e0cee2b95f73a01d","last_reissued_at":"2026-05-18T03:11:10.823187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.823187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1726","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:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCghAjhRc8vVPKUvPMXfEIF7o6cF7iLUgIZSguGknrShmaunoGq63VRLyESL9igSHHYFk6G9yi8+bMHK8gxeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:40:10.153799Z"},"content_sha256":"024ec39e129695e6dd73586ab50822f820786bf1a099d0ae87e95d2f8d8d88d2","schema_version":"1.0","event_id":"sha256:024ec39e129695e6dd73586ab50822f820786bf1a099d0ae87e95d2f8d8d88d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LCN42V7NEGJYYSYIM5PN453YNT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Four-connected triangulations of planar point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"cs.CG","authors_text":"Ajit Arvind Diwan, Bodhayan Roy, Subir Kumar Ghosh","submitted_at":"2013-10-07T10:51:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1726","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:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HPvM4Ka6+Vcrlyy1goBerTceAI3OFoP5ffb1fylvhsRF9MkBfdDFEiKSj5+PUmvplAgdzcHLfqco7GQcB1aSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:40:10.154153Z"},"content_sha256":"bf2abdaaba5e5366bc398d7ef272f330d09fe3849bb1a7df748c4a9805817f52","schema_version":"1.0","event_id":"sha256:bf2abdaaba5e5366bc398d7ef272f330d09fe3849bb1a7df748c4a9805817f52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCN42V7NEGJYYSYIM5PN453YNT/bundle.json","state_url":"https://pith.science/pith/LCN42V7NEGJYYSYIM5PN453YNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCN42V7NEGJYYSYIM5PN453YNT/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-06-20T01:40:10Z","links":{"resolver":"https://pith.science/pith/LCN42V7NEGJYYSYIM5PN453YNT","bundle":"https://pith.science/pith/LCN42V7NEGJYYSYIM5PN453YNT/bundle.json","state":"https://pith.science/pith/LCN42V7NEGJYYSYIM5PN453YNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCN42V7NEGJYYSYIM5PN453YNT/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOdZ2RPHejhpcA1xVtiEelk8LjmWKT2LMNoqLWpK4c5v5A+dxPl/xz+R6HIxagSHl7H6RvOf/Qzg+pMYO51VBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T01:40:10.156101Z","bundle_sha256":"dec149c03c5658c2d1df2d485647765f0dad333d7d20b1000d82645ca7faff72"}}