{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZE4JHIUAOM27FPK5OWIK4ONAD3","short_pith_number":"pith:ZE4JHIUA","canonical_record":{"source":{"id":"1404.3141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-11T15:47:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c597bbdc53b5478093daccc5722b46c5e6449fd3ac79af845685901a7482ac81","abstract_canon_sha256":"3058f801ff983887bc156c28302058a891a4049f2d03620badc3e63e9268062e"},"schema_version":"1.0"},"canonical_sha256":"c93893a2807335f2bd5d7590ae39a01ec0ce78e4e552d1ebd2036de4ac90534b","source":{"kind":"arxiv","id":"1404.3141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3141","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3141v1","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3141","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZE4JHIUAOM27","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZE4JHIUAOM27FPK5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZE4JHIUA","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZE4JHIUAOM27FPK5OWIK4ONAD3","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-11T15:47:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c597bbdc53b5478093daccc5722b46c5e6449fd3ac79af845685901a7482ac81","abstract_canon_sha256":"3058f801ff983887bc156c28302058a891a4049f2d03620badc3e63e9268062e"},"schema_version":"1.0"},"canonical_sha256":"c93893a2807335f2bd5d7590ae39a01ec0ce78e4e552d1ebd2036de4ac90534b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:22.120809Z","signature_b64":"EehwXSFOXHDpFsNuU8uTp2UuX/b8K4g0wCpumPgwW0BxvWYBc2JR9ihAOu3ong0yv6JJX5/ovhUM/pbZy4DiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c93893a2807335f2bd5d7590ae39a01ec0ce78e4e552d1ebd2036de4ac90534b","last_reissued_at":"2026-05-18T02:54:22.120400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:22.120400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3141","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-18T02:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INC0ql/HiGOANcpF9Hek/KEVczTX5EiaFn8Wv3Bh2r1AFlLEQsEEhJw4XN6JTl/RHxfIsbP496iRF2JUONAvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:57:41.894269Z"},"content_sha256":"5fcd01e69f87471145896f607f89895d951610a2191984dc560d03af2073b482","schema_version":"1.0","event_id":"sha256:5fcd01e69f87471145896f607f89895d951610a2191984dc560d03af2073b482"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZE4JHIUAOM27FPK5OWIK4ONAD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Bernardo Cuenca Grau, Mark Kaminski, Yavor Nenov","submitted_at":"2014-04-11T15:47:40Z","abstract_excerpt":"We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose weakly linear disjunctive datalog---a novel rule-based KR language that extends both datalog and linear disjunctive datalog and for which reasoning is tractable in data complexity. We then explore applications of weakly linear programs to ontology reasoning and propose a tractable extension of OWL "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3141","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-18T02:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZ+Uf3cL1CXiziC7V5f6HmmCeLojDwfURJkqD6V9ZzpFJ8B2R71hbxCpnOImnv4BZZONpHbi9e+bA37K+U3pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:57:41.894641Z"},"content_sha256":"62937c28748aced92baae45dc2602ebe53bab565cd38c1820b8523a8fa9a5179","schema_version":"1.0","event_id":"sha256:62937c28748aced92baae45dc2602ebe53bab565cd38c1820b8523a8fa9a5179"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZE4JHIUAOM27FPK5OWIK4ONAD3/bundle.json","state_url":"https://pith.science/pith/ZE4JHIUAOM27FPK5OWIK4ONAD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZE4JHIUAOM27FPK5OWIK4ONAD3/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-28T20:57:41Z","links":{"resolver":"https://pith.science/pith/ZE4JHIUAOM27FPK5OWIK4ONAD3","bundle":"https://pith.science/pith/ZE4JHIUAOM27FPK5OWIK4ONAD3/bundle.json","state":"https://pith.science/pith/ZE4JHIUAOM27FPK5OWIK4ONAD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZE4JHIUAOM27FPK5OWIK4ONAD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZE4JHIUAOM27FPK5OWIK4ONAD3","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":"3058f801ff983887bc156c28302058a891a4049f2d03620badc3e63e9268062e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-11T15:47:40Z","title_canon_sha256":"c597bbdc53b5478093daccc5722b46c5e6449fd3ac79af845685901a7482ac81"},"schema_version":"1.0","source":{"id":"1404.3141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3141","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3141v1","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3141","created_at":"2026-05-18T02:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZE4JHIUAOM27","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZE4JHIUAOM27FPK5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZE4JHIUA","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:62937c28748aced92baae45dc2602ebe53bab565cd38c1820b8523a8fa9a5179","target":"graph","created_at":"2026-05-18T02:54:22Z","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 study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose weakly linear disjunctive datalog---a novel rule-based KR language that extends both datalog and linear disjunctive datalog and for which reasoning is tractable in data complexity. We then explore applications of weakly linear programs to ontology reasoning and propose a tractable extension of OWL ","authors_text":"Bernardo Cuenca Grau, Mark Kaminski, Yavor Nenov","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-11T15:47:40Z","title":"Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3141","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:5fcd01e69f87471145896f607f89895d951610a2191984dc560d03af2073b482","target":"record","created_at":"2026-05-18T02:54:22Z","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":"3058f801ff983887bc156c28302058a891a4049f2d03620badc3e63e9268062e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-11T15:47:40Z","title_canon_sha256":"c597bbdc53b5478093daccc5722b46c5e6449fd3ac79af845685901a7482ac81"},"schema_version":"1.0","source":{"id":"1404.3141","kind":"arxiv","version":1}},"canonical_sha256":"c93893a2807335f2bd5d7590ae39a01ec0ce78e4e552d1ebd2036de4ac90534b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c93893a2807335f2bd5d7590ae39a01ec0ce78e4e552d1ebd2036de4ac90534b","first_computed_at":"2026-05-18T02:54:22.120400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:22.120400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EehwXSFOXHDpFsNuU8uTp2UuX/b8K4g0wCpumPgwW0BxvWYBc2JR9ihAOu3ong0yv6JJX5/ovhUM/pbZy4DiDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:22.120809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fcd01e69f87471145896f607f89895d951610a2191984dc560d03af2073b482","sha256:62937c28748aced92baae45dc2602ebe53bab565cd38c1820b8523a8fa9a5179"],"state_sha256":"2743e7e38ee4d9ba452ca03e90ced5e727fb1e9e8fc2ff767bf5c3a65ee8637b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKpOqMxWsCtazgaE96h3fubioCNJrDwZeaazrgfR/4qUTD+DQkPkp5S91Ngh0dB7Dn6s3nxnlaVbz7kzJ23iDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:57:41.896922Z","bundle_sha256":"c801c0ce96c33d901ca684992be0f81ab6f2d3e8e892efb13ce6421a37b8324e"}}