{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CRZTWAEMF2AWMCQSO7AQGKUD7T","short_pith_number":"pith:CRZTWAEM","schema_version":"1.0","canonical_sha256":"14733b008c2e81660a1277c1032a83fcd3723d020275e9d174418328d123da86","source":{"kind":"arxiv","id":"1703.08940","version":1},"attestation_state":"computed","paper":{"title":"Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karl Bringmann, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2017-03-27T05:48:36Z","abstract_excerpt":"The edit distance between two rooted ordered trees with $n$ nodes labeled from an alphabet~$\\Sigma$ 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. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit distance runs in cubic $O(n^3)$ time and is based on a similar dynamic programming solution as string edit distance. In this paper we show that a truly subcubic $O(n^{3-\\varepsilon})$ time algorithm"},"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":"1703.08940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"40175f2b854385e0bd10015f789b610fabb6d54f7d90bed800fed641cf9c0ec4","abstract_canon_sha256":"658f734dfce32fe12f0dbf35568ad211f6abb6457af55bede43f8cab216d9e73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.111808Z","signature_b64":"tC1ZEAo9d/XJ0Uh5lasP7eqpXruNhvEAMB4f44za82ve/IQhaSrfUhd9VpfO/G6o2FVqB11KkDpu9tFo8a10AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14733b008c2e81660a1277c1032a83fcd3723d020275e9d174418328d123da86","last_reissued_at":"2026-05-18T00:47:55.111394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.111394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karl Bringmann, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2017-03-27T05:48:36Z","abstract_excerpt":"The edit distance between two rooted ordered trees with $n$ nodes labeled from an alphabet~$\\Sigma$ 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. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit distance runs in cubic $O(n^3)$ time and is based on a similar dynamic programming solution as string edit distance. In this paper we show that a truly subcubic $O(n^{3-\\varepsilon})$ time algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08940","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":"1703.08940","created_at":"2026-05-18T00:47:55.111457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08940v1","created_at":"2026-05-18T00:47:55.111457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08940","created_at":"2026-05-18T00:47:55.111457+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRZTWAEMF2AW","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRZTWAEMF2AWMCQS","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRZTWAEM","created_at":"2026-05-18T12:31:10.602751+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/CRZTWAEMF2AWMCQSO7AQGKUD7T","json":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T.json","graph_json":"https://pith.science/api/pith-number/CRZTWAEMF2AWMCQSO7AQGKUD7T/graph.json","events_json":"https://pith.science/api/pith-number/CRZTWAEMF2AWMCQSO7AQGKUD7T/events.json","paper":"https://pith.science/paper/CRZTWAEM"},"agent_actions":{"view_html":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T","download_json":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T.json","view_paper":"https://pith.science/paper/CRZTWAEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08940&json=true","fetch_graph":"https://pith.science/api/pith-number/CRZTWAEMF2AWMCQSO7AQGKUD7T/graph.json","fetch_events":"https://pith.science/api/pith-number/CRZTWAEMF2AWMCQSO7AQGKUD7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/action/storage_attestation","attest_author":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/action/author_attestation","sign_citation":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/action/citation_signature","submit_replication":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/action/replication_record"}},"created_at":"2026-05-18T00:47:55.111457+00:00","updated_at":"2026-05-18T00:47:55.111457+00:00"}