{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CIBRCP74XX23K53Y2CVHWLH6K7","short_pith_number":"pith:CIBRCP74","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"},"canonical_sha256":"1203113ffcbdf5b57778d0aa7b2cfe57d896174157385b9ff82977a60bc9ed8d","source":{"kind":"arxiv","id":"1804.10186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10186","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10186v1","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10186","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"CIBRCP74XX23","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CIBRCP74XX23K53Y","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CIBRCP74","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CIBRCP74XX23K53Y2CVHWLH6K7","target":"record","payload":{"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"},"canonical_sha256":"1203113ffcbdf5b57778d0aa7b2cfe57d896174157385b9ff82977a60bc9ed8d","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"},"source_kind":"arxiv","source_id":"1804.10186","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMMZ8OQv3TiOSkBQ6TRb3sEony0dIvzym1L3HPJ2Kjzwwjj66RGz7TFdCNpFa7auA7wcKeN4urqRFme6/c5SDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:24:28.732591Z"},"content_sha256":"b8c0a5fccbf349c8547e9ce91b0de948b7d8740c49ea1282d8ec4d32e3e623ab","schema_version":"1.0","event_id":"sha256:b8c0a5fccbf349c8547e9ce91b0de948b7d8740c49ea1282d8ec4d32e3e623ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CIBRCP74XX23K53Y2CVHWLH6K7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnwE6vc4EQ8mibI+opAur64yENSs7Ntil01lP7jQxXCvQHN3ayRELRrTdq4WPUK/UgnFoydX5DNmDgIV3d/9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:24:28.732934Z"},"content_sha256":"f8ffaa47c028f03688ee585c8febd9e1b3fa3e61bde852ee6f79cb7dc2f60fa6","schema_version":"1.0","event_id":"sha256:f8ffaa47c028f03688ee585c8febd9e1b3fa3e61bde852ee6f79cb7dc2f60fa6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/bundle.json","state_url":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIBRCP74XX23K53Y2CVHWLH6K7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T21:24:28Z","links":{"resolver":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7","bundle":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/bundle.json","state":"https://pith.science/pith/CIBRCP74XX23K53Y2CVHWLH6K7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIBRCP74XX23K53Y2CVHWLH6K7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CIBRCP74XX23K53Y2CVHWLH6K7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"51ec59a62b653964d52ca63807c39da8d844097690ae461f51802919546102c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-26T17:36:57Z","title_canon_sha256":"4db32867579de01055b9d3f98a65dc26668b8906400ff6c0eab05f6b0638ba0e"},"schema_version":"1.0","source":{"id":"1804.10186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10186","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10186v1","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10186","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"CIBRCP74XX23","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CIBRCP74XX23K53Y","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CIBRCP74","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:f8ffaa47c028f03688ee585c8febd9e1b3fa3e61bde852ee6f79cb7dc2f60fa6","target":"graph","created_at":"2026-05-18T00:17:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-26T17:36:57Z","title":"Edit Distance between Unrooted Trees in Cubic Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10186","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b8c0a5fccbf349c8547e9ce91b0de948b7d8740c49ea1282d8ec4d32e3e623ab","target":"record","created_at":"2026-05-18T00:17:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"51ec59a62b653964d52ca63807c39da8d844097690ae461f51802919546102c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-26T17:36:57Z","title_canon_sha256":"4db32867579de01055b9d3f98a65dc26668b8906400ff6c0eab05f6b0638ba0e"},"schema_version":"1.0","source":{"id":"1804.10186","kind":"arxiv","version":1}},"canonical_sha256":"1203113ffcbdf5b57778d0aa7b2cfe57d896174157385b9ff82977a60bc9ed8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1203113ffcbdf5b57778d0aa7b2cfe57d896174157385b9ff82977a60bc9ed8d","first_computed_at":"2026-05-18T00:17:24.874008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:24.874008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HxwYCe1GHiIY3csWjfm0Omzwp7R8EibuJgNh4bRhwy/J51VHYjvZCqdvZToMznWUuVKroFBQX6tE/YkGWCWLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:24.874654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8c0a5fccbf349c8547e9ce91b0de948b7d8740c49ea1282d8ec4d32e3e623ab","sha256:f8ffaa47c028f03688ee585c8febd9e1b3fa3e61bde852ee6f79cb7dc2f60fa6"],"state_sha256":"7cb1207977a199c7022a1293d2d3c522eec2accd95be6927e65f614fc87d4858"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+cyhdCmSZVMU/YDqsTXyTZx1hzCQv5KMp0HALVQwQ1sby6TNOMvMV/28n+phGrvFlr8uXCn+1T28XhWyNTNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:24:28.734986Z","bundle_sha256":"0743fe2cc0196374899c1600fa96c8ff93f050aea8b1a74f6f2d1e93f4e181e6"}}