{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EBUGWPYW5ATG7ENUI44BV3LPQU","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":"e8e530e458586f8b0ca229e536ef9f362a135d359455a2d96be83f6171486194","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-25T14:04:49Z","title_canon_sha256":"bec3f3cf744456b765d6b106c7bc039acc48a7f1473f2bda7a2f54759a886cb8"},"schema_version":"1.0","source":{"id":"1306.5972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5972","created_at":"2026-05-18T03:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5972v1","created_at":"2026-05-18T03:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5972","created_at":"2026-05-18T03:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"EBUGWPYW5ATG","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EBUGWPYW5ATG7ENU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EBUGWPYW","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:42d2176b8712c6831d5fd834985f8955e7e3cc7d375ec149e217bb4679c69048","target":"graph","created_at":"2026-05-18T03:19:58Z","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 consider the problem of computing a relational query $q$ on a large input database of size $n$, using a large number $p$ of servers. The computation is performed in rounds, and each server can receive only $O(n/p^{1-\\varepsilon})$ bits of data, where $\\varepsilon \\in [0,1]$ is a parameter that controls replication. We examine how many global communication steps are needed to compute $q$. We establish both lower and upper bounds, in two settings. For a single round of communication, we give lower bounds in the strongest possible model, where arbitrary bits may be exchanged; we show that any ","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":"2013-06-25T14:04:49Z","title":"Communication Steps for Parallel Query Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5972","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:58feac0bc75f88544f700e67c83528feaf559ccd68f610d8c5037ff1fde6e0d8","target":"record","created_at":"2026-05-18T03:19:58Z","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":"e8e530e458586f8b0ca229e536ef9f362a135d359455a2d96be83f6171486194","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-25T14:04:49Z","title_canon_sha256":"bec3f3cf744456b765d6b106c7bc039acc48a7f1473f2bda7a2f54759a886cb8"},"schema_version":"1.0","source":{"id":"1306.5972","kind":"arxiv","version":1}},"canonical_sha256":"20686b3f16e8266f91b447381aed6f8508589125349b7a6cc61eb66966d741ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20686b3f16e8266f91b447381aed6f8508589125349b7a6cc61eb66966d741ea","first_computed_at":"2026-05-18T03:19:58.067340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:58.067340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AWoUhwCNYso1o54bC1awSg6X3NdvZi1VvmHEBkC9L3xrCDepa+2h4xA0zB4H+6AZnxqCk0zZG+QVQj14rF2jDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:58.067957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58feac0bc75f88544f700e67c83528feaf559ccd68f610d8c5037ff1fde6e0d8","sha256:42d2176b8712c6831d5fd834985f8955e7e3cc7d375ec149e217bb4679c69048"],"state_sha256":"b40ae298e76d327461229aac23f01938a2ec186351609f45ec1f066f72a70ba1"}