{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BWHC7IKKB3FP547IA6MOFJMWTU","short_pith_number":"pith:BWHC7IKK","canonical_record":{"source":{"id":"1605.01207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-04T10:10:37Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"3007e4689581b28036166f8efd287d65820c215986309a819934c1ade413cb11","abstract_canon_sha256":"ffa7d19282944fdfbdfe20aea7286fb867171ec8f5c912aa2292ff8c1c44c021"},"schema_version":"1.0"},"canonical_sha256":"0d8e2fa14a0ecafef3e80798e2a5969d0376aebb020d70859112ef6c4e1540c3","source":{"kind":"arxiv","id":"1605.01207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01207","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01207v1","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01207","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"BWHC7IKKB3FP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BWHC7IKKB3FP547I","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BWHC7IKK","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BWHC7IKKB3FP547IA6MOFJMWTU","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-04T10:10:37Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"3007e4689581b28036166f8efd287d65820c215986309a819934c1ade413cb11","abstract_canon_sha256":"ffa7d19282944fdfbdfe20aea7286fb867171ec8f5c912aa2292ff8c1c44c021"},"schema_version":"1.0"},"canonical_sha256":"0d8e2fa14a0ecafef3e80798e2a5969d0376aebb020d70859112ef6c4e1540c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:37.519258Z","signature_b64":"paLCc6yuRP4ZYhcZFWX13bFrddkuAD9cjTUbpIdq94fUIP/YzdSkHUjOZplzkbzT1wWLV6Vz1O5qEk35QNDLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8e2fa14a0ecafef3e80798e2a5969d0376aebb020d70859112ef6c4e1540c3","last_reissued_at":"2026-05-18T01:15:37.518492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:37.518492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01207","source_version":1,"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-18T01:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2MQOZrIA6BZwKi0YVbEAXpHpo3EBQAY+I6vG9bdAYfLeeUwSPbhA32BvNMFLH9xKDn89I9sVqzCyJ9R+CwMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:53:54.360006Z"},"content_sha256":"9c574246fc9313513e3276d9e88c5514b15cd0208e9d72ded489b0f9e8439c42","schema_version":"1.0","event_id":"sha256:9c574246fc9313513e3276d9e88c5514b15cd0208e9d72ded489b0f9e8439c42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BWHC7IKKB3FP547IA6MOFJMWTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DB","authors_text":"Meghyn Bienvenu, Michael Zakharyaschev, Roman Kontchakov, Stanislav Kikot, Vladimir Podolskii","submitted_at":"2016-05-04T10:10:37Z","abstract_excerpt":"We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs), and the complexity problem for OMQ answering. We classify OMQs according to the shape of their conjunctive queries (treewidth, the number of leaves) and the existential depth of their ontologies. For each of these classes, we determine the combined complexity of OMQ answering, and whether all OMQs in the class have polynomial-size first-order, positive existential, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01207","kind":"arxiv","version":1},"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-18T01:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JG48+ZNdvO2lq77zr68DI1ySzVMmsxpvaolIody7VF1RCWDp/wAXY7Ix7hmtAHZa2FQ8LIiQrBtuSpwPTT2mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:53:54.360376Z"},"content_sha256":"73fa4e7fab91063f99a3586be5895cd89d295d5b211ae20aec3fe19563cacae8","schema_version":"1.0","event_id":"sha256:73fa4e7fab91063f99a3586be5895cd89d295d5b211ae20aec3fe19563cacae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWHC7IKKB3FP547IA6MOFJMWTU/bundle.json","state_url":"https://pith.science/pith/BWHC7IKKB3FP547IA6MOFJMWTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWHC7IKKB3FP547IA6MOFJMWTU/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-05-30T08:53:54Z","links":{"resolver":"https://pith.science/pith/BWHC7IKKB3FP547IA6MOFJMWTU","bundle":"https://pith.science/pith/BWHC7IKKB3FP547IA6MOFJMWTU/bundle.json","state":"https://pith.science/pith/BWHC7IKKB3FP547IA6MOFJMWTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWHC7IKKB3FP547IA6MOFJMWTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BWHC7IKKB3FP547IA6MOFJMWTU","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":"ffa7d19282944fdfbdfe20aea7286fb867171ec8f5c912aa2292ff8c1c44c021","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-04T10:10:37Z","title_canon_sha256":"3007e4689581b28036166f8efd287d65820c215986309a819934c1ade413cb11"},"schema_version":"1.0","source":{"id":"1605.01207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01207","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01207v1","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01207","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"BWHC7IKKB3FP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BWHC7IKKB3FP547I","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BWHC7IKK","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:73fa4e7fab91063f99a3586be5895cd89d295d5b211ae20aec3fe19563cacae8","target":"graph","created_at":"2026-05-18T01:15:37Z","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 give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs), and the complexity problem for OMQ answering. We classify OMQs according to the shape of their conjunctive queries (treewidth, the number of leaves) and the existential depth of their ontologies. For each of these classes, we determine the combined complexity of OMQ answering, and whether all OMQs in the class have polynomial-size first-order, positive existential, and","authors_text":"Meghyn Bienvenu, Michael Zakharyaschev, Roman Kontchakov, Stanislav Kikot, Vladimir Podolskii","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-04T10:10:37Z","title":"Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01207","kind":"arxiv","version":1},"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:9c574246fc9313513e3276d9e88c5514b15cd0208e9d72ded489b0f9e8439c42","target":"record","created_at":"2026-05-18T01:15:37Z","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":"ffa7d19282944fdfbdfe20aea7286fb867171ec8f5c912aa2292ff8c1c44c021","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-04T10:10:37Z","title_canon_sha256":"3007e4689581b28036166f8efd287d65820c215986309a819934c1ade413cb11"},"schema_version":"1.0","source":{"id":"1605.01207","kind":"arxiv","version":1}},"canonical_sha256":"0d8e2fa14a0ecafef3e80798e2a5969d0376aebb020d70859112ef6c4e1540c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d8e2fa14a0ecafef3e80798e2a5969d0376aebb020d70859112ef6c4e1540c3","first_computed_at":"2026-05-18T01:15:37.518492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:37.518492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"paLCc6yuRP4ZYhcZFWX13bFrddkuAD9cjTUbpIdq94fUIP/YzdSkHUjOZplzkbzT1wWLV6Vz1O5qEk35QNDLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:37.519258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c574246fc9313513e3276d9e88c5514b15cd0208e9d72ded489b0f9e8439c42","sha256:73fa4e7fab91063f99a3586be5895cd89d295d5b211ae20aec3fe19563cacae8"],"state_sha256":"41740e70359c459a66f054f00e5f1b5f4b6d7a55be347797bc27eed61a487b2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MKMFcHoMgJeRPtk1xi7h7MvFvY4GRKpH+Uw29FCSgfKveMGHmyxDzTecjgEzsBOaq6MlrkBiFubF9oD5683DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:53:54.362397Z","bundle_sha256":"34ae8b4cc6b7f6b6177d05a822c6e0029a7bdb6d02ceb78cae51cc3a4a1301ac"}}