{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EFPAVNQFHSIRK2LRKAXWYEKBUO","short_pith_number":"pith:EFPAVNQF","schema_version":"1.0","canonical_sha256":"215e0ab6053c91156971502f6c1141a3a1994c7bc7c8ed181ec674c681a8d3a5","source":{"kind":"arxiv","id":"1512.06246","version":1},"attestation_state":"computed","paper":{"title":"Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bas Ketsman, Frank Neven, Gaetano Geck, Thomas Schwentick","submitted_at":"2015-12-19T13:18:24Z","abstract_excerpt":"Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether a given distribution policy for the reshuffle is adequate for computing a given query, also referred to as parallel-correctness. This paper extends the study of the complexity of parallel-correctness and its constituents, parallel-soundness and parallel-completeness, to unions of conjunctive queries with and without negation. As a by-product it is shown that the containment problem for conjunctive queries with negat"},"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":"1512.06246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-19T13:18:24Z","cross_cats_sorted":[],"title_canon_sha256":"8028a87ad5e7c197009de2100d5799c56381cb6420cb109b3523f4bd8521b6c3","abstract_canon_sha256":"e54fa097187a8b84acfa081788f7f36594a4544709381c1ac45961e906d51f2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:01.051170Z","signature_b64":"6WWprIg4qA2pCTFfUmA59LoD0Fqiz7UOWolPTtKY5L7qQK8GDjCIg6RcAJAfTLKZrtnLISHwaCWYIvlMHZatDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215e0ab6053c91156971502f6c1141a3a1994c7bc7c8ed181ec674c681a8d3a5","last_reissued_at":"2026-05-18T01:24:01.050602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:01.050602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bas Ketsman, Frank Neven, Gaetano Geck, Thomas Schwentick","submitted_at":"2015-12-19T13:18:24Z","abstract_excerpt":"Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether a given distribution policy for the reshuffle is adequate for computing a given query, also referred to as parallel-correctness. This paper extends the study of the complexity of parallel-correctness and its constituents, parallel-soundness and parallel-completeness, to unions of conjunctive queries with and without negation. As a by-product it is shown that the containment problem for conjunctive queries with negat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06246","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":"1512.06246","created_at":"2026-05-18T01:24:01.050686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06246v1","created_at":"2026-05-18T01:24:01.050686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06246","created_at":"2026-05-18T01:24:01.050686+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFPAVNQFHSIR","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFPAVNQFHSIRK2LR","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFPAVNQF","created_at":"2026-05-18T12:29:19.899920+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/EFPAVNQFHSIRK2LRKAXWYEKBUO","json":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO.json","graph_json":"https://pith.science/api/pith-number/EFPAVNQFHSIRK2LRKAXWYEKBUO/graph.json","events_json":"https://pith.science/api/pith-number/EFPAVNQFHSIRK2LRKAXWYEKBUO/events.json","paper":"https://pith.science/paper/EFPAVNQF"},"agent_actions":{"view_html":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO","download_json":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO.json","view_paper":"https://pith.science/paper/EFPAVNQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06246&json=true","fetch_graph":"https://pith.science/api/pith-number/EFPAVNQFHSIRK2LRKAXWYEKBUO/graph.json","fetch_events":"https://pith.science/api/pith-number/EFPAVNQFHSIRK2LRKAXWYEKBUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/action/storage_attestation","attest_author":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/action/author_attestation","sign_citation":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/action/citation_signature","submit_replication":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/action/replication_record"}},"created_at":"2026-05-18T01:24:01.050686+00:00","updated_at":"2026-05-18T01:24:01.050686+00:00"}