{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VQWCH7IL24XWBZM4FQDDQUOBGM","short_pith_number":"pith:VQWCH7IL","schema_version":"1.0","canonical_sha256":"ac2c23fd0bd72f60e59c2c063851c1330fac25bfd0c94c901cdbe68e5aa6f1f9","source":{"kind":"arxiv","id":"2008.00896","version":3},"attestation_state":"computed","paper":{"title":"A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DB","authors_text":"Batya Kenig, Dan Suciu","submitted_at":"2020-08-03T14:24:08Z","abstract_excerpt":"We study the $generalized~model~counting~problem$, defined as follows: given a database, and a set of deterministic tuples, count the number of subsets of the database that include all deterministic tuples and satisfy the query. This problem is computationally equivalent to the evaluation of the query over a tuple-independent probabilistic database where all tuples have probabilities in $\\{0,\\frac{1}{2},1\\}$. Previous work has established a dichotomy for Unions of Conjunctive Queries (UCQ) when the probabilities are arbitrary rational numbers, showing that, for each query, its complexity is ei"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2008.00896","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-08-03T14:24:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c8752c374eae28e741d38a0d70ba2df6b5062681e6285b21e1701d0544a4a1f0","abstract_canon_sha256":"e494fa85a176dc2a56daef2f1310a62f6f73e4f98c31893efe20c786e3fa20cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:47.713894Z","signature_b64":"+qmPn1SW6+kaDzxUP9gP9tVx/cdyLhxJ8NtOc/jGCbdXbLEZI57ZKobzr9pXRjfLfZe2TjKjO5GvDWBhKkIDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac2c23fd0bd72f60e59c2c063851c1330fac25bfd0c94c901cdbe68e5aa6f1f9","last_reissued_at":"2026-07-05T02:41:47.713374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:47.713374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DB","authors_text":"Batya Kenig, Dan Suciu","submitted_at":"2020-08-03T14:24:08Z","abstract_excerpt":"We study the $generalized~model~counting~problem$, defined as follows: given a database, and a set of deterministic tuples, count the number of subsets of the database that include all deterministic tuples and satisfy the query. This problem is computationally equivalent to the evaluation of the query over a tuple-independent probabilistic database where all tuples have probabilities in $\\{0,\\frac{1}{2},1\\}$. Previous work has established a dichotomy for Unions of Conjunctive Queries (UCQ) when the probabilities are arbitrary rational numbers, showing that, for each query, its complexity is ei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00896","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.00896/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2008.00896","created_at":"2026-07-05T02:41:47.713439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.00896v3","created_at":"2026-07-05T02:41:47.713439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00896","created_at":"2026-07-05T02:41:47.713439+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQWCH7IL24XW","created_at":"2026-07-05T02:41:47.713439+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQWCH7IL24XWBZM4","created_at":"2026-07-05T02:41:47.713439+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQWCH7IL","created_at":"2026-07-05T02:41:47.713439+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM","json":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM.json","graph_json":"https://pith.science/api/pith-number/VQWCH7IL24XWBZM4FQDDQUOBGM/graph.json","events_json":"https://pith.science/api/pith-number/VQWCH7IL24XWBZM4FQDDQUOBGM/events.json","paper":"https://pith.science/paper/VQWCH7IL"},"agent_actions":{"view_html":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM","download_json":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM.json","view_paper":"https://pith.science/paper/VQWCH7IL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.00896&json=true","fetch_graph":"https://pith.science/api/pith-number/VQWCH7IL24XWBZM4FQDDQUOBGM/graph.json","fetch_events":"https://pith.science/api/pith-number/VQWCH7IL24XWBZM4FQDDQUOBGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM/action/storage_attestation","attest_author":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM/action/author_attestation","sign_citation":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM/action/citation_signature","submit_replication":"https://pith.science/pith/VQWCH7IL24XWBZM4FQDDQUOBGM/action/replication_record"}},"created_at":"2026-07-05T02:41:47.713439+00:00","updated_at":"2026-07-05T02:41:47.713439+00:00"}