{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7Q7EQWUT3SZHAEC7J274IL6AWC","short_pith_number":"pith:7Q7EQWUT","schema_version":"1.0","canonical_sha256":"fc3e485a93dcb270105f4ebfc42fc0b0a830c67976d3c8208a00b222766d4fd9","source":{"kind":"arxiv","id":"2201.13320","version":3},"attestation_state":"computed","paper":{"title":"BEER: Fast $O(1/T)$ Rate for Decentralized Nonconvex Optimization with Communication Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boyue Li, Haoyu Zhao, Peter Richt\\'arik, Yuejie Chi, Zhize Li","submitted_at":"2022-01-31T16:14:09Z","abstract_excerpt":"Communication efficiency has been widely recognized as the bottleneck for large-scale decentralized machine learning applications in multi-agent or federated environments. To tackle the communication bottleneck, there have been many efforts to design communication-compressed algorithms for decentralized nonconvex optimization, where the clients are only allowed to communicate a small amount of quantized information (aka bits) with their neighbors over a predefined graph topology. Despite significant efforts, the state-of-the-art algorithm in the nonconvex setting still suffers from a slower ra"},"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":"2201.13320","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-31T16:14:09Z","cross_cats_sorted":["cs.DC","cs.DS","math.OC","stat.ML"],"title_canon_sha256":"19e757fe12197a3dea97095009ea14a3389cd16bc1e9580b1f78b710c232a986","abstract_canon_sha256":"2d67fa09d73d359e676b79612aa28b432cbe39488e13409da506a870ae003485"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:29.977867Z","signature_b64":"P0MJkMwNCzystW6T1bFBktuZXkmPDquqWx7bGLKG7tmxyowATKhszExp9lQ864gSlIRlLhe3GDh5cjZqzo7xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc3e485a93dcb270105f4ebfc42fc0b0a830c67976d3c8208a00b222766d4fd9","last_reissued_at":"2026-07-05T05:06:29.977525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:29.977525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BEER: Fast $O(1/T)$ Rate for Decentralized Nonconvex Optimization with Communication Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boyue Li, Haoyu Zhao, Peter Richt\\'arik, Yuejie Chi, Zhize Li","submitted_at":"2022-01-31T16:14:09Z","abstract_excerpt":"Communication efficiency has been widely recognized as the bottleneck for large-scale decentralized machine learning applications in multi-agent or federated environments. To tackle the communication bottleneck, there have been many efforts to design communication-compressed algorithms for decentralized nonconvex optimization, where the clients are only allowed to communicate a small amount of quantized information (aka bits) with their neighbors over a predefined graph topology. Despite significant efforts, the state-of-the-art algorithm in the nonconvex setting still suffers from a slower ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.13320","kind":"arxiv","version":3},"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/2201.13320/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":"2201.13320","created_at":"2026-07-05T05:06:29.977581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.13320v3","created_at":"2026-07-05T05:06:29.977581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.13320","created_at":"2026-07-05T05:06:29.977581+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Q7EQWUT3SZH","created_at":"2026-07-05T05:06:29.977581+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Q7EQWUT3SZHAEC7","created_at":"2026-07-05T05:06:29.977581+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Q7EQWUT","created_at":"2026-07-05T05:06:29.977581+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/7Q7EQWUT3SZHAEC7J274IL6AWC","json":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC.json","graph_json":"https://pith.science/api/pith-number/7Q7EQWUT3SZHAEC7J274IL6AWC/graph.json","events_json":"https://pith.science/api/pith-number/7Q7EQWUT3SZHAEC7J274IL6AWC/events.json","paper":"https://pith.science/paper/7Q7EQWUT"},"agent_actions":{"view_html":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC","download_json":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC.json","view_paper":"https://pith.science/paper/7Q7EQWUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.13320&json=true","fetch_graph":"https://pith.science/api/pith-number/7Q7EQWUT3SZHAEC7J274IL6AWC/graph.json","fetch_events":"https://pith.science/api/pith-number/7Q7EQWUT3SZHAEC7J274IL6AWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC/action/storage_attestation","attest_author":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC/action/author_attestation","sign_citation":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC/action/citation_signature","submit_replication":"https://pith.science/pith/7Q7EQWUT3SZHAEC7J274IL6AWC/action/replication_record"}},"created_at":"2026-07-05T05:06:29.977581+00:00","updated_at":"2026-07-05T05:06:29.977581+00:00"}