{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7RP7ZTPY3FNNAFK4BWENOUQVDM","short_pith_number":"pith:7RP7ZTPY","schema_version":"1.0","canonical_sha256":"fc5ffccdf8d95ad0155c0d88d752151b149db78e9ba36da0145df76b5def2923","source":{"kind":"arxiv","id":"1202.4193","version":4},"attestation_state":"computed","paper":{"title":"Exponential Lower Bounds and Separation for Query Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Michael Zakharyaschev, Roman Kontchakov, Stanislav Kikot, Vladimir Podolskii","submitted_at":"2012-02-19T22:28:54Z","abstract_excerpt":"We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we show that, in the worst case, positive existential and nonrecursive Datalog rewritings are exponentially longer than the original queries; nonrecursive Datalog rewritings are in general exponentially "},"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":"1202.4193","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-19T22:28:54Z","cross_cats_sorted":[],"title_canon_sha256":"e428030621867dbdb876c1aaf301d3069d92cad836e13af062323a39cfb47dd1","abstract_canon_sha256":"cfce921cf3deb0bad0584c8fc2ac2ad98860c8aa5f6d5d3980073b707b06c493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:46.466694Z","signature_b64":"iwFZ8VRtm/cwCSBJwbAUfobJHohgmPaiRbSF6ViONdI814/XnUgDY/tqH/GhmRduc9StJ/81ylPiu1Xy5X0DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5ffccdf8d95ad0155c0d88d752151b149db78e9ba36da0145df76b5def2923","last_reissued_at":"2026-05-18T03:55:46.466245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:46.466245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Lower Bounds and Separation for Query Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Michael Zakharyaschev, Roman Kontchakov, Stanislav Kikot, Vladimir Podolskii","submitted_at":"2012-02-19T22:28:54Z","abstract_excerpt":"We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we show that, in the worst case, positive existential and nonrecursive Datalog rewritings are exponentially longer than the original queries; nonrecursive Datalog rewritings are in general exponentially "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4193","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.4193","created_at":"2026-05-18T03:55:46.466321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4193v4","created_at":"2026-05-18T03:55:46.466321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4193","created_at":"2026-05-18T03:55:46.466321+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RP7ZTPY3FNN","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RP7ZTPY3FNNAFK4","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RP7ZTPY","created_at":"2026-05-18T12:26:58.693483+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/7RP7ZTPY3FNNAFK4BWENOUQVDM","json":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM.json","graph_json":"https://pith.science/api/pith-number/7RP7ZTPY3FNNAFK4BWENOUQVDM/graph.json","events_json":"https://pith.science/api/pith-number/7RP7ZTPY3FNNAFK4BWENOUQVDM/events.json","paper":"https://pith.science/paper/7RP7ZTPY"},"agent_actions":{"view_html":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM","download_json":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM.json","view_paper":"https://pith.science/paper/7RP7ZTPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4193&json=true","fetch_graph":"https://pith.science/api/pith-number/7RP7ZTPY3FNNAFK4BWENOUQVDM/graph.json","fetch_events":"https://pith.science/api/pith-number/7RP7ZTPY3FNNAFK4BWENOUQVDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/action/storage_attestation","attest_author":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/action/author_attestation","sign_citation":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/action/citation_signature","submit_replication":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/action/replication_record"}},"created_at":"2026-05-18T03:55:46.466321+00:00","updated_at":"2026-05-18T03:55:46.466321+00:00"}