{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MR5OWC4OHYQ23JCTXBPSZ73GXB","short_pith_number":"pith:MR5OWC4O","schema_version":"1.0","canonical_sha256":"647aeb0b8e3e21ada453b85f2cff66b877e48aea817fb51efae2d50ccaef7383","source":{"kind":"arxiv","id":"2412.16414","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"math.OC","authors_text":"Aleksandr Beznosikov, Dmitry Bylinkin","submitted_at":"2024-12-21T00:40:58Z","abstract_excerpt":"In recent years, as data and problem sizes have increased, distributed learning has become an essential tool for training high-performance models. However, the communication bottleneck, especially for high-dimensional data, is a challenge. Several techniques have been developed to overcome this problem. These include communication compression and implementation of local steps, which work particularly well when there is similarity of local data samples. In this paper, we study the synergy of these approaches for efficient distributed optimization. We propose the first theoretically grounded acc"},"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":"2412.16414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-21T00:40:58Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"54bcb352a1f7889fbc5f66d011cc4d65dfeddbba6c698ed5bc721203b2ccd714","abstract_canon_sha256":"b632cfe635fff6c3aa6d8ae1820137fc212a57b3989952d560abfe0d85d914eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:50.336943Z","signature_b64":"hfFqJ1Mfmwl0pbJkZo92xPwoxohJc3oHNUDVg7DcZk026X6xOXgL4TWG4hgFZAjjJ9q7+fah6Bs5QEIL0tAtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"647aeb0b8e3e21ada453b85f2cff66b877e48aea817fb51efae2d50ccaef7383","last_reissued_at":"2026-07-05T10:53:50.336390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:50.336390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"math.OC","authors_text":"Aleksandr Beznosikov, Dmitry Bylinkin","submitted_at":"2024-12-21T00:40:58Z","abstract_excerpt":"In recent years, as data and problem sizes have increased, distributed learning has become an essential tool for training high-performance models. However, the communication bottleneck, especially for high-dimensional data, is a challenge. Several techniques have been developed to overcome this problem. These include communication compression and implementation of local steps, which work particularly well when there is similarity of local data samples. In this paper, we study the synergy of these approaches for efficient distributed optimization. We propose the first theoretically grounded acc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16414","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/2412.16414/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":"2412.16414","created_at":"2026-07-05T10:53:50.336452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16414v1","created_at":"2026-07-05T10:53:50.336452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16414","created_at":"2026-07-05T10:53:50.336452+00:00"},{"alias_kind":"pith_short_12","alias_value":"MR5OWC4OHYQ2","created_at":"2026-07-05T10:53:50.336452+00:00"},{"alias_kind":"pith_short_16","alias_value":"MR5OWC4OHYQ23JCT","created_at":"2026-07-05T10:53:50.336452+00:00"},{"alias_kind":"pith_short_8","alias_value":"MR5OWC4O","created_at":"2026-07-05T10:53:50.336452+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/MR5OWC4OHYQ23JCTXBPSZ73GXB","json":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB.json","graph_json":"https://pith.science/api/pith-number/MR5OWC4OHYQ23JCTXBPSZ73GXB/graph.json","events_json":"https://pith.science/api/pith-number/MR5OWC4OHYQ23JCTXBPSZ73GXB/events.json","paper":"https://pith.science/paper/MR5OWC4O"},"agent_actions":{"view_html":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB","download_json":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB.json","view_paper":"https://pith.science/paper/MR5OWC4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16414&json=true","fetch_graph":"https://pith.science/api/pith-number/MR5OWC4OHYQ23JCTXBPSZ73GXB/graph.json","fetch_events":"https://pith.science/api/pith-number/MR5OWC4OHYQ23JCTXBPSZ73GXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB/action/storage_attestation","attest_author":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB/action/author_attestation","sign_citation":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB/action/citation_signature","submit_replication":"https://pith.science/pith/MR5OWC4OHYQ23JCTXBPSZ73GXB/action/replication_record"}},"created_at":"2026-07-05T10:53:50.336452+00:00","updated_at":"2026-07-05T10:53:50.336452+00:00"}