{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:22F6EGZKBX22FOSUAXT5VSWCZ2","short_pith_number":"pith:22F6EGZK","schema_version":"1.0","canonical_sha256":"d68be21b2a0df5a2ba5405e7dacac2ce8243646acc074641e4eff7f2fcd13917","source":{"kind":"arxiv","id":"cs/0604037","version":3},"attestation_state":"computed","paper":{"title":"An O(n^3)-Time Algorithm for Tree Edit Distance","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Rossman, Erik D. Demaine, Oren Weimann, Shay Mozes","submitted_at":"2006-04-10T00:39:11Z","abstract_excerpt":"The {\\em edit distance} between two ordered trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worst-case $O(n^3)$-time algorithm for this problem, improving the previous best $O(n^3\\log n)$-time algorithm~\\cite{Klein}. Our result requires a novel adaptive strategy for deciding how a dynamic program divides into subproblems (which is interesting in its own right), together with a deeper understanding of the pr"},"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":"cs/0604037","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-04-10T00:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"94425e853d4664c1905f7b894e3e2aed1fc876a2305cc43498bcc98d4c87ac2e","abstract_canon_sha256":"19ce64084acd03ad703cc24848cc8cab1f930f7a10d36f6c9e38ba50c8f2c916"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:19.899134Z","signature_b64":"kWsZsqZtbp/jNyylUcACrBXzd1CDpPIdaORG39Yv7ChY+36EfmnfKIxdaJvsNkO5O81RuV2dDe5nC6k+U4vvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d68be21b2a0df5a2ba5405e7dacac2ce8243646acc074641e4eff7f2fcd13917","last_reissued_at":"2026-05-18T04:34:19.898737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:19.898737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An O(n^3)-Time Algorithm for Tree Edit Distance","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Rossman, Erik D. Demaine, Oren Weimann, Shay Mozes","submitted_at":"2006-04-10T00:39:11Z","abstract_excerpt":"The {\\em edit distance} between two ordered trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worst-case $O(n^3)$-time algorithm for this problem, improving the previous best $O(n^3\\log n)$-time algorithm~\\cite{Klein}. Our result requires a novel adaptive strategy for deciding how a dynamic program divides into subproblems (which is interesting in its own right), together with a deeper understanding of the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604037","kind":"arxiv","version":3},"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":"cs/0604037","created_at":"2026-05-18T04:34:19.898795+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0604037v3","created_at":"2026-05-18T04:34:19.898795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604037","created_at":"2026-05-18T04:34:19.898795+00:00"},{"alias_kind":"pith_short_12","alias_value":"22F6EGZKBX22","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"22F6EGZKBX22FOSU","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"22F6EGZK","created_at":"2026-05-18T12:25:53.939244+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/22F6EGZKBX22FOSUAXT5VSWCZ2","json":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2.json","graph_json":"https://pith.science/api/pith-number/22F6EGZKBX22FOSUAXT5VSWCZ2/graph.json","events_json":"https://pith.science/api/pith-number/22F6EGZKBX22FOSUAXT5VSWCZ2/events.json","paper":"https://pith.science/paper/22F6EGZK"},"agent_actions":{"view_html":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2","download_json":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2.json","view_paper":"https://pith.science/paper/22F6EGZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0604037&json=true","fetch_graph":"https://pith.science/api/pith-number/22F6EGZKBX22FOSUAXT5VSWCZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/22F6EGZKBX22FOSUAXT5VSWCZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/action/storage_attestation","attest_author":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/action/author_attestation","sign_citation":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/action/citation_signature","submit_replication":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/action/replication_record"}},"created_at":"2026-05-18T04:34:19.898795+00:00","updated_at":"2026-05-18T04:34:19.898795+00:00"}