{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5KYGONYON56NZLWJXEMMEAQ4UH","short_pith_number":"pith:5KYGONYO","schema_version":"1.0","canonical_sha256":"eab067370e6f7cdcaec9b918c2021ca1f2d532054d2500124184ba7a613daf85","source":{"kind":"arxiv","id":"2409.17905","version":1},"attestation_state":"computed","paper":{"title":"Rotation distance using flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Claire Mathieu, William Thurston","submitted_at":"2024-09-26T14:51:41Z","abstract_excerpt":"Splay trees are a simple and efficient dynamic data structure, invented by Sleator and Tarjan. The basic primitive for transforming a binary tree in this scheme is a rotation. Sleator, Tarjan, and Thurston proved that the maximum rotation distance between trees with n internal nodes is exactly 2n-6 for trees with n internal nodes (where n is larger than some constant). The proof of the upper bound is easy but the proof of the lower bound, remarkably, uses sophisticated arguments based on calculating hyperbolic volumes. We give an elementary proof of the same result. The main interest of the pa"},"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":"2409.17905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-09-26T14:51:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ab5920bc8a78d3446ac1fac1c422a9974c7ff7ae8bbc21d1bf86e07616079ba1","abstract_canon_sha256":"a04fc68557016b435562c6c141c48cd7cebf579be9370be52a5b7b6fd2251ae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:17.383948Z","signature_b64":"GQSxpQYQl2QtNm07p3z3U7hREzlSB8vBozoWw/eugtAYnF/0nLu/VuSL14ggEWT8Bdu9p8fclxpxP+g0vLk0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab067370e6f7cdcaec9b918c2021ca1f2d532054d2500124184ba7a613daf85","last_reissued_at":"2026-07-05T09:12:17.383407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:17.383407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rotation distance using flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Claire Mathieu, William Thurston","submitted_at":"2024-09-26T14:51:41Z","abstract_excerpt":"Splay trees are a simple and efficient dynamic data structure, invented by Sleator and Tarjan. The basic primitive for transforming a binary tree in this scheme is a rotation. Sleator, Tarjan, and Thurston proved that the maximum rotation distance between trees with n internal nodes is exactly 2n-6 for trees with n internal nodes (where n is larger than some constant). The proof of the upper bound is easy but the proof of the lower bound, remarkably, uses sophisticated arguments based on calculating hyperbolic volumes. We give an elementary proof of the same result. The main interest of the pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.17905","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.17905/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.17905","created_at":"2026-07-05T09:12:17.383464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.17905v1","created_at":"2026-07-05T09:12:17.383464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.17905","created_at":"2026-07-05T09:12:17.383464+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KYGONYON56N","created_at":"2026-07-05T09:12:17.383464+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KYGONYON56NZLWJ","created_at":"2026-07-05T09:12:17.383464+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KYGONYO","created_at":"2026-07-05T09:12:17.383464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09736","citing_title":"Taut fillings","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH","json":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH.json","graph_json":"https://pith.science/api/pith-number/5KYGONYON56NZLWJXEMMEAQ4UH/graph.json","events_json":"https://pith.science/api/pith-number/5KYGONYON56NZLWJXEMMEAQ4UH/events.json","paper":"https://pith.science/paper/5KYGONYO"},"agent_actions":{"view_html":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH","download_json":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH.json","view_paper":"https://pith.science/paper/5KYGONYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.17905&json=true","fetch_graph":"https://pith.science/api/pith-number/5KYGONYON56NZLWJXEMMEAQ4UH/graph.json","fetch_events":"https://pith.science/api/pith-number/5KYGONYON56NZLWJXEMMEAQ4UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH/action/storage_attestation","attest_author":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH/action/author_attestation","sign_citation":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH/action/citation_signature","submit_replication":"https://pith.science/pith/5KYGONYON56NZLWJXEMMEAQ4UH/action/replication_record"}},"created_at":"2026-07-05T09:12:17.383464+00:00","updated_at":"2026-07-05T09:12:17.383464+00:00"}