{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JI7XRYKJIIZGDMRP22DBB4G4DU","short_pith_number":"pith:JI7XRYKJ","schema_version":"1.0","canonical_sha256":"4a3f78e149423261b22fd68610f0dc1d226ddc9b2ab33e877119bbb0a96c26fc","source":{"kind":"arxiv","id":"1611.02541","version":2},"attestation_state":"computed","paper":{"title":"Arc diagrams, flip distances, and Hamiltonian triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Jean Cardinal, Manuel Wettstein, Michael Hoffmann, Vincent Kusters","submitted_at":"2016-11-08T14:53:44Z","abstract_excerpt":"We show that every triangulation (maximal planar graph) on $n\\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity as a means to establish Hamiltonicity. But in general about $3n/5$ flips are necessary to reach a $4$-connected triangulation. Our result improves the upper bound on the diameter of the flip graph of combinatorial triangulations on $n$ vertices from $5.2n-33.6$ to $5n-23$. We also show that for every triangulation on $n$ vertices there is a simultaneous fli"},"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":"1611.02541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-08T14:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"59f57490ae3206b7483b317a15be6385dce4d26d9a43b94d9dd86b4d5527d684","abstract_canon_sha256":"8982f0318d617ad36bd84028ea9002200a730596e18ce7b7dd5f17f0801d28a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.023904Z","signature_b64":"pIQtdu8+aeoC0WYCinHcAk+5UqM/kQIQf20W4qv85ufMJkjOAMJYoo2eWglyzO7QrnjRNgTbk5BJo4fx+lauBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3f78e149423261b22fd68610f0dc1d226ddc9b2ab33e877119bbb0a96c26fc","last_reissued_at":"2026-05-18T00:59:34.023239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.023239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arc diagrams, flip distances, and Hamiltonian triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Jean Cardinal, Manuel Wettstein, Michael Hoffmann, Vincent Kusters","submitted_at":"2016-11-08T14:53:44Z","abstract_excerpt":"We show that every triangulation (maximal planar graph) on $n\\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity as a means to establish Hamiltonicity. But in general about $3n/5$ flips are necessary to reach a $4$-connected triangulation. Our result improves the upper bound on the diameter of the flip graph of combinatorial triangulations on $n$ vertices from $5.2n-33.6$ to $5n-23$. We also show that for every triangulation on $n$ vertices there is a simultaneous fli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02541","kind":"arxiv","version":2},"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":"1611.02541","created_at":"2026-05-18T00:59:34.023335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02541v2","created_at":"2026-05-18T00:59:34.023335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02541","created_at":"2026-05-18T00:59:34.023335+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI7XRYKJIIZG","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI7XRYKJIIZGDMRP","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI7XRYKJ","created_at":"2026-05-18T12:30:25.849896+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/JI7XRYKJIIZGDMRP22DBB4G4DU","json":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU.json","graph_json":"https://pith.science/api/pith-number/JI7XRYKJIIZGDMRP22DBB4G4DU/graph.json","events_json":"https://pith.science/api/pith-number/JI7XRYKJIIZGDMRP22DBB4G4DU/events.json","paper":"https://pith.science/paper/JI7XRYKJ"},"agent_actions":{"view_html":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU","download_json":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU.json","view_paper":"https://pith.science/paper/JI7XRYKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02541&json=true","fetch_graph":"https://pith.science/api/pith-number/JI7XRYKJIIZGDMRP22DBB4G4DU/graph.json","fetch_events":"https://pith.science/api/pith-number/JI7XRYKJIIZGDMRP22DBB4G4DU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU/action/storage_attestation","attest_author":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU/action/author_attestation","sign_citation":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU/action/citation_signature","submit_replication":"https://pith.science/pith/JI7XRYKJIIZGDMRP22DBB4G4DU/action/replication_record"}},"created_at":"2026-05-18T00:59:34.023335+00:00","updated_at":"2026-05-18T00:59:34.023335+00:00"}