{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EBUGWPYW5ATG7ENUI44BV3LPQU","short_pith_number":"pith:EBUGWPYW","schema_version":"1.0","canonical_sha256":"20686b3f16e8266f91b447381aed6f8508589125349b7a6cc61eb66966d741ea","source":{"kind":"arxiv","id":"1306.5972","version":1},"attestation_state":"computed","paper":{"title":"Communication Steps for 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":"2013-06-25T14:04:49Z","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 "},"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":"1306.5972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-06-25T14:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"bec3f3cf744456b765d6b106c7bc039acc48a7f1473f2bda7a2f54759a886cb8","abstract_canon_sha256":"e8e530e458586f8b0ca229e536ef9f362a135d359455a2d96be83f6171486194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:58.067957Z","signature_b64":"AWoUhwCNYso1o54bC1awSg6X3NdvZi1VvmHEBkC9L3xrCDepa+2h4xA0zB4H+6AZnxqCk0zZG+QVQj14rF2jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20686b3f16e8266f91b447381aed6f8508589125349b7a6cc61eb66966d741ea","last_reissued_at":"2026-05-18T03:19:58.067340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:58.067340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Steps for 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":"2013-06-25T14:04:49Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5972","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":"1306.5972","created_at":"2026-05-18T03:19:58.067439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5972v1","created_at":"2026-05-18T03:19:58.067439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5972","created_at":"2026-05-18T03:19:58.067439+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBUGWPYW5ATG","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBUGWPYW5ATG7ENU","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBUGWPYW","created_at":"2026-05-18T12:27:43.054852+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/EBUGWPYW5ATG7ENUI44BV3LPQU","json":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU.json","graph_json":"https://pith.science/api/pith-number/EBUGWPYW5ATG7ENUI44BV3LPQU/graph.json","events_json":"https://pith.science/api/pith-number/EBUGWPYW5ATG7ENUI44BV3LPQU/events.json","paper":"https://pith.science/paper/EBUGWPYW"},"agent_actions":{"view_html":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU","download_json":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU.json","view_paper":"https://pith.science/paper/EBUGWPYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5972&json=true","fetch_graph":"https://pith.science/api/pith-number/EBUGWPYW5ATG7ENUI44BV3LPQU/graph.json","fetch_events":"https://pith.science/api/pith-number/EBUGWPYW5ATG7ENUI44BV3LPQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU/action/storage_attestation","attest_author":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU/action/author_attestation","sign_citation":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU/action/citation_signature","submit_replication":"https://pith.science/pith/EBUGWPYW5ATG7ENUI44BV3LPQU/action/replication_record"}},"created_at":"2026-05-18T03:19:58.067439+00:00","updated_at":"2026-05-18T03:19:58.067439+00:00"}