{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MFU2E6UVYZM7VBM3N32A6OCKP5","short_pith_number":"pith:MFU2E6UV","schema_version":"1.0","canonical_sha256":"6169a27a95c659fa859b6ef40f384a7f47cedf7a055e1425f269770745ad54e1","source":{"kind":"arxiv","id":"2607.01665","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Decentralized Online Convex Optimization with Compressed Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chang Yao, Hao Zhou, Mingli Song, Xiaoyu Wang, Yuanyu Wan","submitted_at":"2026-07-02T03:45:41Z","abstract_excerpt":"Decentralized online convex optimization (D-OCO) is a popular framework for distributed applications with streaming data. To tackle the communication bottleneck, previous studies have investigated D-OCO with compressed communication and proposed several algorithms that are variants of online gradient descent (OGD). However, for D-OCO with exact communication, the best existing algorithms are variants of follow-the-regularized-leader (FTRL). In this paper, for the first time, we propose two FTRL-type algorithms for D-OCO with compressed communication. Compared with OGD-type algorithms, our algo"},"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":"2607.01665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-02T03:45:41Z","cross_cats_sorted":[],"title_canon_sha256":"f30be3cdbea66c46afb1298276459b00fc4bc4717a21f8eae1855f3c6cdf0652","abstract_canon_sha256":"c4b357e67a80d0105bb6f043524483205a20e0e8a02aedd5e7795222aa44d46f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:26.067308Z","signature_b64":"c6zS7OTEGbku9lgmoAZFefNuZVyD7Ij80ac8p8eJ2kxs0RbpyHClYEPCZB64AAzx8IeAq6/knJdOL6w1RaKTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6169a27a95c659fa859b6ef40f384a7f47cedf7a055e1425f269770745ad54e1","last_reissued_at":"2026-07-03T01:17:26.066842Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:26.066842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Decentralized Online Convex Optimization with Compressed Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chang Yao, Hao Zhou, Mingli Song, Xiaoyu Wang, Yuanyu Wan","submitted_at":"2026-07-02T03:45:41Z","abstract_excerpt":"Decentralized online convex optimization (D-OCO) is a popular framework for distributed applications with streaming data. To tackle the communication bottleneck, previous studies have investigated D-OCO with compressed communication and proposed several algorithms that are variants of online gradient descent (OGD). However, for D-OCO with exact communication, the best existing algorithms are variants of follow-the-regularized-leader (FTRL). In this paper, for the first time, we propose two FTRL-type algorithms for D-OCO with compressed communication. Compared with OGD-type algorithms, our algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01665","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/2607.01665/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":"2607.01665","created_at":"2026-07-03T01:17:26.066908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01665v1","created_at":"2026-07-03T01:17:26.066908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01665","created_at":"2026-07-03T01:17:26.066908+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFU2E6UVYZM7","created_at":"2026-07-03T01:17:26.066908+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFU2E6UVYZM7VBM3","created_at":"2026-07-03T01:17:26.066908+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFU2E6UV","created_at":"2026-07-03T01:17:26.066908+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/MFU2E6UVYZM7VBM3N32A6OCKP5","json":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5.json","graph_json":"https://pith.science/api/pith-number/MFU2E6UVYZM7VBM3N32A6OCKP5/graph.json","events_json":"https://pith.science/api/pith-number/MFU2E6UVYZM7VBM3N32A6OCKP5/events.json","paper":"https://pith.science/paper/MFU2E6UV"},"agent_actions":{"view_html":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5","download_json":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5.json","view_paper":"https://pith.science/paper/MFU2E6UV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01665&json=true","fetch_graph":"https://pith.science/api/pith-number/MFU2E6UVYZM7VBM3N32A6OCKP5/graph.json","fetch_events":"https://pith.science/api/pith-number/MFU2E6UVYZM7VBM3N32A6OCKP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5/action/storage_attestation","attest_author":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5/action/author_attestation","sign_citation":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5/action/citation_signature","submit_replication":"https://pith.science/pith/MFU2E6UVYZM7VBM3N32A6OCKP5/action/replication_record"}},"created_at":"2026-07-03T01:17:26.066908+00:00","updated_at":"2026-07-03T01:17:26.066908+00:00"}