{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NVSMQMXYFCXTVLNKRKSXXDBVHB","short_pith_number":"pith:NVSMQMXY","canonical_record":{"source":{"id":"1602.06236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-19T17:42:11Z","cross_cats_sorted":[],"title_canon_sha256":"812fe6b6f83bdecc08c7f0bad413af37c36fa17c369cb6fe524bcff15a6a0eb3","abstract_canon_sha256":"6a04414e75dca5587be7868bb5d50fe176eba1058c8ff6c833ea1905459a09f4"},"schema_version":"1.0"},"canonical_sha256":"6d64c832f828af3aadaa8aa57b8c3538657eb5ac26481ed2d195130ab4d69e86","source":{"kind":"arxiv","id":"1602.06236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06236","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06236v1","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06236","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"NVSMQMXYFCXT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NVSMQMXYFCXTVLNK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NVSMQMXY","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NVSMQMXYFCXTVLNKRKSXXDBVHB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-19T17:42:11Z","cross_cats_sorted":[],"title_canon_sha256":"812fe6b6f83bdecc08c7f0bad413af37c36fa17c369cb6fe524bcff15a6a0eb3","abstract_canon_sha256":"6a04414e75dca5587be7868bb5d50fe176eba1058c8ff6c833ea1905459a09f4"},"schema_version":"1.0"},"canonical_sha256":"6d64c832f828af3aadaa8aa57b8c3538657eb5ac26481ed2d195130ab4d69e86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:18.341107Z","signature_b64":"QVg0CIqMdbzo9ktBXw7/V/5MKqWiojYwQ4CZDunowR1hEtPw2W9yFHQfiQzmy2lSb9K8Ptefsu8ygCg5UZo4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d64c832f828af3aadaa8aa57b8c3538657eb5ac26481ed2d195130ab4d69e86","last_reissued_at":"2026-05-18T01:20:18.340460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:18.340460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06236","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:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZSnJpLQZALDiMMYUkBVmk2mprhswfO9bxao8CP3yqxMGxefb8i9Wpwi8y8LtPwSKo/yB+NiFI9z02KdeZvdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:35:30.738097Z"},"content_sha256":"f41a0a25f3e96a6097cb3afeabc863d555958f4173fa567a655ad506540704d8","schema_version":"1.0","event_id":"sha256:f41a0a25f3e96a6097cb3afeabc863d555958f4173fa567a655ad506540704d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NVSMQMXYFCXTVLNKRKSXXDBVHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Cost in Parallel Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Paraschos Koutris, Paul Beame","submitted_at":"2016-02-19T17:42:11Z","abstract_excerpt":"We study the problem of computing conjunctive queries over large databases on parallel architectures without shared storage. Using the structure of such a query $q$ and the skew in the data, we study tradeoffs between the number of processors, the number of rounds of communication, and the per-processor load -- the number of bits each processor can send or can receive in a single round -- that are required to compute $q$.\n  When the data is free of skew, we obtain essentially tight upper and lower bounds for one round algorithms and we show how the bounds degrade when there is skew in the data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06236","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:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAiOteLBkTeQKuKCDFyPuK/QERAzYjae6fKXqbtU+HPuEVWHlUrC+thXobEOz2ddLy4JQCIUj7yR+2+cLGZsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:35:30.738467Z"},"content_sha256":"c7e452daf8ad5d641fb9f0b1b7874e2e4a1056970f2067b3f4b8a9d4c0c0c59d","schema_version":"1.0","event_id":"sha256:c7e452daf8ad5d641fb9f0b1b7874e2e4a1056970f2067b3f4b8a9d4c0c0c59d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVSMQMXYFCXTVLNKRKSXXDBVHB/bundle.json","state_url":"https://pith.science/pith/NVSMQMXYFCXTVLNKRKSXXDBVHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVSMQMXYFCXTVLNKRKSXXDBVHB/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-01T03:35:30Z","links":{"resolver":"https://pith.science/pith/NVSMQMXYFCXTVLNKRKSXXDBVHB","bundle":"https://pith.science/pith/NVSMQMXYFCXTVLNKRKSXXDBVHB/bundle.json","state":"https://pith.science/pith/NVSMQMXYFCXTVLNKRKSXXDBVHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVSMQMXYFCXTVLNKRKSXXDBVHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NVSMQMXYFCXTVLNKRKSXXDBVHB","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":"6a04414e75dca5587be7868bb5d50fe176eba1058c8ff6c833ea1905459a09f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-19T17:42:11Z","title_canon_sha256":"812fe6b6f83bdecc08c7f0bad413af37c36fa17c369cb6fe524bcff15a6a0eb3"},"schema_version":"1.0","source":{"id":"1602.06236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06236","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06236v1","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06236","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"NVSMQMXYFCXT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NVSMQMXYFCXTVLNK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NVSMQMXY","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:c7e452daf8ad5d641fb9f0b1b7874e2e4a1056970f2067b3f4b8a9d4c0c0c59d","target":"graph","created_at":"2026-05-18T01:20:18Z","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":"We study the problem of computing conjunctive queries over large databases on parallel architectures without shared storage. Using the structure of such a query $q$ and the skew in the data, we study tradeoffs between the number of processors, the number of rounds of communication, and the per-processor load -- the number of bits each processor can send or can receive in a single round -- that are required to compute $q$.\n  When the data is free of skew, we obtain essentially tight upper and lower bounds for one round algorithms and we show how the bounds degrade when there is skew in the data","authors_text":"Dan Suciu, Paraschos Koutris, Paul Beame","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-19T17:42:11Z","title":"Communication Cost in Parallel Query Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06236","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:f41a0a25f3e96a6097cb3afeabc863d555958f4173fa567a655ad506540704d8","target":"record","created_at":"2026-05-18T01:20:18Z","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":"6a04414e75dca5587be7868bb5d50fe176eba1058c8ff6c833ea1905459a09f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-19T17:42:11Z","title_canon_sha256":"812fe6b6f83bdecc08c7f0bad413af37c36fa17c369cb6fe524bcff15a6a0eb3"},"schema_version":"1.0","source":{"id":"1602.06236","kind":"arxiv","version":1}},"canonical_sha256":"6d64c832f828af3aadaa8aa57b8c3538657eb5ac26481ed2d195130ab4d69e86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d64c832f828af3aadaa8aa57b8c3538657eb5ac26481ed2d195130ab4d69e86","first_computed_at":"2026-05-18T01:20:18.340460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:18.340460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVg0CIqMdbzo9ktBXw7/V/5MKqWiojYwQ4CZDunowR1hEtPw2W9yFHQfiQzmy2lSb9K8Ptefsu8ygCg5UZo4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:18.341107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f41a0a25f3e96a6097cb3afeabc863d555958f4173fa567a655ad506540704d8","sha256:c7e452daf8ad5d641fb9f0b1b7874e2e4a1056970f2067b3f4b8a9d4c0c0c59d"],"state_sha256":"50c1ae4a5a768ee20b5a726616f28dd958078e994a7638ac91b31344a2b7ca3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"os1Ban2oPHjEsdLcp+jE3vmLJTGue9tgtnojrF3O8wVeSW/US9OagVQX89mHSyHs+ddINUXZmRljRA1ZWFttAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:35:30.740501Z","bundle_sha256":"d56d4dec7bdb66a5f9d8e274bf1d8b2f05182c361fd7b9010077292fe60d84b4"}}