{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CRZTWAEMF2AWMCQSO7AQGKUD7T","short_pith_number":"pith:CRZTWAEM","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"},"canonical_sha256":"14733b008c2e81660a1277c1032a83fcd3723d020275e9d174418328d123da86","source":{"kind":"arxiv","id":"1703.08940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08940","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08940v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08940","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"CRZTWAEMF2AW","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CRZTWAEMF2AWMCQS","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CRZTWAEM","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CRZTWAEMF2AWMCQSO7AQGKUD7T","target":"record","payload":{"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"},"canonical_sha256":"14733b008c2e81660a1277c1032a83fcd3723d020275e9d174418328d123da86","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"},"source_kind":"arxiv","source_id":"1703.08940","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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"icZYakEQLSNDQlcJiJnSxRZ4Xyj2JNCWtuR9mz5hvVDW+O2PvITEpVq3ukjzXL2Lg6hmEzMaCLLVCIy0M0C3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:54:29.204170Z"},"content_sha256":"d9428ae4a3ec0ff51cd957e7234fb3c1463d600d10aa81d44f49706d9e97473f","schema_version":"1.0","event_id":"sha256:d9428ae4a3ec0ff51cd957e7234fb3c1463d600d10aa81d44f49706d9e97473f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CRZTWAEMF2AWMCQSO7AQGKUD7T","target":"graph","payload":{"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"},"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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+tSvKIRaFhIw5L3LboFdi7BufGoDB6Fr53pCkwkPyrT+6c9DNllAcKYD/fg7Ym0C7DgPBsiYlBd5Elf0Hn3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:54:29.204846Z"},"content_sha256":"3b09a0eb48724491faec178c88104460addd376fd8a0bfe7e6e7f3d2a5aa2028","schema_version":"1.0","event_id":"sha256:3b09a0eb48724491faec178c88104460addd376fd8a0bfe7e6e7f3d2a5aa2028"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/bundle.json","state_url":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/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-25T22:54:29Z","links":{"resolver":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T","bundle":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/bundle.json","state":"https://pith.science/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRZTWAEMF2AWMCQSO7AQGKUD7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CRZTWAEMF2AWMCQSO7AQGKUD7T","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":"658f734dfce32fe12f0dbf35568ad211f6abb6457af55bede43f8cab216d9e73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:48:36Z","title_canon_sha256":"40175f2b854385e0bd10015f789b610fabb6d54f7d90bed800fed641cf9c0ec4"},"schema_version":"1.0","source":{"id":"1703.08940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08940","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08940v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08940","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"CRZTWAEMF2AW","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CRZTWAEMF2AWMCQS","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CRZTWAEM","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:3b09a0eb48724491faec178c88104460addd376fd8a0bfe7e6e7f3d2a5aa2028","target":"graph","created_at":"2026-05-18T00:47:55Z","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 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","authors_text":"Karl Bringmann, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:48:36Z","title":"Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08940","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:d9428ae4a3ec0ff51cd957e7234fb3c1463d600d10aa81d44f49706d9e97473f","target":"record","created_at":"2026-05-18T00:47:55Z","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":"658f734dfce32fe12f0dbf35568ad211f6abb6457af55bede43f8cab216d9e73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:48:36Z","title_canon_sha256":"40175f2b854385e0bd10015f789b610fabb6d54f7d90bed800fed641cf9c0ec4"},"schema_version":"1.0","source":{"id":"1703.08940","kind":"arxiv","version":1}},"canonical_sha256":"14733b008c2e81660a1277c1032a83fcd3723d020275e9d174418328d123da86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14733b008c2e81660a1277c1032a83fcd3723d020275e9d174418328d123da86","first_computed_at":"2026-05-18T00:47:55.111394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:55.111394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tC1ZEAo9d/XJ0Uh5lasP7eqpXruNhvEAMB4f44za82ve/IQhaSrfUhd9VpfO/G6o2FVqB11KkDpu9tFo8a10AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:55.111808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9428ae4a3ec0ff51cd957e7234fb3c1463d600d10aa81d44f49706d9e97473f","sha256:3b09a0eb48724491faec178c88104460addd376fd8a0bfe7e6e7f3d2a5aa2028"],"state_sha256":"575d2830e61a267b8440147e08241af01e759279a820cbfc5738b0fb3582d802"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M18U/8FysCYDVG37KREDeQ5fW3fI2zQDpe620GM5NCl5SshBY/wi8hx8NIFpz3dds6x1LeP3fYfqruOU+87hBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:54:29.208603Z","bundle_sha256":"cbb576e0a6a65d3cffeb7a3444fd03118eaac715489c570e9515acb374361a3f"}}