{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:Z7PJIQ6OHEFFAYEJ7UWTGF5JFN","short_pith_number":"pith:Z7PJIQ6O","schema_version":"1.0","canonical_sha256":"cfde9443ce390a506089fd2d3317a92b6555cebbcd1cb40d05755c34e73168e1","source":{"kind":"arxiv","id":"0903.0197","version":1},"attestation_state":"computed","paper":{"title":"Rotation Distance is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Katherine St. John, Sean Cleary","submitted_at":"2009-03-02T01:36:50Z","abstract_excerpt":"Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we show that the rotation distance between two ordered trees is fixed-parameter tractable, in the parameter, k, the rotation distance. The proof relies on the kernalization of the initial trees to trees with size bounded by 7k."},"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":"0903.0197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-02T01:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"3ea2e4df2805c87758294b329a054894bea5fd93fd7ae430b942be221bf77dc7","abstract_canon_sha256":"4f781b64c7692900f7c07cc085b5a8a32b58092cd2b4be1eb7f87ba06887d2b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:54.322689Z","signature_b64":"uB6eBbww5vMKOpGhYQjT6DLqB08QgbZiQhB/B0C0BBLOPgiQkrL6Vcpo3R/RZgW1BfZOaGGg+xchC9cvc3DJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfde9443ce390a506089fd2d3317a92b6555cebbcd1cb40d05755c34e73168e1","last_reissued_at":"2026-05-18T00:20:54.322306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:54.322306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rotation Distance is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Katherine St. John, Sean Cleary","submitted_at":"2009-03-02T01:36:50Z","abstract_excerpt":"Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we show that the rotation distance between two ordered trees is fixed-parameter tractable, in the parameter, k, the rotation distance. The proof relies on the kernalization of the initial trees to trees with size bounded by 7k."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.0197","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":""},"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":"0903.0197","created_at":"2026-05-18T00:20:54.322382+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.0197v1","created_at":"2026-05-18T00:20:54.322382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.0197","created_at":"2026-05-18T00:20:54.322382+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7PJIQ6OHEFF","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7PJIQ6OHEFFAYEJ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7PJIQ6O","created_at":"2026-05-18T12:26:02.257875+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/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN","json":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN.json","graph_json":"https://pith.science/api/pith-number/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/graph.json","events_json":"https://pith.science/api/pith-number/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/events.json","paper":"https://pith.science/paper/Z7PJIQ6O"},"agent_actions":{"view_html":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN","download_json":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN.json","view_paper":"https://pith.science/paper/Z7PJIQ6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.0197&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/action/storage_attestation","attest_author":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/action/author_attestation","sign_citation":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/action/citation_signature","submit_replication":"https://pith.science/pith/Z7PJIQ6OHEFFAYEJ7UWTGF5JFN/action/replication_record"}},"created_at":"2026-05-18T00:20:54.322382+00:00","updated_at":"2026-05-18T00:20:54.322382+00:00"}