{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WRF5OZME2GLWZY7PIYA32ZRFJO","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":"0c3728f3e00b59f189d3a63ad386315f2c8b0214d2ccd5ccb9034c73b9340b96","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-11T11:41:37Z","title_canon_sha256":"9a98eb61fe4994b08ded3b3b24dbb8d42ed477820e39bf0e0788fa1aa00a681c"},"schema_version":"1.0","source":{"id":"1910.05093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.05093","created_at":"2026-07-05T00:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1910.05093v1","created_at":"2026-07-05T00:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05093","created_at":"2026-07-05T00:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"WRF5OZME2GLW","created_at":"2026-07-05T00:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"WRF5OZME2GLWZY7P","created_at":"2026-07-05T00:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"WRF5OZME","created_at":"2026-07-05T00:11:25Z"}],"graph_snapshots":[{"event_id":"sha256:3f1c5084d7b64b627e69bc37a83ceb0e38d57026743287dce25adaefe0bdf7ef","target":"graph","created_at":"2026-07-05T00:11:25Z","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/1910.05093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The incremental aggregated gradient algorithm is popular in network optimization and machine learning research. However, the current convergence results require the objective function to be strongly convex. And the existing convergence rates are also limited to linear convergence. Due to the mathematical techniques, the stepsize in the algorithm is restricted by the strongly convex constant, which may make the stepsize be very small (the strongly convex constant may be small).\n  In this paper, we propose a general proximal incremental aggregated gradient algorithm, which contains various exist","authors_text":"Dongsheng Li, Qing Liao, Tao Sun, Yuejiao Sun","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-11T11:41:37Z","title":"General Proximal Incremental Aggregated Gradient Algorithms: Better and Novel Results under General Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05093","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:561d8803362c63dbd6731923dedb60c88edd28742e2c92535c3097f8f7e689ab","target":"record","created_at":"2026-07-05T00:11:25Z","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":"0c3728f3e00b59f189d3a63ad386315f2c8b0214d2ccd5ccb9034c73b9340b96","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-11T11:41:37Z","title_canon_sha256":"9a98eb61fe4994b08ded3b3b24dbb8d42ed477820e39bf0e0788fa1aa00a681c"},"schema_version":"1.0","source":{"id":"1910.05093","kind":"arxiv","version":1}},"canonical_sha256":"b44bd76584d1976ce3ef4601bd66254ba4ed071c6f4c9826d63ceaa165118d8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b44bd76584d1976ce3ef4601bd66254ba4ed071c6f4c9826d63ceaa165118d8d","first_computed_at":"2026-07-05T00:11:25.316690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:11:25.316690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZzZsZ+DRpZyYutIhrOvGKWAWdZDh7ucSdXyD5bQhoAtuCgIkqb+dMZJNSuwMp61bvuolGxS9isU4Ngj1uH/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:11:25.317097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.05093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:561d8803362c63dbd6731923dedb60c88edd28742e2c92535c3097f8f7e689ab","sha256:3f1c5084d7b64b627e69bc37a83ceb0e38d57026743287dce25adaefe0bdf7ef"],"state_sha256":"57078b580c1f7f540123cc39c2cff9be5b1de56efb986ec7dfa785832a34f506"}