{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XHERDWKRPAIDCG7Q3S7XYA5ME4","short_pith_number":"pith:XHERDWKR","schema_version":"1.0","canonical_sha256":"b9c911d9517810311bf0dcbf7c03ac2705006203affd153cb107055e01bdfbda","source":{"kind":"arxiv","id":"2605.02067","version":2},"attestation_state":"computed","paper":{"title":"Faster Mixing for Triangulations via Transport Flows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The triangulation flip chain on a convex (n+2)-gon mixes in Õ(n²) time.","cross_cats":["cs.CG","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Daniel Frishberg, Michail Sarantis, Prasad Tetali, Vedat Levi Alev","submitted_at":"2026-05-03T21:44:00Z","abstract_excerpt":"We prove an $\\widetilde O(n^2)$ bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex $(n+2)$-gon, implying a mixing time of $\\widetilde O(n^2)$. The previous state of the art for the mixing time of this chain, due to Eppstein and Frishberg, was $\\widetilde O(n^3)$, while the best known lower bound on the mixing time, due to Molloy, Reed, and Steiger, is $\\Omega(n^{3/2})$. Our relaxation time bound makes significant progress towards Aldous' conjectured bound of $\\Theta(n^{3/2})$ for the relaxation time.\n  We "},"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":true},"canonical_record":{"source":{"id":"2605.02067","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-03T21:44:00Z","cross_cats_sorted":["cs.CG","cs.DM","cs.DS"],"title_canon_sha256":"f931a3e4b9c5a46e20e1fa5caa83d1fb03bf3b35c458202569b5c0101c357546","abstract_canon_sha256":"69e286e97f88768d7af1ffc29de43d9512f7ebba2421e569da9483cd3c6b4232"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:11.805597Z","signature_b64":"UcFsX33GOibbv9Z1HCAswOv3VsK/46jBZzJjM9QhLZu7z3ejK6UfPW6WTjVBxDK4Sg9BZrY32UExmAhHFQE2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9c911d9517810311bf0dcbf7c03ac2705006203affd153cb107055e01bdfbda","last_reissued_at":"2026-05-26T02:04:11.804911Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:11.804911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Mixing for Triangulations via Transport Flows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The triangulation flip chain on a convex (n+2)-gon mixes in Õ(n²) time.","cross_cats":["cs.CG","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Daniel Frishberg, Michail Sarantis, Prasad Tetali, Vedat Levi Alev","submitted_at":"2026-05-03T21:44:00Z","abstract_excerpt":"We prove an $\\widetilde O(n^2)$ bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex $(n+2)$-gon, implying a mixing time of $\\widetilde O(n^2)$. The previous state of the art for the mixing time of this chain, due to Eppstein and Frishberg, was $\\widetilde O(n^3)$, while the best known lower bound on the mixing time, due to Molloy, Reed, and Steiger, is $\\Omega(n^{3/2})$. Our relaxation time bound makes significant progress towards Aldous' conjectured bound of $\\Theta(n^{3/2})$ for the relaxation time.\n  We "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove an Õ(n²) bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex (n+2)-gon, implying a mixing time of Õ(n²).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis assumes that the transport flows framework from Chen et al. can be applied efficiently to combinatorial decompositions of the triangulation space without introducing hidden dependencies or loose constants that would invalidate the Õ(n²) bound.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proves Õ(n²) bound on relaxation and log-Sobolev times for the triangulation flip chain on convex polygons, improving the prior Õ(n³) upper bound.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The triangulation flip chain on a convex (n+2)-gon mixes in Õ(n²) time.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"837d5fbd209aec9003875388026b0694e0d375df5810641af66d951d22767165"},"source":{"id":"2605.02067","kind":"arxiv","version":2},"verdict":{"id":"19bb7e42-3743-42b9-9129-f10ca1913413","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T19:05:14.502073Z","strongest_claim":"We prove an Õ(n²) bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex (n+2)-gon, implying a mixing time of Õ(n²).","one_line_summary":"Proves Õ(n²) bound on relaxation and log-Sobolev times for the triangulation flip chain on convex polygons, improving the prior Õ(n³) upper bound.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis assumes that the transport flows framework from Chen et al. can be applied efficiently to combinatorial decompositions of the triangulation space without introducing hidden dependencies or loose constants that would invalidate the Õ(n²) bound.","pith_extraction_headline":"The triangulation flip chain on a convex (n+2)-gon mixes in Õ(n²) time."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.02067/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T16:38:24.684655Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T04:01:22.882037Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:42:27.350175Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1e02b4822f568660f9abe81e4274aa18f7974a60787e0dc354ecba0d770a7f26"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"d1791214467d8d4affc94c96f2a7cc377f04a8c1d180d35ff4dc00bde07561bf"},"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":"2605.02067","created_at":"2026-05-26T02:04:11.805014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.02067v2","created_at":"2026-05-26T02:04:11.805014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02067","created_at":"2026-05-26T02:04:11.805014+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHERDWKRPAID","created_at":"2026-05-26T02:04:11.805014+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHERDWKRPAIDCG7Q","created_at":"2026-05-26T02:04:11.805014+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHERDWKR","created_at":"2026-05-26T02:04:11.805014+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.21921","citing_title":"On weighted partial triangulations of convex polygons","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16244","citing_title":"Burnside process on parking functions and Dyck paths","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":3,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4","json":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4.json","graph_json":"https://pith.science/api/pith-number/XHERDWKRPAIDCG7Q3S7XYA5ME4/graph.json","events_json":"https://pith.science/api/pith-number/XHERDWKRPAIDCG7Q3S7XYA5ME4/events.json","paper":"https://pith.science/paper/XHERDWKR"},"agent_actions":{"view_html":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4","download_json":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4.json","view_paper":"https://pith.science/paper/XHERDWKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.02067&json=true","fetch_graph":"https://pith.science/api/pith-number/XHERDWKRPAIDCG7Q3S7XYA5ME4/graph.json","fetch_events":"https://pith.science/api/pith-number/XHERDWKRPAIDCG7Q3S7XYA5ME4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4/action/storage_attestation","attest_author":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4/action/author_attestation","sign_citation":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4/action/citation_signature","submit_replication":"https://pith.science/pith/XHERDWKRPAIDCG7Q3S7XYA5ME4/action/replication_record"}},"created_at":"2026-05-26T02:04:11.805014+00:00","updated_at":"2026-05-26T02:04:11.805014+00:00"}