{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z6J67QAXYQHH4CHQQ3EP7WCDVD","short_pith_number":"pith:Z6J67QAX","schema_version":"1.0","canonical_sha256":"cf93efc017c40e7e08f086c8ffd843a8d058f7518e0deb857b6bf06b3b1cacd9","source":{"kind":"arxiv","id":"2408.01727","version":1},"attestation_state":"computed","paper":{"title":"A Robust Compressed Push-Pull Method for Decentralized Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shi Pu, Tsung-Hui Chang, Yiwei Liao, Zhuorui Li","submitted_at":"2024-08-03T09:51:22Z","abstract_excerpt":"In the modern paradigm of multi-agent networks, communication has become one of the main bottlenecks for decentralized optimization, where a large number of agents are involved in minimizing the average of the local cost functions. In this paper, we propose a robust compressed push-pull algorithm (RCPP) that combines gradient tracking with communication compression. In particular, RCPP is robust under a much more general class of compression operators that allow both relative and absolute compression errors, in contrast to the existing works which can handle either one of them or assume convex"},"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":"2408.01727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-03T09:51:22Z","cross_cats_sorted":[],"title_canon_sha256":"01119f5fab3716c086df67cbc5601b55ff81816b8911ef9f141c8db4208569fa","abstract_canon_sha256":"f7d098447f5878d1554fe9f7e7d698b3e1c9956091b938a6209ef047eafdd289"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:52:02.005027Z","signature_b64":"EFwUqJp/lctFckKLOR6qXxZShaOx++GSKqsArr5MYuWBCjQwYwUhJjHTdfTX8QjuQRY4TrMCVGAqAurelfYCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf93efc017c40e7e08f086c8ffd843a8d058f7518e0deb857b6bf06b3b1cacd9","last_reissued_at":"2026-07-05T08:52:02.004621Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:52:02.004621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Robust Compressed Push-Pull Method for Decentralized Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shi Pu, Tsung-Hui Chang, Yiwei Liao, Zhuorui Li","submitted_at":"2024-08-03T09:51:22Z","abstract_excerpt":"In the modern paradigm of multi-agent networks, communication has become one of the main bottlenecks for decentralized optimization, where a large number of agents are involved in minimizing the average of the local cost functions. In this paper, we propose a robust compressed push-pull algorithm (RCPP) that combines gradient tracking with communication compression. In particular, RCPP is robust under a much more general class of compression operators that allow both relative and absolute compression errors, in contrast to the existing works which can handle either one of them or assume convex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.01727","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.01727/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":"2408.01727","created_at":"2026-07-05T08:52:02.004677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.01727v1","created_at":"2026-07-05T08:52:02.004677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.01727","created_at":"2026-07-05T08:52:02.004677+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6J67QAXYQHH","created_at":"2026-07-05T08:52:02.004677+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6J67QAXYQHH4CHQ","created_at":"2026-07-05T08:52:02.004677+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6J67QAX","created_at":"2026-07-05T08:52:02.004677+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01755","citing_title":"Decentralized Stochastic Subgradient-type Methods with Communication Compression for Nonsmooth Nonconvex Optimization","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07633","citing_title":"Distributed Seeking for Fixed Points of Biased Stochastic Operators: A Communication-Efficient Approach","ref_index":103,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10615","citing_title":"Unified Communication Compression Beyond Global Error Bounds for Distributed Nonconvex Optimization","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07633","citing_title":"Distributed Seeking for Fixed Points of Biased Stochastic Operators: A Communication-Efficient Approach","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD","json":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD.json","graph_json":"https://pith.science/api/pith-number/Z6J67QAXYQHH4CHQQ3EP7WCDVD/graph.json","events_json":"https://pith.science/api/pith-number/Z6J67QAXYQHH4CHQQ3EP7WCDVD/events.json","paper":"https://pith.science/paper/Z6J67QAX"},"agent_actions":{"view_html":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD","download_json":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD.json","view_paper":"https://pith.science/paper/Z6J67QAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.01727&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6J67QAXYQHH4CHQQ3EP7WCDVD/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6J67QAXYQHH4CHQQ3EP7WCDVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD/action/storage_attestation","attest_author":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD/action/author_attestation","sign_citation":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD/action/citation_signature","submit_replication":"https://pith.science/pith/Z6J67QAXYQHH4CHQQ3EP7WCDVD/action/replication_record"}},"created_at":"2026-07-05T08:52:02.004677+00:00","updated_at":"2026-07-05T08:52:02.004677+00:00"}