{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CIBRCP74XX23K53Y2CVHWLH6K7","short_pith_number":"pith:CIBRCP74","schema_version":"1.0","canonical_sha256":"1203113ffcbdf5b57778d0aa7b2cfe57d896174157385b9ff82977a60bc9ed8d","source":{"kind":"arxiv","id":"1804.10186","version":1},"attestation_state":"computed","paper":{"title":"Edit Distance between Unrooted Trees in Cubic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","submitted_at":"2018-04-26T17:36:57Z","abstract_excerpt":"Edit distance between trees is a natural generalization of the classical edit distance between strings, in which the allowed elementary operations are contraction, uncontraction and relabeling of an edge. Demaine et al. [ACM Trans. on Algorithms, 6(1), 2009] showed how to compute the edit distance between rooted trees on $n$ nodes in $\\mathcal{O}(n^{3})$ time. However, generalizing their method to unrooted trees seems quite problematic, and the most efficient known solution remains to be the previous $\\mathcal{O}(n^{3}\\log n)$ time algorithm by Klein [ESA 1998]. Given the lack of progress on i"},"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":"1804.10186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-26T17:36:57Z","cross_cats_sorted":[],"title_canon_sha256":"4db32867579de01055b9d3f98a65dc26668b8906400ff6c0eab05f6b0638ba0e","abstract_canon_sha256":"51ec59a62b653964d52ca63807c39da8d844097690ae461f51802919546102c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:24.874654Z","signature_b64":"HxwYCe1GHiIY3csWjfm0Omzwp7R8EibuJgNh4bRhwy/J51VHYjvZCqdvZToMznWUuVKroFBQX6tE/YkGWCWLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1203113ffcbdf5b57778d0aa7b2cfe57d896174157385b9ff82977a60bc9ed8d","last_reissued_at":"2026-05-18T00:17:24.874008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:24.874008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edit Distance between Unrooted Trees in Cubic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","submitted_at":"2018-04-26T17:36:57Z","abstract_excerpt":"Edit distance between trees is a natural generalization of the classical edit distance between strings, in which the allowed elementary operations are contraction, uncontraction and relabeling of an edge. Demaine et al. [ACM Trans. on Algorithms, 6(1), 2009] showed how to compute the edit distance between rooted trees on $n$ nodes in $\\mathcal{O}(n^{3})$ time. However, generalizing their method to unrooted trees seems quite problematic, and the most efficient known solution remains to be the previous $\\mathcal{O}(n^{3}\\log n)$ time algorithm by Klein [ESA 1998]. Given the lack of progress on i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10186","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":"1804.10186","created_at":"2026-05-18T00:17:24.874115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10186v1","created_at":"2026-05-18T00:17:24.874115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10186","created_at":"2026-05-18T00:17:24.874115+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIBRCP74XX23","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIBRCP74XX23K53Y","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIBRCP74","created_at":"2026-05-18T12:32:16.446611+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/CIBRCP74XX23K53Y2CVHWLH6K7","json":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7.json","graph_json":"https://pith.science/api/pith-number/CIBRCP74XX23K53Y2CVHWLH6K7/graph.json","events_json":"https://pith.science/api/pith-number/CIBRCP74XX23K53Y2CVHWLH6K7/events.json","paper":"https://pith.science/paper/CIBRCP74"},"agent_actions":{"view_html":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7","download_json":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7.json","view_paper":"https://pith.science/paper/CIBRCP74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10186&json=true","fetch_graph":"https://pith.science/api/pith-number/CIBRCP74XX23K53Y2CVHWLH6K7/graph.json","fetch_events":"https://pith.science/api/pith-number/CIBRCP74XX23K53Y2CVHWLH6K7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/action/storage_attestation","attest_author":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/action/author_attestation","sign_citation":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/action/citation_signature","submit_replication":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/action/replication_record"}},"created_at":"2026-05-18T00:17:24.874115+00:00","updated_at":"2026-05-18T00:17:24.874115+00:00"}