{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XPY5AQEUMKZUTFBKSGZJAW7335","short_pith_number":"pith:XPY5AQEU","schema_version":"1.0","canonical_sha256":"bbf1d0409462b349942a91b2905bfbdf459f109bbf7e8234fcddfc1d52aa07ee","source":{"kind":"arxiv","id":"1812.04048","version":5},"attestation_state":"computed","paper":{"title":"Compressed Distributed Gradient Descent: Communication-Efficient Consensus over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.DC","authors_text":"Elizabeth S. Bentley, Jia Liu, Xin Zhang, Zhengyuan Zhu","submitted_at":"2018-12-10T19:37:26Z","abstract_excerpt":"Network consensus optimization has received increasing attention in recent years and has found important applications in many scientific and engineering fields. To solve network consensus optimization problems, one of the most well-known approaches is the distributed gradient descent method (DGD). However, in networks with slow communication rates, DGD's performance is unsatisfactory for solving high-dimensional network consensus problems due to the communication bottleneck. This motivates us to design a communication-efficient DGD-type algorithm based on compressed information exchanges. Our "},"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":"1812.04048","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-10T19:37:26Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"d7ff80c40e7fa155c7eb4fb3e3d4bb33230021d46400e175e6fde2343eb81f50","abstract_canon_sha256":"9b704dd25fa119a842b9683a78fbaa0425e75fa1cefc0fa025a0c0398cc8b916"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:46.848756Z","signature_b64":"0XUq0Sspn3N6M+xwniq9xqwZ56d87qWAII/fFb/enQVAfnMSLSOvnpKImrhbPN50W6+fsou3CjipK5aIC+2DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbf1d0409462b349942a91b2905bfbdf459f109bbf7e8234fcddfc1d52aa07ee","last_reissued_at":"2026-06-04T20:13:46.848086Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:46.848086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Distributed Gradient Descent: Communication-Efficient Consensus over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.DC","authors_text":"Elizabeth S. Bentley, Jia Liu, Xin Zhang, Zhengyuan Zhu","submitted_at":"2018-12-10T19:37:26Z","abstract_excerpt":"Network consensus optimization has received increasing attention in recent years and has found important applications in many scientific and engineering fields. To solve network consensus optimization problems, one of the most well-known approaches is the distributed gradient descent method (DGD). However, in networks with slow communication rates, DGD's performance is unsatisfactory for solving high-dimensional network consensus problems due to the communication bottleneck. This motivates us to design a communication-efficient DGD-type algorithm based on compressed information exchanges. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04048","kind":"arxiv","version":5},"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/1812.04048/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":"1812.04048","created_at":"2026-06-04T20:13:46.848191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04048v5","created_at":"2026-06-04T20:13:46.848191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04048","created_at":"2026-06-04T20:13:46.848191+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPY5AQEUMKZU","created_at":"2026-06-04T20:13:46.848191+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPY5AQEUMKZUTFBK","created_at":"2026-06-04T20:13:46.848191+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPY5AQEU","created_at":"2026-06-04T20:13:46.848191+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/XPY5AQEUMKZUTFBKSGZJAW7335","json":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335.json","graph_json":"https://pith.science/api/pith-number/XPY5AQEUMKZUTFBKSGZJAW7335/graph.json","events_json":"https://pith.science/api/pith-number/XPY5AQEUMKZUTFBKSGZJAW7335/events.json","paper":"https://pith.science/paper/XPY5AQEU"},"agent_actions":{"view_html":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335","download_json":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335.json","view_paper":"https://pith.science/paper/XPY5AQEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04048&json=true","fetch_graph":"https://pith.science/api/pith-number/XPY5AQEUMKZUTFBKSGZJAW7335/graph.json","fetch_events":"https://pith.science/api/pith-number/XPY5AQEUMKZUTFBKSGZJAW7335/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335/action/storage_attestation","attest_author":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335/action/author_attestation","sign_citation":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335/action/citation_signature","submit_replication":"https://pith.science/pith/XPY5AQEUMKZUTFBKSGZJAW7335/action/replication_record"}},"created_at":"2026-06-04T20:13:46.848191+00:00","updated_at":"2026-06-04T20:13:46.848191+00:00"}