{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QJQIEEXHBUVXDAFVKJVXBV3WRN","short_pith_number":"pith:QJQIEEXH","schema_version":"1.0","canonical_sha256":"82608212e70d2b7180b5526b70d7768b4c6e6936d3fe4a35141692a9f5ecaf14","source":{"kind":"arxiv","id":"1906.05832","version":2},"attestation_state":"computed","paper":{"title":"The Communication Complexity of Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Ruosong Wang, Santosh S. Vempala","submitted_at":"2019-06-13T17:29:56Z","abstract_excerpt":"We consider the communication complexity of a number of distributed optimization problems. We start with the problem of solving a linear system. Suppose there is a coordinator together with $s$ servers $P_1, \\ldots, P_s$, the $i$-th of which holds a subset $A^{(i)} x = b^{(i)}$ of $n_i$ constraints of a linear system in $d$ variables, and the coordinator would like to output $x \\in \\mathbb{R}^d$ for which $A^{(i)} x = b^{(i)}$ for $i = 1, \\ldots, s$. We assume each coefficient of each constraint is specified using $L$ bits. We first resolve the randomized and deterministic communication comple"},"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":"1906.05832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-13T17:29:56Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"4dd13a1efe2a5edf001562b964ba5bb7bb0c587b8aae995a99018b69b58c82ca","abstract_canon_sha256":"d9e70d79914ffe91f98e2e168d9933f770f0a2ceb68683d515e12d3a1f39340d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:04.314613Z","signature_b64":"WjBxt11ruMhXMMAhVUqh1a16GSDyQ7rPFJ50KU0YDcd9G/Ny7sRxP0+sFeGb10y3hldLY1sxIn4jE3gmBZGwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82608212e70d2b7180b5526b70d7768b4c6e6936d3fe4a35141692a9f5ecaf14","last_reissued_at":"2026-07-05T00:16:04.314197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:04.314197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Communication Complexity of Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Ruosong Wang, Santosh S. Vempala","submitted_at":"2019-06-13T17:29:56Z","abstract_excerpt":"We consider the communication complexity of a number of distributed optimization problems. We start with the problem of solving a linear system. Suppose there is a coordinator together with $s$ servers $P_1, \\ldots, P_s$, the $i$-th of which holds a subset $A^{(i)} x = b^{(i)}$ of $n_i$ constraints of a linear system in $d$ variables, and the coordinator would like to output $x \\in \\mathbb{R}^d$ for which $A^{(i)} x = b^{(i)}$ for $i = 1, \\ldots, s$. We assume each coefficient of each constraint is specified using $L$ bits. We first resolve the randomized and deterministic communication comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05832","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.05832/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1906.05832","created_at":"2026-07-05T00:16:04.314249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05832v2","created_at":"2026-07-05T00:16:04.314249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05832","created_at":"2026-07-05T00:16:04.314249+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJQIEEXHBUVX","created_at":"2026-07-05T00:16:04.314249+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJQIEEXHBUVXDAFV","created_at":"2026-07-05T00:16:04.314249+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJQIEEXH","created_at":"2026-07-05T00:16:04.314249+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/QJQIEEXHBUVXDAFVKJVXBV3WRN","json":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN.json","graph_json":"https://pith.science/api/pith-number/QJQIEEXHBUVXDAFVKJVXBV3WRN/graph.json","events_json":"https://pith.science/api/pith-number/QJQIEEXHBUVXDAFVKJVXBV3WRN/events.json","paper":"https://pith.science/paper/QJQIEEXH"},"agent_actions":{"view_html":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN","download_json":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN.json","view_paper":"https://pith.science/paper/QJQIEEXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05832&json=true","fetch_graph":"https://pith.science/api/pith-number/QJQIEEXHBUVXDAFVKJVXBV3WRN/graph.json","fetch_events":"https://pith.science/api/pith-number/QJQIEEXHBUVXDAFVKJVXBV3WRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN/action/storage_attestation","attest_author":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN/action/author_attestation","sign_citation":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN/action/citation_signature","submit_replication":"https://pith.science/pith/QJQIEEXHBUVXDAFVKJVXBV3WRN/action/replication_record"}},"created_at":"2026-07-05T00:16:04.314249+00:00","updated_at":"2026-07-05T00:16:04.314249+00:00"}