{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4JW4IHHL7LLCOF6M3U6BMPZRSV","short_pith_number":"pith:4JW4IHHL","schema_version":"1.0","canonical_sha256":"e26dc41cebfad62717ccdd3c163f31956f3d6efba0736a7db0cac6f7b1531424","source":{"kind":"arxiv","id":"1102.1235","version":1},"attestation_state":"computed","paper":{"title":"On joint triangulations of two sets of points in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Ajit Arvind Diwan, Andrzej Lingas, Partha Pratim Goswami, Subir Kumar Ghosh","submitted_at":"2011-02-07T05:55:01Z","abstract_excerpt":"In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the problem of a joint triangulation of two simple polygons of $n$ vertices, we propose an $O(n^3)$ time algorithm for constructing a joint triangulation using dynamic programming."},"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":"1102.1235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-07T05:55:01Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"70fdd40af1321702300ef8334791e96537cc377488a4938e267451eb1ece5a83","abstract_canon_sha256":"41aea2ce43267a156a9bbec7ad6fb5ba48813063c48c4835f77f97dfa4d8a979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.703949Z","signature_b64":"Fh28JptWnGc38YeJ0cOAMBoTAwjij46MZVeuFSrWT5PhhFX4NC+qWIqmNcbQ6Q759r/Ol98H+nQ4lP7VkQWcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e26dc41cebfad62717ccdd3c163f31956f3d6efba0736a7db0cac6f7b1531424","last_reissued_at":"2026-05-18T04:29:54.703427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.703427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On joint triangulations of two sets of points in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Ajit Arvind Diwan, Andrzej Lingas, Partha Pratim Goswami, Subir Kumar Ghosh","submitted_at":"2011-02-07T05:55:01Z","abstract_excerpt":"In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the problem of a joint triangulation of two simple polygons of $n$ vertices, we propose an $O(n^3)$ time algorithm for constructing a joint triangulation using dynamic programming."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1235","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":"1102.1235","created_at":"2026-05-18T04:29:54.703508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1235v1","created_at":"2026-05-18T04:29:54.703508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1235","created_at":"2026-05-18T04:29:54.703508+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JW4IHHL7LLC","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JW4IHHL7LLCOF6M","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JW4IHHL","created_at":"2026-05-18T12:26:20.644004+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/4JW4IHHL7LLCOF6M3U6BMPZRSV","json":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV.json","graph_json":"https://pith.science/api/pith-number/4JW4IHHL7LLCOF6M3U6BMPZRSV/graph.json","events_json":"https://pith.science/api/pith-number/4JW4IHHL7LLCOF6M3U6BMPZRSV/events.json","paper":"https://pith.science/paper/4JW4IHHL"},"agent_actions":{"view_html":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV","download_json":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV.json","view_paper":"https://pith.science/paper/4JW4IHHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1235&json=true","fetch_graph":"https://pith.science/api/pith-number/4JW4IHHL7LLCOF6M3U6BMPZRSV/graph.json","fetch_events":"https://pith.science/api/pith-number/4JW4IHHL7LLCOF6M3U6BMPZRSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV/action/storage_attestation","attest_author":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV/action/author_attestation","sign_citation":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV/action/citation_signature","submit_replication":"https://pith.science/pith/4JW4IHHL7LLCOF6M3U6BMPZRSV/action/replication_record"}},"created_at":"2026-05-18T04:29:54.703508+00:00","updated_at":"2026-05-18T04:29:54.703508+00:00"}