{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U2KQ7C5GPN4E4WZRXKNORBMI3Y","short_pith_number":"pith:U2KQ7C5G","canonical_record":{"source":{"id":"1201.0230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:35:26Z","cross_cats_sorted":[],"title_canon_sha256":"044749bbd54cda1b6e14c2628163123dc05d49be4778e50f33434585f4562392","abstract_canon_sha256":"fe287274937478c22ef4895214adae3c9524aea8d1d5d07ecc36dd120156c7a4"},"schema_version":"1.0"},"canonical_sha256":"a6950f8ba67b784e5b31ba9ae88588de37e6b0e85a06b7d78acc40d6bf4b2c5e","source":{"kind":"arxiv","id":"1201.0230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0230","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0230v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0230","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"U2KQ7C5GPN4E","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U2KQ7C5GPN4E4WZR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U2KQ7C5G","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U2KQ7C5GPN4E4WZRXKNORBMI3Y","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:35:26Z","cross_cats_sorted":[],"title_canon_sha256":"044749bbd54cda1b6e14c2628163123dc05d49be4778e50f33434585f4562392","abstract_canon_sha256":"fe287274937478c22ef4895214adae3c9524aea8d1d5d07ecc36dd120156c7a4"},"schema_version":"1.0"},"canonical_sha256":"a6950f8ba67b784e5b31ba9ae88588de37e6b0e85a06b7d78acc40d6bf4b2c5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:25.760754Z","signature_b64":"Vos+hQ1iSaw2D9JX7YZNot3skrFmQ+zJ6SX+xR4ggMgxm1oA3kt7B4RJh/XglJPWfk90nylj/wbxyG6lLjZxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6950f8ba67b784e5b31ba9ae88588de37e6b0e85a06b7d78acc40d6bf4b2c5e","last_reissued_at":"2026-05-18T04:05:25.759977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:25.759977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0230","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doinIypK1f5PfiVkTHrOzvocpXqoc5T3QwU171LUUfrpSSTU5B07WOR2v33ktK3HUilQ5OtGWy+9MF1rBDvdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:20:35.236187Z"},"content_sha256":"86dd1c41035dfcdce1672d5b3ef6f88a58d66654fedde1ff1a6c74d52065921b","schema_version":"1.0","event_id":"sha256:86dd1c41035dfcdce1672d5b3ef6f88a58d66654fedde1ff1a6c74d52065921b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U2KQ7C5GPN4E4WZRXKNORBMI3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RTED: A Robust Algorithm for the Tree Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Mateusz Pawlik, Nikolaus Augsten","submitted_at":"2011-12-31T05:35:26Z","abstract_excerpt":"We consider the classical tree edit distance between ordered labeled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into another. The state-of-the-art solutions for the tree edit distance are not satisfactory. The main competitors in the field either have optimal worst-case complexity, but the worst case happens frequently, or they are very efficient for some tree shapes, but degenerate for others. This leads to unpredictable and often infeasible runtimes. There is no obvious way to choose between the algorithms. In this paper we present RT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0230","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7alUrCJtG/KkLvRS9vxfqTLUFWB6FVZ6ULkOazS5T2srpvEaytiCOLJfWI/J/CsBX6g8E9Qqmmrn7TBk3NRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:20:35.236907Z"},"content_sha256":"e7de200348e04aff68d1b561cec5be012b2f3d79659c791a32629ae62326d07c","schema_version":"1.0","event_id":"sha256:e7de200348e04aff68d1b561cec5be012b2f3d79659c791a32629ae62326d07c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y/bundle.json","state_url":"https://pith.science/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y/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-08-14T08:20:35Z","links":{"resolver":"https://pith.science/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y","bundle":"https://pith.science/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y/bundle.json","state":"https://pith.science/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U2KQ7C5GPN4E4WZRXKNORBMI3Y","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":"fe287274937478c22ef4895214adae3c9524aea8d1d5d07ecc36dd120156c7a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:35:26Z","title_canon_sha256":"044749bbd54cda1b6e14c2628163123dc05d49be4778e50f33434585f4562392"},"schema_version":"1.0","source":{"id":"1201.0230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0230","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0230v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0230","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"U2KQ7C5GPN4E","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U2KQ7C5GPN4E4WZR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U2KQ7C5G","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:e7de200348e04aff68d1b561cec5be012b2f3d79659c791a32629ae62326d07c","target":"graph","created_at":"2026-05-18T04:05:25Z","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":"We consider the classical tree edit distance between ordered labeled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into another. The state-of-the-art solutions for the tree edit distance are not satisfactory. The main competitors in the field either have optimal worst-case complexity, but the worst case happens frequently, or they are very efficient for some tree shapes, but degenerate for others. This leads to unpredictable and often infeasible runtimes. There is no obvious way to choose between the algorithms. In this paper we present RT","authors_text":"Mateusz Pawlik, Nikolaus Augsten","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:35:26Z","title":"RTED: A Robust Algorithm for the Tree Edit Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0230","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:86dd1c41035dfcdce1672d5b3ef6f88a58d66654fedde1ff1a6c74d52065921b","target":"record","created_at":"2026-05-18T04:05:25Z","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":"fe287274937478c22ef4895214adae3c9524aea8d1d5d07ecc36dd120156c7a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:35:26Z","title_canon_sha256":"044749bbd54cda1b6e14c2628163123dc05d49be4778e50f33434585f4562392"},"schema_version":"1.0","source":{"id":"1201.0230","kind":"arxiv","version":1}},"canonical_sha256":"a6950f8ba67b784e5b31ba9ae88588de37e6b0e85a06b7d78acc40d6bf4b2c5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6950f8ba67b784e5b31ba9ae88588de37e6b0e85a06b7d78acc40d6bf4b2c5e","first_computed_at":"2026-05-18T04:05:25.759977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:25.759977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vos+hQ1iSaw2D9JX7YZNot3skrFmQ+zJ6SX+xR4ggMgxm1oA3kt7B4RJh/XglJPWfk90nylj/wbxyG6lLjZxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:25.760754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86dd1c41035dfcdce1672d5b3ef6f88a58d66654fedde1ff1a6c74d52065921b","sha256:e7de200348e04aff68d1b561cec5be012b2f3d79659c791a32629ae62326d07c"],"state_sha256":"849fd0e12914653f611a4c412b47077a9403f1deed1715fa68b6563aeca0ab4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Am12i8V9t6U/xrKth5Q6Z1iK5UcWYlGtXf4yNQWzFYDr4UMtC/Yz2zaGCzay2RBT65S1ptjyhBDtzYTVVb+1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:20:35.245103Z","bundle_sha256":"03ced8f6088691cc1b9515abec733e3af3f276cb4ee836a512d4e0bacd400b51"}}