{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VSNB2OYGO6ZTJCZ7LLUAHKVNAJ","short_pith_number":"pith:VSNB2OYG","schema_version":"1.0","canonical_sha256":"ac9a1d3b0677b3348b3f5ae803aaad025acb84fc3cb88c05e86f7b59fb0f9c83","source":{"kind":"arxiv","id":"1503.02210","version":2},"attestation_state":"computed","paper":{"title":"Containment for Conditional Tree Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alessandro Facchini (University of Warsaw), Evgeny Sherkhonov (University of Amsterdam), Maarten Marx (University of Amsterdam), Technology), Yoichi Hirai (National Institute of Advanced Industrial Science","submitted_at":"2015-03-07T20:22:45Z","abstract_excerpt":"A Conditional Tree Pattern (CTP) expands an XML tree pattern with labels attached to the descendant edges. These labels can be XML element names or Boolean CTPs. The meaning of a descendant edge labelled by A and ending in a node labelled by B is a path of child steps ending in a B node such that all intermediate nodes are A nodes. In effect this expresses the until B, A holds construction from temporal logic.This paper studies the containment problem for CTP. For tree patterns (TP), this problem is known to be coNP-complete. We show that it is PSPACE-complete for CTP. This increase in complex"},"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":"1503.02210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-07T20:22:45Z","cross_cats_sorted":[],"title_canon_sha256":"41650c05990c9e18280c46b4802cd84b215b655939032da223da993a186ae98c","abstract_canon_sha256":"a8903b95839633663e3acc13240707c379f7e0a0b176a38fff6dd212a95b5304"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.881260Z","signature_b64":"ff3x1CCmc5MUZDWvSAifC3YLTBSqxZwzSAEQ+kTeLKKpYFU0ITQx4mT0P5bhqbhLTQ4XlwASFu3bVBP0M/yVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac9a1d3b0677b3348b3f5ae803aaad025acb84fc3cb88c05e86f7b59fb0f9c83","last_reissued_at":"2026-05-18T00:53:10.880804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.880804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Containment for Conditional Tree Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alessandro Facchini (University of Warsaw), Evgeny Sherkhonov (University of Amsterdam), Maarten Marx (University of Amsterdam), Technology), Yoichi Hirai (National Institute of Advanced Industrial Science","submitted_at":"2015-03-07T20:22:45Z","abstract_excerpt":"A Conditional Tree Pattern (CTP) expands an XML tree pattern with labels attached to the descendant edges. These labels can be XML element names or Boolean CTPs. The meaning of a descendant edge labelled by A and ending in a node labelled by B is a path of child steps ending in a B node such that all intermediate nodes are A nodes. In effect this expresses the until B, A holds construction from temporal logic.This paper studies the containment problem for CTP. For tree patterns (TP), this problem is known to be coNP-complete. We show that it is PSPACE-complete for CTP. This increase in complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02210","kind":"arxiv","version":2},"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":"1503.02210","created_at":"2026-05-18T00:53:10.880866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02210v2","created_at":"2026-05-18T00:53:10.880866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02210","created_at":"2026-05-18T00:53:10.880866+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSNB2OYGO6ZT","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSNB2OYGO6ZTJCZ7","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSNB2OYG","created_at":"2026-05-18T12:29:47.479230+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/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ","json":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ.json","graph_json":"https://pith.science/api/pith-number/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/graph.json","events_json":"https://pith.science/api/pith-number/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/events.json","paper":"https://pith.science/paper/VSNB2OYG"},"agent_actions":{"view_html":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ","download_json":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ.json","view_paper":"https://pith.science/paper/VSNB2OYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02210&json=true","fetch_graph":"https://pith.science/api/pith-number/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/action/storage_attestation","attest_author":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/action/author_attestation","sign_citation":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/action/citation_signature","submit_replication":"https://pith.science/pith/VSNB2OYGO6ZTJCZ7LLUAHKVNAJ/action/replication_record"}},"created_at":"2026-05-18T00:53:10.880866+00:00","updated_at":"2026-05-18T00:53:10.880866+00:00"}