{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:22F6EGZKBX22FOSUAXT5VSWCZ2","short_pith_number":"pith:22F6EGZK","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"},"canonical_sha256":"d68be21b2a0df5a2ba5405e7dacac2ce8243646acc074641e4eff7f2fcd13917","source":{"kind":"arxiv","id":"cs/0604037","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0604037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0604037v3","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"22F6EGZKBX22","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"22F6EGZKBX22FOSU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"22F6EGZK","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:22F6EGZKBX22FOSUAXT5VSWCZ2","target":"record","payload":{"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"},"canonical_sha256":"d68be21b2a0df5a2ba5405e7dacac2ce8243646acc074641e4eff7f2fcd13917","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"},"source_kind":"arxiv","source_id":"cs/0604037","source_version":3,"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-18T04:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lcam13rn0pJERE5fOMFMUR9ch8P/F/nROox+8Vv0v8FWYmW6LeBwR8r90RKmUWly8XWTAxfT6rh8m4MBakaeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:54:41.531599Z"},"content_sha256":"524f890a3540889396b571f435393a10c9c1346d71c12b0315329005c4bf3e1d","schema_version":"1.0","event_id":"sha256:524f890a3540889396b571f435393a10c9c1346d71c12b0315329005c4bf3e1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:22F6EGZKBX22FOSUAXT5VSWCZ2","target":"graph","payload":{"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"},"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-18T04:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJ3Su78elZwjUeskQ5lRbwDSGEQg/nForyUQznwblgXsIPKXlaRSo2LfR0WC4donpxTFG04bxffQm+aZGKnVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:54:41.532337Z"},"content_sha256":"b5b80a3fc16b99f2b3e426a03ac76a017553910c130e636b3c4164bbc508ac89","schema_version":"1.0","event_id":"sha256:b5b80a3fc16b99f2b3e426a03ac76a017553910c130e636b3c4164bbc508ac89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/bundle.json","state_url":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/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-05-25T20:54:41Z","links":{"resolver":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2","bundle":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/bundle.json","state":"https://pith.science/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22F6EGZKBX22FOSUAXT5VSWCZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:22F6EGZKBX22FOSUAXT5VSWCZ2","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":"19ce64084acd03ad703cc24848cc8cab1f930f7a10d36f6c9e38ba50c8f2c916","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-04-10T00:39:11Z","title_canon_sha256":"94425e853d4664c1905f7b894e3e2aed1fc876a2305cc43498bcc98d4c87ac2e"},"schema_version":"1.0","source":{"id":"cs/0604037","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0604037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0604037v3","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"22F6EGZKBX22","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"22F6EGZKBX22FOSU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"22F6EGZK","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:b5b80a3fc16b99f2b3e426a03ac76a017553910c130e636b3c4164bbc508ac89","target":"graph","created_at":"2026-05-18T04:34:19Z","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":"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","authors_text":"Benjamin Rossman, Erik D. Demaine, Oren Weimann, Shay Mozes","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-04-10T00:39:11Z","title":"An O(n^3)-Time Algorithm for Tree Edit Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604037","kind":"arxiv","version":3},"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:524f890a3540889396b571f435393a10c9c1346d71c12b0315329005c4bf3e1d","target":"record","created_at":"2026-05-18T04:34:19Z","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":"19ce64084acd03ad703cc24848cc8cab1f930f7a10d36f6c9e38ba50c8f2c916","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-04-10T00:39:11Z","title_canon_sha256":"94425e853d4664c1905f7b894e3e2aed1fc876a2305cc43498bcc98d4c87ac2e"},"schema_version":"1.0","source":{"id":"cs/0604037","kind":"arxiv","version":3}},"canonical_sha256":"d68be21b2a0df5a2ba5405e7dacac2ce8243646acc074641e4eff7f2fcd13917","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d68be21b2a0df5a2ba5405e7dacac2ce8243646acc074641e4eff7f2fcd13917","first_computed_at":"2026-05-18T04:34:19.898737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:19.898737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWsZsqZtbp/jNyylUcACrBXzd1CDpPIdaORG39Yv7ChY+36EfmnfKIxdaJvsNkO5O81RuV2dDe5nC6k+U4vvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:19.899134Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0604037","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:524f890a3540889396b571f435393a10c9c1346d71c12b0315329005c4bf3e1d","sha256:b5b80a3fc16b99f2b3e426a03ac76a017553910c130e636b3c4164bbc508ac89"],"state_sha256":"d46292393b4fc6e0ef296dedf1ab3420ecbae9ad4d0a616ff2bf2d9bcd3e9766"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPAsfqvL1u3eAiphKNVZLrsU3c/4NYcM51OixQeV4Fi4EqwWejj0XABR8KL0kEUMoUmzov9uzVXdqbCaNgsgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:54:41.535865Z","bundle_sha256":"fb304dd2283bcc1b35ae21530939a3fa228e3fc0e766e518010d016a17fae60d"}}