{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7RP7ZTPY3FNNAFK4BWENOUQVDM","short_pith_number":"pith:7RP7ZTPY","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"},"canonical_sha256":"fc5ffccdf8d95ad0155c0d88d752151b149db78e9ba36da0145df76b5def2923","source":{"kind":"arxiv","id":"1202.4193","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4193","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4193v4","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4193","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"7RP7ZTPY3FNN","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7RP7ZTPY3FNNAFK4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7RP7ZTPY","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7RP7ZTPY3FNNAFK4BWENOUQVDM","target":"record","payload":{"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"},"canonical_sha256":"fc5ffccdf8d95ad0155c0d88d752151b149db78e9ba36da0145df76b5def2923","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"},"source_kind":"arxiv","source_id":"1202.4193","source_version":4,"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-18T03:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"et7OcUppoi49m9qqNe0ljovBvKSXqqaeUPLoAu6cbIZ01bZGCqZtEnFaYag8VlPrMoOjcpgePo7zZjp5D9QjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:54:17.509242Z"},"content_sha256":"7b83ad2a35c2eb4ceace06a8671cc55a6f1839471cb912b79c093f9655ac2861","schema_version":"1.0","event_id":"sha256:7b83ad2a35c2eb4ceace06a8671cc55a6f1839471cb912b79c093f9655ac2861"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7RP7ZTPY3FNNAFK4BWENOUQVDM","target":"graph","payload":{"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"},"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-18T03:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrczaivqLREctYys7TS7yh5cGH5+2L/2x713YaHBGixdsC7a6m7WOHk40pMIEktxFo9g6XvMveTyp206Dd9BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:54:17.509617Z"},"content_sha256":"e14c312748f9c36e772b29871f20f7ca82f4ef96b0c71189aebd83d2b802f799","schema_version":"1.0","event_id":"sha256:e14c312748f9c36e772b29871f20f7ca82f4ef96b0c71189aebd83d2b802f799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/bundle.json","state_url":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/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-02T22:54:17Z","links":{"resolver":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM","bundle":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/bundle.json","state":"https://pith.science/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RP7ZTPY3FNNAFK4BWENOUQVDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7RP7ZTPY3FNNAFK4BWENOUQVDM","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":"cfce921cf3deb0bad0584c8fc2ac2ad98860c8aa5f6d5d3980073b707b06c493","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-19T22:28:54Z","title_canon_sha256":"e428030621867dbdb876c1aaf301d3069d92cad836e13af062323a39cfb47dd1"},"schema_version":"1.0","source":{"id":"1202.4193","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4193","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4193v4","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4193","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"7RP7ZTPY3FNN","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7RP7ZTPY3FNNAFK4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7RP7ZTPY","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:e14c312748f9c36e772b29871f20f7ca82f4ef96b0c71189aebd83d2b802f799","target":"graph","created_at":"2026-05-18T03:55:46Z","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":"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 ","authors_text":"Michael Zakharyaschev, Roman Kontchakov, Stanislav Kikot, Vladimir Podolskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-19T22:28:54Z","title":"Exponential Lower Bounds and Separation for Query Rewriting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4193","kind":"arxiv","version":4},"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:7b83ad2a35c2eb4ceace06a8671cc55a6f1839471cb912b79c093f9655ac2861","target":"record","created_at":"2026-05-18T03:55:46Z","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":"cfce921cf3deb0bad0584c8fc2ac2ad98860c8aa5f6d5d3980073b707b06c493","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-19T22:28:54Z","title_canon_sha256":"e428030621867dbdb876c1aaf301d3069d92cad836e13af062323a39cfb47dd1"},"schema_version":"1.0","source":{"id":"1202.4193","kind":"arxiv","version":4}},"canonical_sha256":"fc5ffccdf8d95ad0155c0d88d752151b149db78e9ba36da0145df76b5def2923","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc5ffccdf8d95ad0155c0d88d752151b149db78e9ba36da0145df76b5def2923","first_computed_at":"2026-05-18T03:55:46.466245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:46.466245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iwFZ8VRtm/cwCSBJwbAUfobJHohgmPaiRbSF6ViONdI814/XnUgDY/tqH/GhmRduc9StJ/81ylPiu1Xy5X0DAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:46.466694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4193","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b83ad2a35c2eb4ceace06a8671cc55a6f1839471cb912b79c093f9655ac2861","sha256:e14c312748f9c36e772b29871f20f7ca82f4ef96b0c71189aebd83d2b802f799"],"state_sha256":"9f87b73224d72807f4a750ced93fda9d03713ba76a9564bca890117ea4cbaa1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZldodrLM+8xFmavc5d4hDQALz9SuPFrnQTiCRR1j0timegHNUL/at43OKaPEaGT/Pwm+9VH+joMw250wc8wQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:54:17.511596Z","bundle_sha256":"6027e575cba48cd50eb0966d383e76b1b84fbdaa20cb2bac44d27a78e977f307"}}