{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q7LFKCOB7RB23JVTGJSYC346LV","short_pith_number":"pith:Q7LFKCOB","schema_version":"1.0","canonical_sha256":"87d65509c1fc43ada6b33265816f9e5d4e295dc79c208fe572b39e0420217d13","source":{"kind":"arxiv","id":"1712.07445","version":5},"attestation_state":"computed","paper":{"title":"Boolean Tensor Decomposition for Conjunctive Queries with Negation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DB","authors_text":"Dan Olteanu, Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis","submitted_at":"2017-12-20T12:30:59Z","abstract_excerpt":"We propose an algorithm for answering conjunctive queries with negation, where the negated relations have bounded degree. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is expressed in terms of the fractional hypertree width and the submodular width. The query complexity depends on the structure of the negated subquery; in general it is exponential in the number of join variables occurring in negated relations yet it becomes polynomial for several classes of queries.\n  This algorithm relies on several contributions. We show how to"},"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":"1712.07445","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-20T12:30:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"37cb46e214187b1e1f9fc9e21719ac3dd9705bafbb963f144c04c002ffba4950","abstract_canon_sha256":"89c0bc6b421701319250301982fb335be7b60c299361f7804b7a76cd063ece46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:29.695380Z","signature_b64":"zEoUTGT1DzMcyFFYuj10dBiCy83lVkqUBjISLBzSvxngT1wDH6aS1PDi5c+uqGxHLx1WknU9lrWk92kFev/FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87d65509c1fc43ada6b33265816f9e5d4e295dc79c208fe572b39e0420217d13","last_reissued_at":"2026-05-17T23:55:29.694661Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:29.694661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boolean Tensor Decomposition for Conjunctive Queries with Negation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DB","authors_text":"Dan Olteanu, Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis","submitted_at":"2017-12-20T12:30:59Z","abstract_excerpt":"We propose an algorithm for answering conjunctive queries with negation, where the negated relations have bounded degree. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is expressed in terms of the fractional hypertree width and the submodular width. The query complexity depends on the structure of the negated subquery; in general it is exponential in the number of join variables occurring in negated relations yet it becomes polynomial for several classes of queries.\n  This algorithm relies on several contributions. We show how to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07445","kind":"arxiv","version":5},"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":"1712.07445","created_at":"2026-05-17T23:55:29.694775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07445v5","created_at":"2026-05-17T23:55:29.694775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07445","created_at":"2026-05-17T23:55:29.694775+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7LFKCOB7RB2","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7LFKCOB7RB23JVT","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7LFKCOB","created_at":"2026-05-18T12:31:37.085036+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/Q7LFKCOB7RB23JVTGJSYC346LV","json":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV.json","graph_json":"https://pith.science/api/pith-number/Q7LFKCOB7RB23JVTGJSYC346LV/graph.json","events_json":"https://pith.science/api/pith-number/Q7LFKCOB7RB23JVTGJSYC346LV/events.json","paper":"https://pith.science/paper/Q7LFKCOB"},"agent_actions":{"view_html":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV","download_json":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV.json","view_paper":"https://pith.science/paper/Q7LFKCOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07445&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7LFKCOB7RB23JVTGJSYC346LV/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7LFKCOB7RB23JVTGJSYC346LV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV/action/storage_attestation","attest_author":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV/action/author_attestation","sign_citation":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV/action/citation_signature","submit_replication":"https://pith.science/pith/Q7LFKCOB7RB23JVTGJSYC346LV/action/replication_record"}},"created_at":"2026-05-17T23:55:29.694775+00:00","updated_at":"2026-05-17T23:55:29.694775+00:00"}