{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NMWCSGUOFCITTONPS47THIO6MP","short_pith_number":"pith:NMWCSGUO","schema_version":"1.0","canonical_sha256":"6b2c291a8e289139b9af973f33a1de63ea93e5d15ead4e1a392be9b41c620c9e","source":{"kind":"arxiv","id":"1412.4030","version":2},"attestation_state":"computed","paper":{"title":"Parallel-Correctness and Transferability for Conjunctive Queries","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, Tom J. Ameloot","submitted_at":"2014-12-12T16:06:08Z","abstract_excerpt":"A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over many servers and then evaluated in a parallel but communication-free way. The reshuffling itself is specified as a distribution policy. We introduce a correctness condition, called parallel-correctness, for the evaluation of queries w.r.t. a distribution policy. We study the complexity of parallel-correctness for conjunctive queries as well as transferability "},"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":"1412.4030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-12T16:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"1cefa4dcd8d11d452c5191315b53864db48a968091758c29cb7a5bd5be9c8b21","abstract_canon_sha256":"d7c073b275085bb7c6bd5be64a555d3d3ad7fd96023a08addd2c404de634e493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:07.655709Z","signature_b64":"Ih09Mxx/Ib+B6UsekLSiIaBXlCckVctCsFI2UT8AhorFYOOws0OFQkODCc93dLGcr93UlXNKlO220hVJUk+1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b2c291a8e289139b9af973f33a1de63ea93e5d15ead4e1a392be9b41c620c9e","last_reissued_at":"2026-05-18T02:30:07.655041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:07.655041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel-Correctness and Transferability for Conjunctive Queries","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, Tom J. Ameloot","submitted_at":"2014-12-12T16:06:08Z","abstract_excerpt":"A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over many servers and then evaluated in a parallel but communication-free way. The reshuffling itself is specified as a distribution policy. We introduce a correctness condition, called parallel-correctness, for the evaluation of queries w.r.t. a distribution policy. We study the complexity of parallel-correctness for conjunctive queries as well as transferability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4030","kind":"arxiv","version":2},"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":"1412.4030","created_at":"2026-05-18T02:30:07.655144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4030v2","created_at":"2026-05-18T02:30:07.655144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4030","created_at":"2026-05-18T02:30:07.655144+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMWCSGUOFCIT","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMWCSGUOFCITTONP","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMWCSGUO","created_at":"2026-05-18T12:28:41.024544+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/NMWCSGUOFCITTONPS47THIO6MP","json":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP.json","graph_json":"https://pith.science/api/pith-number/NMWCSGUOFCITTONPS47THIO6MP/graph.json","events_json":"https://pith.science/api/pith-number/NMWCSGUOFCITTONPS47THIO6MP/events.json","paper":"https://pith.science/paper/NMWCSGUO"},"agent_actions":{"view_html":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP","download_json":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP.json","view_paper":"https://pith.science/paper/NMWCSGUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4030&json=true","fetch_graph":"https://pith.science/api/pith-number/NMWCSGUOFCITTONPS47THIO6MP/graph.json","fetch_events":"https://pith.science/api/pith-number/NMWCSGUOFCITTONPS47THIO6MP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP/action/storage_attestation","attest_author":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP/action/author_attestation","sign_citation":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP/action/citation_signature","submit_replication":"https://pith.science/pith/NMWCSGUOFCITTONPS47THIO6MP/action/replication_record"}},"created_at":"2026-05-18T02:30:07.655144+00:00","updated_at":"2026-05-18T02:30:07.655144+00:00"}