{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BLMRB6NBZXQFHVENRDBGAXRRDG","short_pith_number":"pith:BLMRB6NB","schema_version":"1.0","canonical_sha256":"0ad910f9a1cde053d48d88c2605e3119912f0d6bb6362ceb1e68531d5084dbf2","source":{"kind":"arxiv","id":"1206.3179","version":3},"attestation_state":"computed","paper":{"title":"Flip Distance Between Triangulations of a Planar Point Set is APX-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Pilz","submitted_at":"2012-06-14T17:01:42Z","abstract_excerpt":"In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one edge and adding another one, such that the resulting graph is again a triangulation. Flips are a major way of locally transforming triangular meshes. We show that, given a point set $S$ in the Euclidean plane and two triangulations $T_1$ and $T_2$ of $S$, it is an APX-hard problem to minimize the number of edge flips to transform $T_1$ to $T_2$."},"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":"1206.3179","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-06-14T17:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"153ef9e946cc90882ad29db2a5debbffe3c65760b593e6f6a1704e0acd7485c2","abstract_canon_sha256":"54e343b72bc02059b83de1df1a951abc0f2c4acbbe3b20793f5125126aecc556"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:18.335072Z","signature_b64":"hTtvIJSZxgTYuvN3RNHLNtc4r3ZIb5LHiuRlz38OjCKErmQGrMv8Y/jK6Ery5llY1Wtgt3/7628BC9/GjgpnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ad910f9a1cde053d48d88c2605e3119912f0d6bb6362ceb1e68531d5084dbf2","last_reissued_at":"2026-05-18T02:14:18.334509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:18.334509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flip Distance Between Triangulations of a Planar Point Set is APX-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Pilz","submitted_at":"2012-06-14T17:01:42Z","abstract_excerpt":"In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one edge and adding another one, such that the resulting graph is again a triangulation. Flips are a major way of locally transforming triangular meshes. We show that, given a point set $S$ in the Euclidean plane and two triangulations $T_1$ and $T_2$ of $S$, it is an APX-hard problem to minimize the number of edge flips to transform $T_1$ to $T_2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3179","kind":"arxiv","version":3},"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":"1206.3179","created_at":"2026-05-18T02:14:18.334621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3179v3","created_at":"2026-05-18T02:14:18.334621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3179","created_at":"2026-05-18T02:14:18.334621+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLMRB6NBZXQF","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLMRB6NBZXQFHVEN","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLMRB6NB","created_at":"2026-05-18T12:27:01.376967+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/BLMRB6NBZXQFHVENRDBGAXRRDG","json":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG.json","graph_json":"https://pith.science/api/pith-number/BLMRB6NBZXQFHVENRDBGAXRRDG/graph.json","events_json":"https://pith.science/api/pith-number/BLMRB6NBZXQFHVENRDBGAXRRDG/events.json","paper":"https://pith.science/paper/BLMRB6NB"},"agent_actions":{"view_html":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG","download_json":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG.json","view_paper":"https://pith.science/paper/BLMRB6NB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3179&json=true","fetch_graph":"https://pith.science/api/pith-number/BLMRB6NBZXQFHVENRDBGAXRRDG/graph.json","fetch_events":"https://pith.science/api/pith-number/BLMRB6NBZXQFHVENRDBGAXRRDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG/action/storage_attestation","attest_author":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG/action/author_attestation","sign_citation":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG/action/citation_signature","submit_replication":"https://pith.science/pith/BLMRB6NBZXQFHVENRDBGAXRRDG/action/replication_record"}},"created_at":"2026-05-18T02:14:18.334621+00:00","updated_at":"2026-05-18T02:14:18.334621+00:00"}