{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:VMDO7S4RAUVETKK36H5IRQUSAG","short_pith_number":"pith:VMDO7S4R","canonical_record":{"source":{"id":"cs/0608124","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2006-08-31T12:23:37Z","cross_cats_sorted":[],"title_canon_sha256":"d9d1d0cc48a5e1ff1cc98494bdbe24332db8a843c6e9d36237fa073a1039a4a4","abstract_canon_sha256":"1c89194a45e0234f259e5819b9b9b834d6b34c24135a7b59de512b435694f587"},"schema_version":"1.0"},"canonical_sha256":"ab06efcb91052a49a95bf1fa88c292019e41ee103b828737da8f25fa926c17b3","source":{"kind":"arxiv","id":"cs/0608124","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0608124","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0608124v5","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0608124","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"VMDO7S4RAUVE","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"VMDO7S4RAUVETKK3","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"VMDO7S4R","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:VMDO7S4RAUVETKK36H5IRQUSAG","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0608124","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2006-08-31T12:23:37Z","cross_cats_sorted":[],"title_canon_sha256":"d9d1d0cc48a5e1ff1cc98494bdbe24332db8a843c6e9d36237fa073a1039a4a4","abstract_canon_sha256":"1c89194a45e0234f259e5819b9b9b834d6b34c24135a7b59de512b435694f587"},"schema_version":"1.0"},"canonical_sha256":"ab06efcb91052a49a95bf1fa88c292019e41ee103b828737da8f25fa926c17b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:22.896724Z","signature_b64":"6D4X3wqAsxwm1n8RaEemYDHcyCQAKF5bVaauFjovN75IAZsyRddwpoXgRzb6m+b0VH7bYpyZZA6fj4axKUoEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab06efcb91052a49a95bf1fa88c292019e41ee103b828737da8f25fa926c17b3","last_reissued_at":"2026-05-18T04:31:22.896310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:22.896310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0608124","source_version":5,"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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6YS7PBUm1l5eBmXxUjzmx/wrFH7ZPF6+A2l2Nci/okzFl1cZmhHagHlLpiM71va0pSHdQQiHI3biGqmQ+pShAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:00:51.080773Z"},"content_sha256":"8eb4f4df8f4a3e0f224e9ecffa4f5a231617abbcb62ec824ff0fc4e0d84dde87","schema_version":"1.0","event_id":"sha256:8eb4f4df8f4a3e0f224e9ecffa4f5a231617abbcb62ec824ff0fc4e0d84dde87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:VMDO7S4RAUVETKK36H5IRQUSAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Tree Inclusion Problem: In Linear Space and Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li Goertz, Philip Bille","submitted_at":"2006-08-31T12:23:37Z","abstract_excerpt":"Given two rooted, ordered, and labeled trees $P$ and $T$ the tree inclusion problem is to determine if $P$ can be obtained from $T$ by deleting nodes in $T$. This problem has recently been recognized as an important query primitive in XML databases. Kilpel\\\"ainen and Mannila [\\emph{SIAM J. Comput. 1995}] presented the first polynomial time algorithm using quadratic time and space. Since then several improved results have been obtained for special cases when $P$ and $T$ have a small number of leaves or small depth. However, in the worst case these algorithms still use quadratic time and space. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0608124","kind":"arxiv","version":5},"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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqCUQwAG4/FnaDiiHIwZA9q6hxNO05ZI9NvzfnTSFmOZlm/r7tChivHhBItOhpUGQOG0i3IrJnqHLyfExrOwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:00:51.081147Z"},"content_sha256":"694d6b31c60dcc564fc04d0bcdd473dcff26b7fdce18c85a658668d34f40ecb4","schema_version":"1.0","event_id":"sha256:694d6b31c60dcc564fc04d0bcdd473dcff26b7fdce18c85a658668d34f40ecb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/bundle.json","state_url":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMDO7S4RAUVETKK36H5IRQUSAG/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-03T09:00:51Z","links":{"resolver":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG","bundle":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/bundle.json","state":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMDO7S4RAUVETKK36H5IRQUSAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:VMDO7S4RAUVETKK36H5IRQUSAG","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":"1c89194a45e0234f259e5819b9b9b834d6b34c24135a7b59de512b435694f587","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2006-08-31T12:23:37Z","title_canon_sha256":"d9d1d0cc48a5e1ff1cc98494bdbe24332db8a843c6e9d36237fa073a1039a4a4"},"schema_version":"1.0","source":{"id":"cs/0608124","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0608124","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0608124v5","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0608124","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"VMDO7S4RAUVE","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"VMDO7S4RAUVETKK3","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"VMDO7S4R","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:694d6b31c60dcc564fc04d0bcdd473dcff26b7fdce18c85a658668d34f40ecb4","target":"graph","created_at":"2026-05-18T04:31:22Z","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":"Given two rooted, ordered, and labeled trees $P$ and $T$ the tree inclusion problem is to determine if $P$ can be obtained from $T$ by deleting nodes in $T$. This problem has recently been recognized as an important query primitive in XML databases. Kilpel\\\"ainen and Mannila [\\emph{SIAM J. Comput. 1995}] presented the first polynomial time algorithm using quadratic time and space. Since then several improved results have been obtained for special cases when $P$ and $T$ have a small number of leaves or small depth. However, in the worst case these algorithms still use quadratic time and space. ","authors_text":"Inge Li Goertz, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2006-08-31T12:23:37Z","title":"The Tree Inclusion Problem: In Linear Space and Faster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0608124","kind":"arxiv","version":5},"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:8eb4f4df8f4a3e0f224e9ecffa4f5a231617abbcb62ec824ff0fc4e0d84dde87","target":"record","created_at":"2026-05-18T04:31:22Z","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":"1c89194a45e0234f259e5819b9b9b834d6b34c24135a7b59de512b435694f587","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2006-08-31T12:23:37Z","title_canon_sha256":"d9d1d0cc48a5e1ff1cc98494bdbe24332db8a843c6e9d36237fa073a1039a4a4"},"schema_version":"1.0","source":{"id":"cs/0608124","kind":"arxiv","version":5}},"canonical_sha256":"ab06efcb91052a49a95bf1fa88c292019e41ee103b828737da8f25fa926c17b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab06efcb91052a49a95bf1fa88c292019e41ee103b828737da8f25fa926c17b3","first_computed_at":"2026-05-18T04:31:22.896310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:22.896310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6D4X3wqAsxwm1n8RaEemYDHcyCQAKF5bVaauFjovN75IAZsyRddwpoXgRzb6m+b0VH7bYpyZZA6fj4axKUoEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:22.896724Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0608124","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eb4f4df8f4a3e0f224e9ecffa4f5a231617abbcb62ec824ff0fc4e0d84dde87","sha256:694d6b31c60dcc564fc04d0bcdd473dcff26b7fdce18c85a658668d34f40ecb4"],"state_sha256":"7b68dffba965e1e99c56b220da1690ca60dd9f2ecad70805b4e1af4ea8a22b9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6NClmIPlQAYcdjeBHTpt7MVGaX5MQrSZn1GGNuZCRwHZwcBCqofdbEDNqiRJijRu5AoLLAMGpFVcM2F/8fVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:00:51.083118Z","bundle_sha256":"e03e953d2a2ff9f907938ac384dbb995d5ed06855373b39ea1ee4dfda13aa6ba"}}