{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EFPAVNQFHSIRK2LRKAXWYEKBUO","short_pith_number":"pith:EFPAVNQF","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"},"canonical_sha256":"215e0ab6053c91156971502f6c1141a3a1994c7bc7c8ed181ec674c681a8d3a5","source":{"kind":"arxiv","id":"1512.06246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06246","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06246v1","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06246","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"pith_short_12","alias_value":"EFPAVNQFHSIR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EFPAVNQFHSIRK2LR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EFPAVNQF","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EFPAVNQFHSIRK2LRKAXWYEKBUO","target":"record","payload":{"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"},"canonical_sha256":"215e0ab6053c91156971502f6c1141a3a1994c7bc7c8ed181ec674c681a8d3a5","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"},"source_kind":"arxiv","source_id":"1512.06246","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JcGOLxjUoM6tAvtprC6Y5dyxuEhIFSEak5Ljhs0d9bVOitDL7HE3WH0YOc4i0LLmkA6AkiI1aSbC46p75ysVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:52:17.813956Z"},"content_sha256":"af9c232e4886a4000710bfafa9fbb201ddecb302e0a74d4cb85483ff3668ee1c","schema_version":"1.0","event_id":"sha256:af9c232e4886a4000710bfafa9fbb201ddecb302e0a74d4cb85483ff3668ee1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EFPAVNQFHSIRK2LRKAXWYEKBUO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gRs1QXAPkK2C3acmrSytW+QONB4WCRrvgoP7JwwjdeYbokf+5hRwnGvr0HbAhKMsOsyyhNIwPbvUCYXSxwoGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:52:17.814305Z"},"content_sha256":"48579d30962e7db653af3474b0ad4a5235c0b0c25bd891f461b3bbc060465fce","schema_version":"1.0","event_id":"sha256:48579d30962e7db653af3474b0ad4a5235c0b0c25bd891f461b3bbc060465fce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/bundle.json","state_url":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T19:52:17Z","links":{"resolver":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO","bundle":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/bundle.json","state":"https://pith.science/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFPAVNQFHSIRK2LRKAXWYEKBUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EFPAVNQFHSIRK2LRKAXWYEKBUO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e54fa097187a8b84acfa081788f7f36594a4544709381c1ac45961e906d51f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-19T13:18:24Z","title_canon_sha256":"8028a87ad5e7c197009de2100d5799c56381cb6420cb109b3523f4bd8521b6c3"},"schema_version":"1.0","source":{"id":"1512.06246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06246","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06246v1","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06246","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"pith_short_12","alias_value":"EFPAVNQFHSIR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EFPAVNQFHSIRK2LR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EFPAVNQF","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:48579d30962e7db653af3474b0ad4a5235c0b0c25bd891f461b3bbc060465fce","target":"graph","created_at":"2026-05-18T01:24:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bas Ketsman, Frank Neven, Gaetano Geck, Thomas Schwentick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-19T13:18:24Z","title":"Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06246","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:af9c232e4886a4000710bfafa9fbb201ddecb302e0a74d4cb85483ff3668ee1c","target":"record","created_at":"2026-05-18T01:24:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e54fa097187a8b84acfa081788f7f36594a4544709381c1ac45961e906d51f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-19T13:18:24Z","title_canon_sha256":"8028a87ad5e7c197009de2100d5799c56381cb6420cb109b3523f4bd8521b6c3"},"schema_version":"1.0","source":{"id":"1512.06246","kind":"arxiv","version":1}},"canonical_sha256":"215e0ab6053c91156971502f6c1141a3a1994c7bc7c8ed181ec674c681a8d3a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215e0ab6053c91156971502f6c1141a3a1994c7bc7c8ed181ec674c681a8d3a5","first_computed_at":"2026-05-18T01:24:01.050602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:01.050602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6WWprIg4qA2pCTFfUmA59LoD0Fqiz7UOWolPTtKY5L7qQK8GDjCIg6RcAJAfTLKZrtnLISHwaCWYIvlMHZatDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:01.051170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af9c232e4886a4000710bfafa9fbb201ddecb302e0a74d4cb85483ff3668ee1c","sha256:48579d30962e7db653af3474b0ad4a5235c0b0c25bd891f461b3bbc060465fce"],"state_sha256":"dbcc7dd1a46ed21d5dccc057d651678252fb10679190af47f67efdb77ff4a0b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vA3MX8NBBpuPa0q8s5D6qP0Sp+rjQeeg6MtZ+wttPs4jWFN597LD1k4yY2vw0CurXYLTh8+WkUFL8vg9ANKkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:52:17.816225Z","bundle_sha256":"a49921a2241f883e157b35420a9a79db2a18e187fe1e95a04bdd64479511b11f"}}