{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RC7SA7QH7XXDT22VFRQAPIZQ37","short_pith_number":"pith:RC7SA7QH","schema_version":"1.0","canonical_sha256":"88bf207e07fdee39eb552c6007a330dfc148827fdd0698e4763b57e90165bad4","source":{"kind":"arxiv","id":"2211.07984","version":2},"attestation_state":"computed","paper":{"title":"The rotation distance of brooms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon","submitted_at":"2022-11-15T08:38:37Z","abstract_excerpt":"The associahedron $\\mathcal{A}(G)$ of a graph $G$ has the property that its vertices can be thought of as the search trees on $G$ and its edges as the rotations between two search trees. If $G$ is a simple path, then $\\mathcal{A}(G)$ is the usual associahedron and the search trees on $G$ are binary search trees. Computing distances in the graph of $\\mathcal{A}(G)$, or equivalently, the rotation distance between two binary search trees, is a major open problem. Here, we consider the different case when $G$ is a complete split graph. In that case, $\\mathcal{A}(G)$ interpolates between the stello"},"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":"2211.07984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T08:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"3734d455d060faaf3bc0fbe67f79ef05dae5e8f1c457a6fae6ab9ef53aa76e5b","abstract_canon_sha256":"fb25821d80270889732d604b81c4744cd0944d828933755d6ea8695f44c19c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:34.862357Z","signature_b64":"RKyUbj1OGHixowdDXZcWOyOay3h8CkGvnILTisWP1sUn8GkWAKUfuOZJRfgvn3JbYA0/IpHqfN1iRJsv739ACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88bf207e07fdee39eb552c6007a330dfc148827fdd0698e4763b57e90165bad4","last_reissued_at":"2026-07-05T07:16:34.861832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:34.861832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The rotation distance of brooms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon","submitted_at":"2022-11-15T08:38:37Z","abstract_excerpt":"The associahedron $\\mathcal{A}(G)$ of a graph $G$ has the property that its vertices can be thought of as the search trees on $G$ and its edges as the rotations between two search trees. If $G$ is a simple path, then $\\mathcal{A}(G)$ is the usual associahedron and the search trees on $G$ are binary search trees. Computing distances in the graph of $\\mathcal{A}(G)$, or equivalently, the rotation distance between two binary search trees, is a major open problem. Here, we consider the different case when $G$ is a complete split graph. In that case, $\\mathcal{A}(G)$ interpolates between the stello"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07984","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.07984/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":"2211.07984","created_at":"2026-07-05T07:16:34.861891+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.07984v2","created_at":"2026-07-05T07:16:34.861891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07984","created_at":"2026-07-05T07:16:34.861891+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC7SA7QH7XXD","created_at":"2026-07-05T07:16:34.861891+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC7SA7QH7XXDT22V","created_at":"2026-07-05T07:16:34.861891+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC7SA7QH","created_at":"2026-07-05T07:16:34.861891+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/RC7SA7QH7XXDT22VFRQAPIZQ37","json":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37.json","graph_json":"https://pith.science/api/pith-number/RC7SA7QH7XXDT22VFRQAPIZQ37/graph.json","events_json":"https://pith.science/api/pith-number/RC7SA7QH7XXDT22VFRQAPIZQ37/events.json","paper":"https://pith.science/paper/RC7SA7QH"},"agent_actions":{"view_html":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37","download_json":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37.json","view_paper":"https://pith.science/paper/RC7SA7QH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.07984&json=true","fetch_graph":"https://pith.science/api/pith-number/RC7SA7QH7XXDT22VFRQAPIZQ37/graph.json","fetch_events":"https://pith.science/api/pith-number/RC7SA7QH7XXDT22VFRQAPIZQ37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/action/storage_attestation","attest_author":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/action/author_attestation","sign_citation":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/action/citation_signature","submit_replication":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/action/replication_record"}},"created_at":"2026-07-05T07:16:34.861891+00:00","updated_at":"2026-07-05T07:16:34.861891+00:00"}