{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D47MAKI6PAI6BEAVNLKYNEBI6T","short_pith_number":"pith:D47MAKI6","canonical_record":{"source":{"id":"1812.04329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-11T11:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"e71fff5d2a82b17104ecd4a46d1815a4aa42bd059ab066ca43ce766da3b12c38","abstract_canon_sha256":"a395b317f9ed054cff0cedcb05f4f582ed9f16e449a0c2770f13cb5bed38a831"},"schema_version":"1.0"},"canonical_sha256":"1f3ec0291e7811e090156ad5869028f4f5ba6004dfdb408b300c59fd15578e68","source":{"kind":"arxiv","id":"1812.04329","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04329","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04329v2","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04329","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"D47MAKI6PAI6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D47MAKI6PAI6BEAV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D47MAKI6","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D47MAKI6PAI6BEAVNLKYNEBI6T","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-11T11:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"e71fff5d2a82b17104ecd4a46d1815a4aa42bd059ab066ca43ce766da3b12c38","abstract_canon_sha256":"a395b317f9ed054cff0cedcb05f4f582ed9f16e449a0c2770f13cb5bed38a831"},"schema_version":"1.0"},"canonical_sha256":"1f3ec0291e7811e090156ad5869028f4f5ba6004dfdb408b300c59fd15578e68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:20.501904Z","signature_b64":"YgyE96VujXE8a4Ps0pI/5Xv/jNP4jS8mbQanhqXkofO6rJEFID7xZokIXrY5YhpsuZRUJzHHXp8/0TYDI0jxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f3ec0291e7811e090156ad5869028f4f5ba6004dfdb408b300c59fd15578e68","last_reissued_at":"2026-05-17T23:58:20.501393Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:20.501393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04329","source_version":2,"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-17T23:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbQUwylAwQ/JPFrKcpeWfhhhT897iIOr3y2PoOPxIKAJNZLAIdrflg4PiBxU4nViklhXHh328P/iL8CCZrGgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:00:53.396075Z"},"content_sha256":"5e1f1961a18ba0ad3a7b32e12f354132d058cac3b00fd591765aa1fe328e6c33","schema_version":"1.0","event_id":"sha256:5e1f1961a18ba0ad3a7b32e12f354132d058cac3b00fd591765aa1fe328e6c33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D47MAKI6PAI6BEAVNLKYNEBI6T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Georg Gottlob, Matthias Lanzinger, Reinhard Pichler","submitted_at":"2018-12-11T11:01:42Z","abstract_excerpt":"Answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs) are arguably among the most fundamental tasks in Computer Science. They are classical NP-complete problems. Consequently, the search for tractable fragments of these problems has received a lot of research interest over the decades. This research has traditionally progressed along three orthogonal threads. a) Reformulating queries into simpler, equivalent, queries (semantic optimization) b) Bounding answer sizes based on structural properties of the query c) Decomposing the query in such a way that global c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04329","kind":"arxiv","version":2},"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-17T23:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEoIRrK9vPZ2lFeVmYBkLdaaEcHuHH+vU6iayu1MHZCPzX6R7mnLpfwA3LOn52NGBJTZGYQ4+FwBpzIfIE3TBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:00:53.396452Z"},"content_sha256":"22e346ea7f70e433164aace3163e24f39e6c9fe7198074bc00e733892164a624","schema_version":"1.0","event_id":"sha256:22e346ea7f70e433164aace3163e24f39e6c9fe7198074bc00e733892164a624"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D47MAKI6PAI6BEAVNLKYNEBI6T/bundle.json","state_url":"https://pith.science/pith/D47MAKI6PAI6BEAVNLKYNEBI6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D47MAKI6PAI6BEAVNLKYNEBI6T/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-01T14:00:53Z","links":{"resolver":"https://pith.science/pith/D47MAKI6PAI6BEAVNLKYNEBI6T","bundle":"https://pith.science/pith/D47MAKI6PAI6BEAVNLKYNEBI6T/bundle.json","state":"https://pith.science/pith/D47MAKI6PAI6BEAVNLKYNEBI6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D47MAKI6PAI6BEAVNLKYNEBI6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D47MAKI6PAI6BEAVNLKYNEBI6T","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":"a395b317f9ed054cff0cedcb05f4f582ed9f16e449a0c2770f13cb5bed38a831","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-11T11:01:42Z","title_canon_sha256":"e71fff5d2a82b17104ecd4a46d1815a4aa42bd059ab066ca43ce766da3b12c38"},"schema_version":"1.0","source":{"id":"1812.04329","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04329","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04329v2","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04329","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"D47MAKI6PAI6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D47MAKI6PAI6BEAV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D47MAKI6","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:22e346ea7f70e433164aace3163e24f39e6c9fe7198074bc00e733892164a624","target":"graph","created_at":"2026-05-17T23:58:20Z","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) and solving Constraint Satisfaction Problems (CSPs) are arguably among the most fundamental tasks in Computer Science. They are classical NP-complete problems. Consequently, the search for tractable fragments of these problems has received a lot of research interest over the decades. This research has traditionally progressed along three orthogonal threads. a) Reformulating queries into simpler, equivalent, queries (semantic optimization) b) Bounding answer sizes based on structural properties of the query c) Decomposing the query in such a way that global c","authors_text":"Georg Gottlob, Matthias Lanzinger, Reinhard Pichler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-11T11:01:42Z","title":"Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04329","kind":"arxiv","version":2},"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:5e1f1961a18ba0ad3a7b32e12f354132d058cac3b00fd591765aa1fe328e6c33","target":"record","created_at":"2026-05-17T23:58:20Z","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":"a395b317f9ed054cff0cedcb05f4f582ed9f16e449a0c2770f13cb5bed38a831","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-11T11:01:42Z","title_canon_sha256":"e71fff5d2a82b17104ecd4a46d1815a4aa42bd059ab066ca43ce766da3b12c38"},"schema_version":"1.0","source":{"id":"1812.04329","kind":"arxiv","version":2}},"canonical_sha256":"1f3ec0291e7811e090156ad5869028f4f5ba6004dfdb408b300c59fd15578e68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f3ec0291e7811e090156ad5869028f4f5ba6004dfdb408b300c59fd15578e68","first_computed_at":"2026-05-17T23:58:20.501393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:20.501393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YgyE96VujXE8a4Ps0pI/5Xv/jNP4jS8mbQanhqXkofO6rJEFID7xZokIXrY5YhpsuZRUJzHHXp8/0TYDI0jxDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:20.501904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04329","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e1f1961a18ba0ad3a7b32e12f354132d058cac3b00fd591765aa1fe328e6c33","sha256:22e346ea7f70e433164aace3163e24f39e6c9fe7198074bc00e733892164a624"],"state_sha256":"b01069e3c49987eb250d164b1a2a2548876452a10556c2c39d27c326efb164a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQGhtMgrinW1XRlr0Cmggx6+lCNpGg/cm15hyVuV6aPQIgrhQrAdjidyxnkXp3YkAet3tgsVs0DUhCG1xySyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:00:53.398401Z","bundle_sha256":"33a457c5b2f023f2636c3418ee99d47a96f344feda2d56b639de4072799177cc"}}