{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RC7SA7QH7XXDT22VFRQAPIZQ37","short_pith_number":"pith:RC7SA7QH","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"},"canonical_sha256":"88bf207e07fdee39eb552c6007a330dfc148827fdd0698e4763b57e90165bad4","source":{"kind":"arxiv","id":"2211.07984","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.07984","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.07984v2","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07984","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"RC7SA7QH7XXD","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"pith_short_16","alias_value":"RC7SA7QH7XXDT22V","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"pith_short_8","alias_value":"RC7SA7QH","created_at":"2026-07-05T07:16:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RC7SA7QH7XXDT22VFRQAPIZQ37","target":"record","payload":{"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"},"canonical_sha256":"88bf207e07fdee39eb552c6007a330dfc148827fdd0698e4763b57e90165bad4","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"},"source_kind":"arxiv","source_id":"2211.07984","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZjeuORJYQR4LL+ZjwO2G+VICjjZtF3k3fHvdq4CqFZxqpvFpohJI5BoFphPlC92LO8Oh2srVvk+atl2vrVFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:44:40.451655Z"},"content_sha256":"0bf195e0527ff14a49af76ff37f6d601f84037d4936cf66d93bbb9c128fa1bb8","schema_version":"1.0","event_id":"sha256:0bf195e0527ff14a49af76ff37f6d601f84037d4936cf66d93bbb9c128fa1bb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RC7SA7QH7XXDT22VFRQAPIZQ37","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJnyAth9zB4o5NKWssvZK2s4n5sdTTzoq/DrfP0jV7rb/XL0QOgC0gI8IB0onBkjEyJInyn3kEGepw9ob5fiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:44:40.452031Z"},"content_sha256":"a0645f360bf914e126ac8557b46ee7217e62975423068bab4a995cb8912d2296","schema_version":"1.0","event_id":"sha256:a0645f360bf914e126ac8557b46ee7217e62975423068bab4a995cb8912d2296"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/bundle.json","state_url":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T02:44:40Z","links":{"resolver":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37","bundle":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/bundle.json","state":"https://pith.science/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC7SA7QH7XXDT22VFRQAPIZQ37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RC7SA7QH7XXDT22VFRQAPIZQ37","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fb25821d80270889732d604b81c4744cd0944d828933755d6ea8695f44c19c0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T08:38:37Z","title_canon_sha256":"3734d455d060faaf3bc0fbe67f79ef05dae5e8f1c457a6fae6ab9ef53aa76e5b"},"schema_version":"1.0","source":{"id":"2211.07984","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.07984","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.07984v2","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07984","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"RC7SA7QH7XXD","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"pith_short_16","alias_value":"RC7SA7QH7XXDT22V","created_at":"2026-07-05T07:16:34Z"},{"alias_kind":"pith_short_8","alias_value":"RC7SA7QH","created_at":"2026-07-05T07:16:34Z"}],"graph_snapshots":[{"event_id":"sha256:a0645f360bf914e126ac8557b46ee7217e62975423068bab4a995cb8912d2296","target":"graph","created_at":"2026-07-05T07:16:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.07984/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T08:38:37Z","title":"The rotation distance of brooms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07984","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0bf195e0527ff14a49af76ff37f6d601f84037d4936cf66d93bbb9c128fa1bb8","target":"record","created_at":"2026-07-05T07:16:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fb25821d80270889732d604b81c4744cd0944d828933755d6ea8695f44c19c0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T08:38:37Z","title_canon_sha256":"3734d455d060faaf3bc0fbe67f79ef05dae5e8f1c457a6fae6ab9ef53aa76e5b"},"schema_version":"1.0","source":{"id":"2211.07984","kind":"arxiv","version":2}},"canonical_sha256":"88bf207e07fdee39eb552c6007a330dfc148827fdd0698e4763b57e90165bad4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88bf207e07fdee39eb552c6007a330dfc148827fdd0698e4763b57e90165bad4","first_computed_at":"2026-07-05T07:16:34.861832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:34.861832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKyUbj1OGHixowdDXZcWOyOay3h8CkGvnILTisWP1sUn8GkWAKUfuOZJRfgvn3JbYA0/IpHqfN1iRJsv739ACA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:34.862357Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.07984","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bf195e0527ff14a49af76ff37f6d601f84037d4936cf66d93bbb9c128fa1bb8","sha256:a0645f360bf914e126ac8557b46ee7217e62975423068bab4a995cb8912d2296"],"state_sha256":"c866d08dc1648be829032adf98e04ce95234a9d48d9bf3c4d8e61494443ffcda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNbX7dkzx3wSupmi2mcZccUYX+RK0TQdttmUTqyPdNBcZhjEEBm0R3/eeoTRwMU5Gpo4tNy2eDZKy6lNgOTVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:44:40.454693Z","bundle_sha256":"38d46a20443ad61abfcfb8747690bb2caef3c19165873b45003bccf5ea5dfd91"}}