{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YJ73HHNHE3KEEZD7WXFWQ34EIT","short_pith_number":"pith:YJ73HHNH","canonical_record":{"source":{"id":"1406.7801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-30T16:30:06Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"d71df305d9f1f761e0db238d927a1ac2f8b70e8c6ebd7a60c272803f57fb8c1d","abstract_canon_sha256":"6e2ef28ad7b46f1ce4a3acca8a281bd0870356136fc4b893d8d28c63a50b7b08"},"schema_version":"1.0"},"canonical_sha256":"c27fb39da726d442647fb5cb686f8444deebd2009f32013b95db09dce38d4467","source":{"kind":"arxiv","id":"1406.7801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7801","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7801v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7801","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"YJ73HHNHE3KE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YJ73HHNHE3KEEZD7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YJ73HHNH","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YJ73HHNHE3KEEZD7WXFWQ34EIT","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-30T16:30:06Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"d71df305d9f1f761e0db238d927a1ac2f8b70e8c6ebd7a60c272803f57fb8c1d","abstract_canon_sha256":"6e2ef28ad7b46f1ce4a3acca8a281bd0870356136fc4b893d8d28c63a50b7b08"},"schema_version":"1.0"},"canonical_sha256":"c27fb39da726d442647fb5cb686f8444deebd2009f32013b95db09dce38d4467","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:44.130909Z","signature_b64":"hQYQlsCbGIupyXvdOQ0hwNsy68FpBouYX/S3HCyym5mAPbbEEzITUMJlRVRh6dUS+8zjWqCGUUcylAfEslGTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c27fb39da726d442647fb5cb686f8444deebd2009f32013b95db09dce38d4467","last_reissued_at":"2026-05-18T02:48:44.130148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:44.130148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7801","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:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5HnkFOTSqz6s9wNg44niQUu+iXGauUxSni3E5HNAc2z000srPFk0rzRy9M0Yv0/COWQpuuftZ85WH/3JglTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:16:03.378762Z"},"content_sha256":"836db1eb421e17afa320ccc3f7840f9a71fe54bc7abaa62b1d207cd65f1db999","schema_version":"1.0","event_id":"sha256:836db1eb421e17afa320ccc3f7840f9a71fe54bc7abaa62b1d207cd65f1db999"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YJ73HHNHE3KEEZD7WXFWQ34EIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query Containment for Highly Expressive Datalog Fragments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.DB","authors_text":"Markus Kr\\\"otzsch, Pierre Bourhis, Sebastian Rudolph","submitted_at":"2014-06-30T16:30:06Z","abstract_excerpt":"The containment problem of Datalog queries is well known to be undecidable. There are, however, several Datalog fragments for which containment is known to be decidable, most notably monadic Datalog and several \"regular\" query languages on graphs. Monadically Defined Queries (MQs) have been introduced recently as a joint generalization of these query languages. In this paper, we study a wide range of Datalog fragments with decidable query containment and determine exact complexity results for this problem. We generalize MQs to (Frontier-)Guarded Queries (GQs), and show that the containment pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7801","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:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRev9cX8OnoUPaQ1VB3c1Z/owkGZ6mLsUlnyIO4ZAPyujN2JSk+0nJBxjc62JKbLHozL35dJxMeHovGKYQLcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:16:03.379443Z"},"content_sha256":"77c5cf5e52e56ecd7d6cd44916ca9d59defe883d141ad8d5093606b0df005fc6","schema_version":"1.0","event_id":"sha256:77c5cf5e52e56ecd7d6cd44916ca9d59defe883d141ad8d5093606b0df005fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJ73HHNHE3KEEZD7WXFWQ34EIT/bundle.json","state_url":"https://pith.science/pith/YJ73HHNHE3KEEZD7WXFWQ34EIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJ73HHNHE3KEEZD7WXFWQ34EIT/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-27T05:16:03Z","links":{"resolver":"https://pith.science/pith/YJ73HHNHE3KEEZD7WXFWQ34EIT","bundle":"https://pith.science/pith/YJ73HHNHE3KEEZD7WXFWQ34EIT/bundle.json","state":"https://pith.science/pith/YJ73HHNHE3KEEZD7WXFWQ34EIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJ73HHNHE3KEEZD7WXFWQ34EIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YJ73HHNHE3KEEZD7WXFWQ34EIT","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":"6e2ef28ad7b46f1ce4a3acca8a281bd0870356136fc4b893d8d28c63a50b7b08","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-30T16:30:06Z","title_canon_sha256":"d71df305d9f1f761e0db238d927a1ac2f8b70e8c6ebd7a60c272803f57fb8c1d"},"schema_version":"1.0","source":{"id":"1406.7801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7801","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7801v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7801","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"YJ73HHNHE3KE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YJ73HHNHE3KEEZD7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YJ73HHNH","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:77c5cf5e52e56ecd7d6cd44916ca9d59defe883d141ad8d5093606b0df005fc6","target":"graph","created_at":"2026-05-18T02:48:44Z","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":"The containment problem of Datalog queries is well known to be undecidable. There are, however, several Datalog fragments for which containment is known to be decidable, most notably monadic Datalog and several \"regular\" query languages on graphs. Monadically Defined Queries (MQs) have been introduced recently as a joint generalization of these query languages. In this paper, we study a wide range of Datalog fragments with decidable query containment and determine exact complexity results for this problem. We generalize MQs to (Frontier-)Guarded Queries (GQs), and show that the containment pro","authors_text":"Markus Kr\\\"otzsch, Pierre Bourhis, Sebastian Rudolph","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-30T16:30:06Z","title":"Query Containment for Highly Expressive Datalog Fragments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7801","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:836db1eb421e17afa320ccc3f7840f9a71fe54bc7abaa62b1d207cd65f1db999","target":"record","created_at":"2026-05-18T02:48:44Z","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":"6e2ef28ad7b46f1ce4a3acca8a281bd0870356136fc4b893d8d28c63a50b7b08","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-30T16:30:06Z","title_canon_sha256":"d71df305d9f1f761e0db238d927a1ac2f8b70e8c6ebd7a60c272803f57fb8c1d"},"schema_version":"1.0","source":{"id":"1406.7801","kind":"arxiv","version":1}},"canonical_sha256":"c27fb39da726d442647fb5cb686f8444deebd2009f32013b95db09dce38d4467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c27fb39da726d442647fb5cb686f8444deebd2009f32013b95db09dce38d4467","first_computed_at":"2026-05-18T02:48:44.130148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:44.130148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hQYQlsCbGIupyXvdOQ0hwNsy68FpBouYX/S3HCyym5mAPbbEEzITUMJlRVRh6dUS+8zjWqCGUUcylAfEslGTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:44.130909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:836db1eb421e17afa320ccc3f7840f9a71fe54bc7abaa62b1d207cd65f1db999","sha256:77c5cf5e52e56ecd7d6cd44916ca9d59defe883d141ad8d5093606b0df005fc6"],"state_sha256":"66a3b75b0dfb9546228309dd0ffb5b4405120ef041cec98ab4347f594200c121"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKHMhDmUdXtOSGX0oy3NlV3t3RF+aU1iuAp2xFrGQfAcPAmKWP9CG7051RIsWrkIsFNEBO6i0rxkUiKeY7k7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:16:03.383862Z","bundle_sha256":"4c6ad78ecd546bc8fff24abc7fed2353f5a6b896df9d9f734dd67ef5027b078a"}}