{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WA2D4IKCGNHRVDTWDWSLBWAPWO","short_pith_number":"pith:WA2D4IKC","schema_version":"1.0","canonical_sha256":"b0343e2142334f1a8e761da4b0d80fb3a59b9d07782735261dca16d233c79c73","source":{"kind":"arxiv","id":"2412.17082","version":1},"attestation_state":"computed","paper":{"title":"MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Igor Sokolov, Peter Richt\\'arik","submitted_at":"2024-12-22T16:18:34Z","abstract_excerpt":"Non-smooth communication-efficient federated optimization is crucial for many machine learning applications, yet remains largely unexplored theoretically. Recent advancements have primarily focused on smooth convex and non-convex regimes, leaving a significant gap in understanding the non-smooth convex setting. Additionally, existing literature often overlooks efficient server-to-worker communication (downlink), focusing primarily on worker-to-server communication (uplink). We consider a setup where uplink costs are negligible and focus on optimizing downlink communication by improving state-o"},"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.17082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-22T16:18:34Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"8b916d0370b0ff84abb7147926166faf865f5e9afb62a13650924fd3cf8b6131","abstract_canon_sha256":"8c139b939bbd87598abeb013c306006e4f970b58c032c22935550a0bdc986638"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:17.460095Z","signature_b64":"7be0FeWjdFWnuZylo0QsPAtirPzmCfHWuek/k7BEzs8QXsUDN0PCyDMsTMpYF2e5sHDxWFmp6J5yMVVfUqD/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0343e2142334f1a8e761da4b0d80fb3a59b9d07782735261dca16d233c79c73","last_reissued_at":"2026-07-05T09:53:17.459633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:17.459633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Igor Sokolov, Peter Richt\\'arik","submitted_at":"2024-12-22T16:18:34Z","abstract_excerpt":"Non-smooth communication-efficient federated optimization is crucial for many machine learning applications, yet remains largely unexplored theoretically. Recent advancements have primarily focused on smooth convex and non-convex regimes, leaving a significant gap in understanding the non-smooth convex setting. Additionally, existing literature often overlooks efficient server-to-worker communication (downlink), focusing primarily on worker-to-server communication (uplink). We consider a setup where uplink costs are negligible and focus on optimizing downlink communication by improving state-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17082","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.17082/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.17082","created_at":"2026-07-05T09:53:17.459684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17082v1","created_at":"2026-07-05T09:53:17.459684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17082","created_at":"2026-07-05T09:53:17.459684+00:00"},{"alias_kind":"pith_short_12","alias_value":"WA2D4IKCGNHR","created_at":"2026-07-05T09:53:17.459684+00:00"},{"alias_kind":"pith_short_16","alias_value":"WA2D4IKCGNHRVDTW","created_at":"2026-07-05T09:53:17.459684+00:00"},{"alias_kind":"pith_short_8","alias_value":"WA2D4IKC","created_at":"2026-07-05T09:53:17.459684+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.15832","citing_title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO","json":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO.json","graph_json":"https://pith.science/api/pith-number/WA2D4IKCGNHRVDTWDWSLBWAPWO/graph.json","events_json":"https://pith.science/api/pith-number/WA2D4IKCGNHRVDTWDWSLBWAPWO/events.json","paper":"https://pith.science/paper/WA2D4IKC"},"agent_actions":{"view_html":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO","download_json":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO.json","view_paper":"https://pith.science/paper/WA2D4IKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17082&json=true","fetch_graph":"https://pith.science/api/pith-number/WA2D4IKCGNHRVDTWDWSLBWAPWO/graph.json","fetch_events":"https://pith.science/api/pith-number/WA2D4IKCGNHRVDTWDWSLBWAPWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO/action/storage_attestation","attest_author":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO/action/author_attestation","sign_citation":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO/action/citation_signature","submit_replication":"https://pith.science/pith/WA2D4IKCGNHRVDTWDWSLBWAPWO/action/replication_record"}},"created_at":"2026-07-05T09:53:17.459684+00:00","updated_at":"2026-07-05T09:53:17.459684+00:00"}