{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XZNADNJ4PUVMJTOKGJH33EUOPQ","short_pith_number":"pith:XZNADNJ4","schema_version":"1.0","canonical_sha256":"be5a01b53c7d2ac4cdca324fbd928e7c0ea4eaac44cc5bc9a76f2e682eb260db","source":{"kind":"arxiv","id":"1904.00934","version":1},"attestation_state":"computed","paper":{"title":"A More General Theory of Static Approximations for Conjunctive Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LO"],"primary_cat":"cs.DB","authors_text":"Miguel Romero, Pablo Barcel\\'o, Thomas Zeume","submitted_at":"2019-04-01T16:12:04Z","abstract_excerpt":"Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While underapproximations (i.e., approximations that return correct answers only) are well-understood, the dual notion of overapproximations (i.e, approximations that return complete - but not necessarily sound - answers), and also a more general notion of approximation based on the symmetric difference of query results, are almost unexplored. In fact, the decidability of "},"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":"1904.00934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-04-01T16:12:04Z","cross_cats_sorted":["cs.DM","cs.LO"],"title_canon_sha256":"5487f244664429d4671119f6f1f46e01516452af6e898bcda689a61587dc3464","abstract_canon_sha256":"b5875223aac5442db1792ac3dd9626c967519680efe2eb580e8f65c67eb11f42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:44.831613Z","signature_b64":"LfUTu2cPtZXi3TyJAELYylOA7dqjyJwM152YrIwqHo6vhoDQ5bPENIEiwroxCjBjm+dI1ol0affk1HwmCK8yCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be5a01b53c7d2ac4cdca324fbd928e7c0ea4eaac44cc5bc9a76f2e682eb260db","last_reissued_at":"2026-05-17T23:49:44.831081Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:44.831081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A More General Theory of Static Approximations for Conjunctive Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LO"],"primary_cat":"cs.DB","authors_text":"Miguel Romero, Pablo Barcel\\'o, Thomas Zeume","submitted_at":"2019-04-01T16:12:04Z","abstract_excerpt":"Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While underapproximations (i.e., approximations that return correct answers only) are well-understood, the dual notion of overapproximations (i.e, approximations that return complete - but not necessarily sound - answers), and also a more general notion of approximation based on the symmetric difference of query results, are almost unexplored. In fact, the decidability of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00934","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.00934","created_at":"2026-05-17T23:49:44.831166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00934v1","created_at":"2026-05-17T23:49:44.831166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00934","created_at":"2026-05-17T23:49:44.831166+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZNADNJ4PUVM","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZNADNJ4PUVMJTOK","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZNADNJ4","created_at":"2026-05-18T12:33:33.725879+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/XZNADNJ4PUVMJTOKGJH33EUOPQ","json":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ.json","graph_json":"https://pith.science/api/pith-number/XZNADNJ4PUVMJTOKGJH33EUOPQ/graph.json","events_json":"https://pith.science/api/pith-number/XZNADNJ4PUVMJTOKGJH33EUOPQ/events.json","paper":"https://pith.science/paper/XZNADNJ4"},"agent_actions":{"view_html":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ","download_json":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ.json","view_paper":"https://pith.science/paper/XZNADNJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00934&json=true","fetch_graph":"https://pith.science/api/pith-number/XZNADNJ4PUVMJTOKGJH33EUOPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XZNADNJ4PUVMJTOKGJH33EUOPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ/action/storage_attestation","attest_author":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ/action/author_attestation","sign_citation":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ/action/citation_signature","submit_replication":"https://pith.science/pith/XZNADNJ4PUVMJTOKGJH33EUOPQ/action/replication_record"}},"created_at":"2026-05-17T23:49:44.831166+00:00","updated_at":"2026-05-17T23:49:44.831166+00:00"}