{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2AS6AAKWQ6THICCVQFLIBR74CJ","short_pith_number":"pith:2AS6AAKW","canonical_record":{"source":{"id":"2405.18031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-28T10:28:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2e9624a37395e14f78a85ba3ce091591de4712c85b4836376256b06d224e081c","abstract_canon_sha256":"6d23d8cd3d4675476f6782fc42476a8b872e920f075e4316c90811785555e7ac"},"schema_version":"1.0"},"canonical_sha256":"d025e0015687a6740855815680c7fc1266200a44e38cfb14d669c9ca7133b07c","source":{"kind":"arxiv","id":"2405.18031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18031","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18031v1","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18031","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"pith_short_12","alias_value":"2AS6AAKWQ6TH","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"pith_short_16","alias_value":"2AS6AAKWQ6THICCV","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"pith_short_8","alias_value":"2AS6AAKW","created_at":"2026-07-05T08:24:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2AS6AAKWQ6THICCVQFLIBR74CJ","target":"record","payload":{"canonical_record":{"source":{"id":"2405.18031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-28T10:28:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2e9624a37395e14f78a85ba3ce091591de4712c85b4836376256b06d224e081c","abstract_canon_sha256":"6d23d8cd3d4675476f6782fc42476a8b872e920f075e4316c90811785555e7ac"},"schema_version":"1.0"},"canonical_sha256":"d025e0015687a6740855815680c7fc1266200a44e38cfb14d669c9ca7133b07c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:14.709523Z","signature_b64":"Vns0khgHhZHCN9RRLn4MfnWagUMaTgFuZJaO/K2wpxKoqIjRHe+UietCTe+twoKqfsgSzUn1XpwJ6aIiHAqkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d025e0015687a6740855815680c7fc1266200a44e38cfb14d669c9ca7133b07c","last_reissued_at":"2026-07-05T08:24:14.709033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:14.709033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.18031","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:24:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Qeqy8eVhg9TBKp7PMD0vajY+fTDfHp6u7CBWLdp0/a/Ig2trwu89hCypRs96uQNJsbLHVFASYvRWpX3g10EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:14:10.490796Z"},"content_sha256":"c6ae78ed375c453469552711a8444f336c9cf0da8b715687b0d6bdd472ab70bb","schema_version":"1.0","event_id":"sha256:c6ae78ed375c453469552711a8444f336c9cf0da8b715687b0d6bdd472ab70bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2AS6AAKWQ6THICCVQFLIBR74CJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Dmitrii Feoktistov, Dmitry Kovalev, Ekaterina Borodich","submitted_at":"2024-05-28T10:28:45Z","abstract_excerpt":"We consider the task of minimizing the sum of convex functions stored in a decentralized manner across the nodes of a communication network. This problem is relatively well-studied in the scenario when the objective functions are smooth, or the links of the network are fixed in time, or both. In particular, lower bounds on the number of decentralized communications and (sub)gradient computations required to solve the problem have been established, along with matching optimal algorithms. However, the remaining and most challenging setting of non-smooth decentralized optimization over time-varyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18031","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/2405.18031/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:24:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a5zCRlhTa7W5mD2iLSzeoi4vt7xYXd43P6ILJTSxPI3PLjOO46Z+erX++3U3pCLeWRMbWweeV75ZmdqOqWJnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:14:10.491301Z"},"content_sha256":"adf7cda9241eee3820b15f3b11b1bd5de602ed4c5c7b8ca34884c57ac6822a64","schema_version":"1.0","event_id":"sha256:adf7cda9241eee3820b15f3b11b1bd5de602ed4c5c7b8ca34884c57ac6822a64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2AS6AAKWQ6THICCVQFLIBR74CJ/bundle.json","state_url":"https://pith.science/pith/2AS6AAKWQ6THICCVQFLIBR74CJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2AS6AAKWQ6THICCVQFLIBR74CJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T10:14:10Z","links":{"resolver":"https://pith.science/pith/2AS6AAKWQ6THICCVQFLIBR74CJ","bundle":"https://pith.science/pith/2AS6AAKWQ6THICCVQFLIBR74CJ/bundle.json","state":"https://pith.science/pith/2AS6AAKWQ6THICCVQFLIBR74CJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2AS6AAKWQ6THICCVQFLIBR74CJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2AS6AAKWQ6THICCVQFLIBR74CJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6d23d8cd3d4675476f6782fc42476a8b872e920f075e4316c90811785555e7ac","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-28T10:28:45Z","title_canon_sha256":"2e9624a37395e14f78a85ba3ce091591de4712c85b4836376256b06d224e081c"},"schema_version":"1.0","source":{"id":"2405.18031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18031","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18031v1","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18031","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"pith_short_12","alias_value":"2AS6AAKWQ6TH","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"pith_short_16","alias_value":"2AS6AAKWQ6THICCV","created_at":"2026-07-05T08:24:14Z"},{"alias_kind":"pith_short_8","alias_value":"2AS6AAKW","created_at":"2026-07-05T08:24:14Z"}],"graph_snapshots":[{"event_id":"sha256:adf7cda9241eee3820b15f3b11b1bd5de602ed4c5c7b8ca34884c57ac6822a64","target":"graph","created_at":"2026-07-05T08:24:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.18031/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the task of minimizing the sum of convex functions stored in a decentralized manner across the nodes of a communication network. This problem is relatively well-studied in the scenario when the objective functions are smooth, or the links of the network are fixed in time, or both. In particular, lower bounds on the number of decentralized communications and (sub)gradient computations required to solve the problem have been established, along with matching optimal algorithms. However, the remaining and most challenging setting of non-smooth decentralized optimization over time-varyi","authors_text":"Alexander Gasnikov, Dmitrii Feoktistov, Dmitry Kovalev, Ekaterina Borodich","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-28T10:28:45Z","title":"Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18031","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6ae78ed375c453469552711a8444f336c9cf0da8b715687b0d6bdd472ab70bb","target":"record","created_at":"2026-07-05T08:24:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6d23d8cd3d4675476f6782fc42476a8b872e920f075e4316c90811785555e7ac","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-28T10:28:45Z","title_canon_sha256":"2e9624a37395e14f78a85ba3ce091591de4712c85b4836376256b06d224e081c"},"schema_version":"1.0","source":{"id":"2405.18031","kind":"arxiv","version":1}},"canonical_sha256":"d025e0015687a6740855815680c7fc1266200a44e38cfb14d669c9ca7133b07c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d025e0015687a6740855815680c7fc1266200a44e38cfb14d669c9ca7133b07c","first_computed_at":"2026-07-05T08:24:14.709033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:14.709033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vns0khgHhZHCN9RRLn4MfnWagUMaTgFuZJaO/K2wpxKoqIjRHe+UietCTe+twoKqfsgSzUn1XpwJ6aIiHAqkBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:14.709523Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.18031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6ae78ed375c453469552711a8444f336c9cf0da8b715687b0d6bdd472ab70bb","sha256:adf7cda9241eee3820b15f3b11b1bd5de602ed4c5c7b8ca34884c57ac6822a64"],"state_sha256":"6c4a1631c4c80304c89ea8e3d3117a46048334de79d6bb6b5e8d3f926e8b16eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"583MEF1F0ZsRZrFXDMmw5aytS4mlJLzxNg9S50EqK2M8xifWRYfrjSyuilN85bO4LVeOB4GIP53SjF3qdiJxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T10:14:10.496736Z","bundle_sha256":"8f6f5b4dab23f6e937af644e1b1fadd7e49770af8860bab4b0c837537d934dbb"}}