{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BLYMXFNCXOBXZSSMRPMHWV4TJZ","short_pith_number":"pith:BLYMXFNC","canonical_record":{"source":{"id":"1506.01296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-03T16:02:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1c913d30ff35b47fc2f2bab3b190072e6007cc35e38943b3299ccb6b85138492","abstract_canon_sha256":"91695bd01f39b33c77fa10a4af18bb55faa66dadfbec050add49f1c40576e90f"},"schema_version":"1.0"},"canonical_sha256":"0af0cb95a2bb837cca4c8bd87b57934e44f9e4cea8915addc91d54092f4ef1e9","source":{"kind":"arxiv","id":"1506.01296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01296","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01296v1","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01296","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"BLYMXFNCXOBX","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLYMXFNCXOBXZSSM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLYMXFNC","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BLYMXFNCXOBXZSSMRPMHWV4TJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-03T16:02:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1c913d30ff35b47fc2f2bab3b190072e6007cc35e38943b3299ccb6b85138492","abstract_canon_sha256":"91695bd01f39b33c77fa10a4af18bb55faa66dadfbec050add49f1c40576e90f"},"schema_version":"1.0"},"canonical_sha256":"0af0cb95a2bb837cca4c8bd87b57934e44f9e4cea8915addc91d54092f4ef1e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:24.620186Z","signature_b64":"hXipMP1xbpiQfi61hIKeH5gHxkmcE3EDEBydn2DBy+yfx3OnqzSh42qVPXAuY0McG9ww+QpX3iMQk+RrSLELAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0af0cb95a2bb837cca4c8bd87b57934e44f9e4cea8915addc91d54092f4ef1e9","last_reissued_at":"2026-05-18T01:58:24.619762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:24.619762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01296","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:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MevMmUwVQSTdQFufvXExHjeVjm0mdLKwBREJEgJk8WAgySZKIRrOpDs0zFixoNXRXKGirILPmS2z9bKzuM5fAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:46:39.609652Z"},"content_sha256":"07c1dc310d35b804e5f4e478ffc3a4b086479d5d6ed7c9994264138a1fe12e9f","schema_version":"1.0","event_id":"sha256:07c1dc310d35b804e5f4e478ffc3a4b086479d5d6ed7c9994264138a1fe12e9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BLYMXFNCXOBXZSSMRPMHWV4TJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Circuit Complexity Meets Ontology-Based Data Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Vladimir V. Podolskii","submitted_at":"2015-06-03T16:02:07Z","abstract_excerpt":"Ontology-based data access is an approach to organizing access to a database augmented with a logical theory. In this approach query answering proceeds through a reformulation of a given query into a new one which can be answered without any use of theory. Thus the problem reduces to the standard database setting.\n  However, the size of the query may increase substantially during the reformulation. In this survey we review a recently developed framework on proving lower and upper bounds on the size of this reformulation by employing methods and results from Boolean circuit complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01296","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:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kapssYNbJMwWgQB2UZshQYSUznzglPF9eNfVvgRwEI39T5nQKv94EV78ThsmX0Px1tlSdKMignl3T4zhARkVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:46:39.610004Z"},"content_sha256":"27526c0dd5103f7a86e35ab34337ce89143272f10dee792cb03f9d331d31ea8f","schema_version":"1.0","event_id":"sha256:27526c0dd5103f7a86e35ab34337ce89143272f10dee792cb03f9d331d31ea8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLYMXFNCXOBXZSSMRPMHWV4TJZ/bundle.json","state_url":"https://pith.science/pith/BLYMXFNCXOBXZSSMRPMHWV4TJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLYMXFNCXOBXZSSMRPMHWV4TJZ/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-02T20:46:39Z","links":{"resolver":"https://pith.science/pith/BLYMXFNCXOBXZSSMRPMHWV4TJZ","bundle":"https://pith.science/pith/BLYMXFNCXOBXZSSMRPMHWV4TJZ/bundle.json","state":"https://pith.science/pith/BLYMXFNCXOBXZSSMRPMHWV4TJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLYMXFNCXOBXZSSMRPMHWV4TJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BLYMXFNCXOBXZSSMRPMHWV4TJZ","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":"91695bd01f39b33c77fa10a4af18bb55faa66dadfbec050add49f1c40576e90f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-03T16:02:07Z","title_canon_sha256":"1c913d30ff35b47fc2f2bab3b190072e6007cc35e38943b3299ccb6b85138492"},"schema_version":"1.0","source":{"id":"1506.01296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01296","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01296v1","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01296","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"BLYMXFNCXOBX","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLYMXFNCXOBXZSSM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLYMXFNC","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:27526c0dd5103f7a86e35ab34337ce89143272f10dee792cb03f9d331d31ea8f","target":"graph","created_at":"2026-05-18T01:58:24Z","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":"Ontology-based data access is an approach to organizing access to a database augmented with a logical theory. In this approach query answering proceeds through a reformulation of a given query into a new one which can be answered without any use of theory. Thus the problem reduces to the standard database setting.\n  However, the size of the query may increase substantially during the reformulation. In this survey we review a recently developed framework on proving lower and upper bounds on the size of this reformulation by employing methods and results from Boolean circuit complexity.","authors_text":"Vladimir V. Podolskii","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-03T16:02:07Z","title":"Circuit Complexity Meets Ontology-Based Data Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01296","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:07c1dc310d35b804e5f4e478ffc3a4b086479d5d6ed7c9994264138a1fe12e9f","target":"record","created_at":"2026-05-18T01:58:24Z","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":"91695bd01f39b33c77fa10a4af18bb55faa66dadfbec050add49f1c40576e90f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-03T16:02:07Z","title_canon_sha256":"1c913d30ff35b47fc2f2bab3b190072e6007cc35e38943b3299ccb6b85138492"},"schema_version":"1.0","source":{"id":"1506.01296","kind":"arxiv","version":1}},"canonical_sha256":"0af0cb95a2bb837cca4c8bd87b57934e44f9e4cea8915addc91d54092f4ef1e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0af0cb95a2bb837cca4c8bd87b57934e44f9e4cea8915addc91d54092f4ef1e9","first_computed_at":"2026-05-18T01:58:24.619762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:24.619762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hXipMP1xbpiQfi61hIKeH5gHxkmcE3EDEBydn2DBy+yfx3OnqzSh42qVPXAuY0McG9ww+QpX3iMQk+RrSLELAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:24.620186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07c1dc310d35b804e5f4e478ffc3a4b086479d5d6ed7c9994264138a1fe12e9f","sha256:27526c0dd5103f7a86e35ab34337ce89143272f10dee792cb03f9d331d31ea8f"],"state_sha256":"dc13d46e65a1d4f99aeaa589cc2220d38f93532acc32113b4209699d184a5756"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnTMzFW2biwH108Rl6yZYcGBxcy8LGU/3IyEXdgEO7tNo3rk6AN9p2u30IQVc08sDcAJ4LeooWxNQk7DsBl3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:46:39.612010Z","bundle_sha256":"9ba550ebf353a3598c7d37452a407bbdd7c0afe16f5fdcc01e19805fbe4162c4"}}