{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S5JA2NMVJKHV33A2S63ULAMVZL","short_pith_number":"pith:S5JA2NMV","canonical_record":{"source":{"id":"1602.07210","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T15:48:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4c9e6488db0446390573ba4405b382ce71413c270c58af47c9a5e6791709d9ad","abstract_canon_sha256":"ace2c04d8de14a89cde77a11e1018880aaa66369f78322f8eee7a32f0cd2035c"},"schema_version":"1.0"},"canonical_sha256":"97520d35954a8f5dec1a97b7458195cac352d6ea8bf64ca50041e421c246eca0","source":{"kind":"arxiv","id":"1602.07210","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07210","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07210v4","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07210","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"S5JA2NMVJKHV","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S5JA2NMVJKHV33A2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S5JA2NMV","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S5JA2NMVJKHV33A2S63ULAMVZL","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07210","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T15:48:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4c9e6488db0446390573ba4405b382ce71413c270c58af47c9a5e6791709d9ad","abstract_canon_sha256":"ace2c04d8de14a89cde77a11e1018880aaa66369f78322f8eee7a32f0cd2035c"},"schema_version":"1.0"},"canonical_sha256":"97520d35954a8f5dec1a97b7458195cac352d6ea8bf64ca50041e421c246eca0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:25.851627Z","signature_b64":"S7mPeAC+9dwvfMlLdiTrnlf1xqx42Bpx9bahzZBzXhsCq74I5CxiXPVdjgZEiG3/qO61Q2sMVcg8/BDFnPyUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97520d35954a8f5dec1a97b7458195cac352d6ea8bf64ca50041e421c246eca0","last_reissued_at":"2026-05-18T01:08:25.850955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:25.850955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07210","source_version":4,"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-18T01:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/b2fu1jKWE7BDFMM8GdmBivTaQNPcbe1zLWXeuXMUlqaAMNR7+bkvB/0kwIPwoMMcQqzG3Q0DaouRXnwK6RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:09:10.124029Z"},"content_sha256":"85dbdbe3975cf348d952700b1208fcd09b1cc4654c5a8ae47052ca83654b8c59","schema_version":"1.0","event_id":"sha256:85dbdbe3975cf348d952700b1208fcd09b1cc4654c5a8ae47052ca83654b8c59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S5JA2NMVJKHV33A2S63ULAMVZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for the Maximum Common Subtree Isomorphism Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andre Droschinsky, Nils M. Kriege, Petra Mutzel","submitted_at":"2016-02-23T15:48:25Z","abstract_excerpt":"The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\\sf NP}$-hard in general graphs. Confining to trees renders polynomial time algorithms possible and is of fundamental importance for approaches on more general graph classes. Various variants of this problem in trees have been intensively studied. We consider the general case, where trees are neither rooted nor ordered and the isomorphism is maximum w.r.t. a weight function on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07210","kind":"arxiv","version":4},"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-18T01:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHPGWtbjZCRm+VRcIVX8cDyU7gNasg+2PxLma1hGIZNBM+72CzzV13opxGNoJBPhOCd7BkORBcwXtgexxcmMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:09:10.124426Z"},"content_sha256":"9fe0ca38d17d6193fed8b4696bc54f1ac3f23c979a1881a4efdff5108e551bca","schema_version":"1.0","event_id":"sha256:9fe0ca38d17d6193fed8b4696bc54f1ac3f23c979a1881a4efdff5108e551bca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5JA2NMVJKHV33A2S63ULAMVZL/bundle.json","state_url":"https://pith.science/pith/S5JA2NMVJKHV33A2S63ULAMVZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5JA2NMVJKHV33A2S63ULAMVZL/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-05T22:09:10Z","links":{"resolver":"https://pith.science/pith/S5JA2NMVJKHV33A2S63ULAMVZL","bundle":"https://pith.science/pith/S5JA2NMVJKHV33A2S63ULAMVZL/bundle.json","state":"https://pith.science/pith/S5JA2NMVJKHV33A2S63ULAMVZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5JA2NMVJKHV33A2S63ULAMVZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S5JA2NMVJKHV33A2S63ULAMVZL","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":"ace2c04d8de14a89cde77a11e1018880aaa66369f78322f8eee7a32f0cd2035c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T15:48:25Z","title_canon_sha256":"4c9e6488db0446390573ba4405b382ce71413c270c58af47c9a5e6791709d9ad"},"schema_version":"1.0","source":{"id":"1602.07210","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07210","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07210v4","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07210","created_at":"2026-05-18T01:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"S5JA2NMVJKHV","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S5JA2NMVJKHV33A2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S5JA2NMV","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:9fe0ca38d17d6193fed8b4696bc54f1ac3f23c979a1881a4efdff5108e551bca","target":"graph","created_at":"2026-05-18T01:08: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":"The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\\sf NP}$-hard in general graphs. Confining to trees renders polynomial time algorithms possible and is of fundamental importance for approaches on more general graph classes. Various variants of this problem in trees have been intensively studied. We consider the general case, where trees are neither rooted nor ordered and the isomorphism is maximum w.r.t. a weight function on","authors_text":"Andre Droschinsky, Nils M. Kriege, Petra Mutzel","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T15:48:25Z","title":"Faster Algorithms for the Maximum Common Subtree Isomorphism Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07210","kind":"arxiv","version":4},"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:85dbdbe3975cf348d952700b1208fcd09b1cc4654c5a8ae47052ca83654b8c59","target":"record","created_at":"2026-05-18T01:08: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":"ace2c04d8de14a89cde77a11e1018880aaa66369f78322f8eee7a32f0cd2035c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T15:48:25Z","title_canon_sha256":"4c9e6488db0446390573ba4405b382ce71413c270c58af47c9a5e6791709d9ad"},"schema_version":"1.0","source":{"id":"1602.07210","kind":"arxiv","version":4}},"canonical_sha256":"97520d35954a8f5dec1a97b7458195cac352d6ea8bf64ca50041e421c246eca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97520d35954a8f5dec1a97b7458195cac352d6ea8bf64ca50041e421c246eca0","first_computed_at":"2026-05-18T01:08:25.850955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:25.850955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S7mPeAC+9dwvfMlLdiTrnlf1xqx42Bpx9bahzZBzXhsCq74I5CxiXPVdjgZEiG3/qO61Q2sMVcg8/BDFnPyUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:25.851627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07210","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85dbdbe3975cf348d952700b1208fcd09b1cc4654c5a8ae47052ca83654b8c59","sha256:9fe0ca38d17d6193fed8b4696bc54f1ac3f23c979a1881a4efdff5108e551bca"],"state_sha256":"97d6ea8db2f930db1f266ccd0e86e8f9aefe453f6765b0bcb0662a4e14cc4566"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IX+9jCjPVr4oo+1kGH3EP9ME7/6psgDFaCcI/TJBZZm9kDf49ZJxCQ5XZc2joqKwF92DEtS3On4RYEssdLnNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:09:10.128231Z","bundle_sha256":"a6cdb87f64a9844e045a2851ee784070429c57d5bdd4eeed59620111d688cd14"}}