{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:VMDO7S4RAUVETKK36H5IRQUSAG","short_pith_number":"pith:VMDO7S4R","schema_version":"1.0","canonical_sha256":"ab06efcb91052a49a95bf1fa88c292019e41ee103b828737da8f25fa926c17b3","source":{"kind":"arxiv","id":"cs/0608124","version":5},"attestation_state":"computed","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. "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0608124","created_at":"2026-05-18T04:31:22.896376+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0608124v5","created_at":"2026-05-18T04:31:22.896376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0608124","created_at":"2026-05-18T04:31:22.896376+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMDO7S4RAUVE","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMDO7S4RAUVETKK3","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMDO7S4R","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG","json":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG.json","graph_json":"https://pith.science/api/pith-number/VMDO7S4RAUVETKK36H5IRQUSAG/graph.json","events_json":"https://pith.science/api/pith-number/VMDO7S4RAUVETKK36H5IRQUSAG/events.json","paper":"https://pith.science/paper/VMDO7S4R"},"agent_actions":{"view_html":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG","download_json":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG.json","view_paper":"https://pith.science/paper/VMDO7S4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0608124&json=true","fetch_graph":"https://pith.science/api/pith-number/VMDO7S4RAUVETKK36H5IRQUSAG/graph.json","fetch_events":"https://pith.science/api/pith-number/VMDO7S4RAUVETKK36H5IRQUSAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/action/storage_attestation","attest_author":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/action/author_attestation","sign_citation":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/action/citation_signature","submit_replication":"https://pith.science/pith/VMDO7S4RAUVETKK36H5IRQUSAG/action/replication_record"}},"created_at":"2026-05-18T04:31:22.896376+00:00","updated_at":"2026-05-18T04:31:22.896376+00:00"}