{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:26LCCKM3IJOPTUHHT2V2LHB6DM","short_pith_number":"pith:26LCCKM3","canonical_record":{"source":{"id":"1411.2516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-10T17:50:06Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"7ad8b8ddc3abda33e104513fe2b1e0d8d1df06e2ace0861572dbada8c0149771","abstract_canon_sha256":"b7bc492a54616047913f0ccaa719a242d21c121fe65b7e11dc029367eacbb353"},"schema_version":"1.0"},"canonical_sha256":"d79621299b425cf9d0e79eaba59c3e1b1bcedfe1069a9f4af9044c15fb2f1174","source":{"kind":"arxiv","id":"1411.2516","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2516","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2516v3","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2516","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"26LCCKM3IJOP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26LCCKM3IJOPTUHH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26LCCKM3","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:26LCCKM3IJOPTUHHT2V2LHB6DM","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-10T17:50:06Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"7ad8b8ddc3abda33e104513fe2b1e0d8d1df06e2ace0861572dbada8c0149771","abstract_canon_sha256":"b7bc492a54616047913f0ccaa719a242d21c121fe65b7e11dc029367eacbb353"},"schema_version":"1.0"},"canonical_sha256":"d79621299b425cf9d0e79eaba59c3e1b1bcedfe1069a9f4af9044c15fb2f1174","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:11.161094Z","signature_b64":"t286cHCgb14iJ0HjPyyWnNwSwJ4T6rOJNVB9JOFfkEInyIO31rNdjQiBYiarsicytNusETQ4uA6o7BIiDJtsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79621299b425cf9d0e79eaba59c3e1b1bcedfe1069a9f4af9044c15fb2f1174","last_reissued_at":"2026-05-18T02:12:11.160369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:11.160369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2516","source_version":3,"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-18T02:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeIcf6DyaQ5CoKqQkqexXCJ7UTFOho97gwA/to0zGg4Hk9Sy6K7F+Ua+/LxnhXom8Y5BOsk19JWbQYhMZi7nDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:07:22.219548Z"},"content_sha256":"e281a3f23e1984ad948579dce2165f527e7d9581aae2b4d12969daf7a0ca6cf1","schema_version":"1.0","event_id":"sha256:e281a3f23e1984ad948579dce2165f527e7d9581aae2b4d12969daf7a0ca6cf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:26LCCKM3IJOPTUHHT2V2LHB6DM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Answering Conjunctive Queries over $\\mathcal{EL}$ Knowledge Bases with Transitive and Reflexive Roles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Boris Motik, Giorgio Stefanoni","submitted_at":"2014-11-10T17:50:06Z","abstract_excerpt":"Answering conjunctive queries (CQs) over $\\mathcal{EL}$ knowledge bases (KBs) with complex role inclusions is PSPACE-hard and in PSPACE in certain cases; however, if complex role inclusions are restricted to role transitivity, the tight upper complexity bound has so far been unknown. Furthermore, the existing algorithms cannot handle reflexive roles, and they are not practicable. Finally, the problem is tractable for acyclic CQs and $\\mathcal{ELH}$, and NP-complete for unrestricted CQs and $\\mathcal{ELHO}$ KBs. In this paper we complete the complexity landscape of CQ answering for several impo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2516","kind":"arxiv","version":3},"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-18T02:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCJfXVtx+dHU2xIkURsktEYoWfhlWbQtSIStWDSEo8sKgYf/ovx+2Ec7tpwTKhn3QzBYGJbEwkYRngqPZVR+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:07:22.219900Z"},"content_sha256":"79954a42ddcaa8f08f372d407ed3213631041114b8d6e920db558c1e02e8cc5e","schema_version":"1.0","event_id":"sha256:79954a42ddcaa8f08f372d407ed3213631041114b8d6e920db558c1e02e8cc5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/bundle.json","state_url":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/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-28T21:07:22Z","links":{"resolver":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM","bundle":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/bundle.json","state":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:26LCCKM3IJOPTUHHT2V2LHB6DM","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":"b7bc492a54616047913f0ccaa719a242d21c121fe65b7e11dc029367eacbb353","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-10T17:50:06Z","title_canon_sha256":"7ad8b8ddc3abda33e104513fe2b1e0d8d1df06e2ace0861572dbada8c0149771"},"schema_version":"1.0","source":{"id":"1411.2516","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2516","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2516v3","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2516","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"26LCCKM3IJOP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26LCCKM3IJOPTUHH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26LCCKM3","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:79954a42ddcaa8f08f372d407ed3213631041114b8d6e920db558c1e02e8cc5e","target":"graph","created_at":"2026-05-18T02:12:11Z","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":"Answering conjunctive queries (CQs) over $\\mathcal{EL}$ knowledge bases (KBs) with complex role inclusions is PSPACE-hard and in PSPACE in certain cases; however, if complex role inclusions are restricted to role transitivity, the tight upper complexity bound has so far been unknown. Furthermore, the existing algorithms cannot handle reflexive roles, and they are not practicable. Finally, the problem is tractable for acyclic CQs and $\\mathcal{ELH}$, and NP-complete for unrestricted CQs and $\\mathcal{ELHO}$ KBs. In this paper we complete the complexity landscape of CQ answering for several impo","authors_text":"Boris Motik, Giorgio Stefanoni","cross_cats":["cs.DB","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-10T17:50:06Z","title":"Answering Conjunctive Queries over $\\mathcal{EL}$ Knowledge Bases with Transitive and Reflexive Roles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2516","kind":"arxiv","version":3},"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:e281a3f23e1984ad948579dce2165f527e7d9581aae2b4d12969daf7a0ca6cf1","target":"record","created_at":"2026-05-18T02:12:11Z","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":"b7bc492a54616047913f0ccaa719a242d21c121fe65b7e11dc029367eacbb353","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-10T17:50:06Z","title_canon_sha256":"7ad8b8ddc3abda33e104513fe2b1e0d8d1df06e2ace0861572dbada8c0149771"},"schema_version":"1.0","source":{"id":"1411.2516","kind":"arxiv","version":3}},"canonical_sha256":"d79621299b425cf9d0e79eaba59c3e1b1bcedfe1069a9f4af9044c15fb2f1174","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d79621299b425cf9d0e79eaba59c3e1b1bcedfe1069a9f4af9044c15fb2f1174","first_computed_at":"2026-05-18T02:12:11.160369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:11.160369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t286cHCgb14iJ0HjPyyWnNwSwJ4T6rOJNVB9JOFfkEInyIO31rNdjQiBYiarsicytNusETQ4uA6o7BIiDJtsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:11.161094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2516","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e281a3f23e1984ad948579dce2165f527e7d9581aae2b4d12969daf7a0ca6cf1","sha256:79954a42ddcaa8f08f372d407ed3213631041114b8d6e920db558c1e02e8cc5e"],"state_sha256":"cf76926b2a02b6eaef96bde8f2a815a88ae7e827a3af6eda3615b8f7a4fdf89f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wy3CfhqlgdPCSBPMovsxqj6Podf/Muf0zI0VIaMnOwy83Z7nmQeBc65woBsllHLQGXG7DbvvRJFH7y33RZYqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T21:07:22.221906Z","bundle_sha256":"de75823a9a048326dc191e1ce86b3a9ace88bc86b23c3a76d8d244af1b7f75b6"}}