{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AFRORQWGS5N65WYX4WDCY2GZLA","short_pith_number":"pith:AFRORQWG","schema_version":"1.0","canonical_sha256":"0162e8c2c6975beedb17e5862c68d9580d342ef1e32ad8806aaf8e78f2ca5bd5","source":{"kind":"arxiv","id":"1205.2425","version":1},"attestation_state":"computed","paper":{"title":"Flip Distance Between Two Triangulations of a Point-Set is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Vinayak Pathak","submitted_at":"2012-05-11T03:50:31Z","abstract_excerpt":"Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two natural generalizations of the problem are NP-complete, namely computing the minimum number of flips between two triangulations of (1) a polygon with holes; (2) a set of points in the plane."},"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":"1205.2425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-11T03:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"d719f71746ee1bdd0f684e2372ca3aa7d3782a5be8dd368fdcc1b6c31b20c57b","abstract_canon_sha256":"6eb221aca27c06e5a8b783610288befefb13ada26b4da721aa15f015dfbe7adf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:55.570725Z","signature_b64":"02FQGuGZJEQqFC4DYp6YTj6vPO9Y+8yQfSIUrCdl1Ea0Dex1HAoXxqzjBFcuVxjMyXN6UlFXPmqv7pJrRGTbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0162e8c2c6975beedb17e5862c68d9580d342ef1e32ad8806aaf8e78f2ca5bd5","last_reissued_at":"2026-05-18T03:55:55.570187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:55.570187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flip Distance Between Two Triangulations of a Point-Set is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Vinayak Pathak","submitted_at":"2012-05-11T03:50:31Z","abstract_excerpt":"Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two natural generalizations of the problem are NP-complete, namely computing the minimum number of flips between two triangulations of (1) a polygon with holes; (2) a set of points in the plane."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2425","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":"1205.2425","created_at":"2026-05-18T03:55:55.570283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2425v1","created_at":"2026-05-18T03:55:55.570283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2425","created_at":"2026-05-18T03:55:55.570283+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFRORQWGS5N6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFRORQWGS5N65WYX","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFRORQWG","created_at":"2026-05-18T12:26:58.693483+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/AFRORQWGS5N65WYX4WDCY2GZLA","json":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA.json","graph_json":"https://pith.science/api/pith-number/AFRORQWGS5N65WYX4WDCY2GZLA/graph.json","events_json":"https://pith.science/api/pith-number/AFRORQWGS5N65WYX4WDCY2GZLA/events.json","paper":"https://pith.science/paper/AFRORQWG"},"agent_actions":{"view_html":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA","download_json":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA.json","view_paper":"https://pith.science/paper/AFRORQWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2425&json=true","fetch_graph":"https://pith.science/api/pith-number/AFRORQWGS5N65WYX4WDCY2GZLA/graph.json","fetch_events":"https://pith.science/api/pith-number/AFRORQWGS5N65WYX4WDCY2GZLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA/action/storage_attestation","attest_author":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA/action/author_attestation","sign_citation":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA/action/citation_signature","submit_replication":"https://pith.science/pith/AFRORQWGS5N65WYX4WDCY2GZLA/action/replication_record"}},"created_at":"2026-05-18T03:55:55.570283+00:00","updated_at":"2026-05-18T03:55:55.570283+00:00"}