{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LIMORQ3QCODPMXLYXRMSDNUSF4","short_pith_number":"pith:LIMORQ3Q","schema_version":"1.0","canonical_sha256":"5a18e8c3701386f65d78bc5921b6922f2a4116a19b59c6d25af2e1c2e869f5c5","source":{"kind":"arxiv","id":"1406.3047","version":2},"attestation_state":"computed","paper":{"title":"Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DB"],"primary_cat":"cs.AI","authors_text":"Meghyn Bienvenu, Stanislav Kikot, Vladimir Podolskii","submitted_at":"2014-06-11T20:07:49Z","abstract_excerpt":"This paper investigates the impact of query topology on the difficulty of answering conjunctive queries in the presence of OWL 2 QL ontologies. Our first contribution is to clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries to bounded treewidth queries. Perhaps our most surprising result is a superpolynomial lower bound on the size of PE-rewritings that holds already for linear queries and ontologies of depth 2. More positively, we show that poly"},"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":"1406.3047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-11T20:07:49Z","cross_cats_sorted":["cs.CC","cs.DB"],"title_canon_sha256":"5ff1308ffb052b390e1059604d6f60a7b3e0e854ed059001290da94abb0470e0","abstract_canon_sha256":"74e9bddc29a36ebf9eb07ebc9404065baffe1ce6c35147c98a8120aa04643c2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:11.491339Z","signature_b64":"V+kcCNIWXLh8cbercDEB5+2cxIgjM5H8h28WDirxifpXHLSi7IQrMih+mQr7XBHOra/tNlZQCjyWg/kfTITfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a18e8c3701386f65d78bc5921b6922f2a4116a19b59c6d25af2e1c2e869f5c5","last_reissued_at":"2026-05-18T02:12:11.490634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:11.490634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DB"],"primary_cat":"cs.AI","authors_text":"Meghyn Bienvenu, Stanislav Kikot, Vladimir Podolskii","submitted_at":"2014-06-11T20:07:49Z","abstract_excerpt":"This paper investigates the impact of query topology on the difficulty of answering conjunctive queries in the presence of OWL 2 QL ontologies. Our first contribution is to clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries to bounded treewidth queries. Perhaps our most surprising result is a superpolynomial lower bound on the size of PE-rewritings that holds already for linear queries and ontologies of depth 2. More positively, we show that poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3047","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":"1406.3047","created_at":"2026-05-18T02:12:11.490748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3047v2","created_at":"2026-05-18T02:12:11.490748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3047","created_at":"2026-05-18T02:12:11.490748+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIMORQ3QCODP","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIMORQ3QCODPMXLY","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIMORQ3Q","created_at":"2026-05-18T12:28:38.356838+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/LIMORQ3QCODPMXLYXRMSDNUSF4","json":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4.json","graph_json":"https://pith.science/api/pith-number/LIMORQ3QCODPMXLYXRMSDNUSF4/graph.json","events_json":"https://pith.science/api/pith-number/LIMORQ3QCODPMXLYXRMSDNUSF4/events.json","paper":"https://pith.science/paper/LIMORQ3Q"},"agent_actions":{"view_html":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4","download_json":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4.json","view_paper":"https://pith.science/paper/LIMORQ3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3047&json=true","fetch_graph":"https://pith.science/api/pith-number/LIMORQ3QCODPMXLYXRMSDNUSF4/graph.json","fetch_events":"https://pith.science/api/pith-number/LIMORQ3QCODPMXLYXRMSDNUSF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4/action/storage_attestation","attest_author":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4/action/author_attestation","sign_citation":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4/action/citation_signature","submit_replication":"https://pith.science/pith/LIMORQ3QCODPMXLYXRMSDNUSF4/action/replication_record"}},"created_at":"2026-05-18T02:12:11.490748+00:00","updated_at":"2026-05-18T02:12:11.490748+00:00"}