{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CVA7YZIABRVXLIAYUWMBJE72Q7","short_pith_number":"pith:CVA7YZIA","schema_version":"1.0","canonical_sha256":"1541fc65000c6b75a018a5981493fa87ca0c3ace98844cd57162e4ab821f600f","source":{"kind":"arxiv","id":"2005.10029","version":3},"attestation_state":"computed","paper":{"title":"When is Approximate Counting for Conjunctive Queries Tractable?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristian Riveros, Luis Alberto Croquevielle, Marcelo Arenas, Rajesh Jayaram","submitted_at":"2020-05-20T13:21:46Z","abstract_excerpt":"Conjunctive queries are one of the most common class of queries used in database systems, and the best studied in the literature. A seminal result of Grohe, Schwentick, and Segoufin (STOC 2001) demonstrates that for every class $G$ of graphs, the evaluation of all conjunctive queries whose underlying graph is in $G$ is tractable if, and only if, $G$ has bounded treewidth. In this work, we extend this characterization to the counting problem for conjunctive queries. Specifically, for every class $C$ of conjunctive queries with bounded treewidth, we introduce the first fully polynomial-time rand"},"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":"2005.10029","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-20T13:21:46Z","cross_cats_sorted":[],"title_canon_sha256":"add27e442d4faa3a3046dba9f07ba3f460d075b19a790ada85990650b6a335e6","abstract_canon_sha256":"256a08d63f030f208a70f8a85aa21069502e9da5331ca13a26ef4d18abb57392"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:08.699664Z","signature_b64":"SIhmMxmJQEyUMJZl0dl4KvyPzCXzo7kOn3iSH+HOaZQ+etwIIZ8bXnueFPx0rXGkvGm6tAYmCf2wylDC8P2VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1541fc65000c6b75a018a5981493fa87ca0c3ace98844cd57162e4ab821f600f","last_reissued_at":"2026-07-05T01:53:08.699259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:08.699259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When is Approximate Counting for Conjunctive Queries Tractable?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristian Riveros, Luis Alberto Croquevielle, Marcelo Arenas, Rajesh Jayaram","submitted_at":"2020-05-20T13:21:46Z","abstract_excerpt":"Conjunctive queries are one of the most common class of queries used in database systems, and the best studied in the literature. A seminal result of Grohe, Schwentick, and Segoufin (STOC 2001) demonstrates that for every class $G$ of graphs, the evaluation of all conjunctive queries whose underlying graph is in $G$ is tractable if, and only if, $G$ has bounded treewidth. In this work, we extend this characterization to the counting problem for conjunctive queries. Specifically, for every class $C$ of conjunctive queries with bounded treewidth, we introduce the first fully polynomial-time rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10029","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/2005.10029/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":"2005.10029","created_at":"2026-07-05T01:53:08.699323+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.10029v3","created_at":"2026-07-05T01:53:08.699323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10029","created_at":"2026-07-05T01:53:08.699323+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVA7YZIABRVX","created_at":"2026-07-05T01:53:08.699323+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVA7YZIABRVXLIAY","created_at":"2026-07-05T01:53:08.699323+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVA7YZIA","created_at":"2026-07-05T01:53:08.699323+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/CVA7YZIABRVXLIAYUWMBJE72Q7","json":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7.json","graph_json":"https://pith.science/api/pith-number/CVA7YZIABRVXLIAYUWMBJE72Q7/graph.json","events_json":"https://pith.science/api/pith-number/CVA7YZIABRVXLIAYUWMBJE72Q7/events.json","paper":"https://pith.science/paper/CVA7YZIA"},"agent_actions":{"view_html":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7","download_json":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7.json","view_paper":"https://pith.science/paper/CVA7YZIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.10029&json=true","fetch_graph":"https://pith.science/api/pith-number/CVA7YZIABRVXLIAYUWMBJE72Q7/graph.json","fetch_events":"https://pith.science/api/pith-number/CVA7YZIABRVXLIAYUWMBJE72Q7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7/action/storage_attestation","attest_author":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7/action/author_attestation","sign_citation":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7/action/citation_signature","submit_replication":"https://pith.science/pith/CVA7YZIABRVXLIAYUWMBJE72Q7/action/replication_record"}},"created_at":"2026-07-05T01:53:08.699323+00:00","updated_at":"2026-07-05T01:53:08.699323+00:00"}