{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MYSLB67QAKZZTFSX6DGIBWJE6X","short_pith_number":"pith:MYSLB67Q","schema_version":"1.0","canonical_sha256":"6624b0fbf002b3999657f0cc80d924f5eb7db029fdb46be7f14978dc244b7ba0","source":{"kind":"arxiv","id":"0903.0199","version":2},"attestation_state":"computed","paper":{"title":"A Linear-Time Approximation Algorithm for Rotation Distance","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:40:14Z","abstract_excerpt":"Rotation distance between rooted binary 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. We give an efficient, linear-time approximation algorithm, which estimates the rotation distance, within a provable factor of 2, between ordered rooted binary trees. ."},"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.0199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-02T01:40:14Z","cross_cats_sorted":[],"title_canon_sha256":"998be9a5833b26b5bf3f860588e0d24ebce19d02a8866e64fd3756493409de18","abstract_canon_sha256":"9043f422d365b0effaada6f653fc042c4f8a19f20943b3788926b7c78acc1a81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:54.317394Z","signature_b64":"+MCT0drVfDZloRwKSqRw6kvA8r96ESM3JDM1nbMVyWYAV3uKkicBbvwPpu8tVAlm3ZciQu2cmXJxdGCqWzXiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6624b0fbf002b3999657f0cc80d924f5eb7db029fdb46be7f14978dc244b7ba0","last_reissued_at":"2026-05-18T00:20:54.316992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:54.316992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear-Time Approximation Algorithm for Rotation Distance","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:40:14Z","abstract_excerpt":"Rotation distance between rooted binary 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. We give an efficient, linear-time approximation algorithm, which estimates the rotation distance, within a provable factor of 2, between ordered rooted binary trees. ."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.0199","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":""},"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.0199","created_at":"2026-05-18T00:20:54.317055+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.0199v2","created_at":"2026-05-18T00:20:54.317055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.0199","created_at":"2026-05-18T00:20:54.317055+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYSLB67QAKZZ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYSLB67QAKZZTFSX","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYSLB67Q","created_at":"2026-05-18T12:26:00.592388+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/MYSLB67QAKZZTFSX6DGIBWJE6X","json":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X.json","graph_json":"https://pith.science/api/pith-number/MYSLB67QAKZZTFSX6DGIBWJE6X/graph.json","events_json":"https://pith.science/api/pith-number/MYSLB67QAKZZTFSX6DGIBWJE6X/events.json","paper":"https://pith.science/paper/MYSLB67Q"},"agent_actions":{"view_html":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X","download_json":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X.json","view_paper":"https://pith.science/paper/MYSLB67Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.0199&json=true","fetch_graph":"https://pith.science/api/pith-number/MYSLB67QAKZZTFSX6DGIBWJE6X/graph.json","fetch_events":"https://pith.science/api/pith-number/MYSLB67QAKZZTFSX6DGIBWJE6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X/action/storage_attestation","attest_author":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X/action/author_attestation","sign_citation":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X/action/citation_signature","submit_replication":"https://pith.science/pith/MYSLB67QAKZZTFSX6DGIBWJE6X/action/replication_record"}},"created_at":"2026-05-18T00:20:54.317055+00:00","updated_at":"2026-05-18T00:20:54.317055+00:00"}