{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QCXNOLAHRV5223IH5SA56WAFU6","short_pith_number":"pith:QCXNOLAH","canonical_record":{"source":{"id":"1803.08198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-03-22T01:46:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"36204a9a4f4a2c2995f4c0b718bcdf1dca43e8d5d5fe0d9de5e8208fcc6c5b4f","abstract_canon_sha256":"2dcc81af8a0f253df390367388099f94d773bcfe41d371b32fe6d421bba9bbc9"},"schema_version":"1.0"},"canonical_sha256":"80aed72c078d7bad6d07ec81df5805a7b44b6aa81cfcfd9ddee7f61f13bb05f6","source":{"kind":"arxiv","id":"1803.08198","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08198","created_at":"2026-05-18T00:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08198v2","created_at":"2026-05-18T00:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08198","created_at":"2026-05-18T00:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"QCXNOLAHRV52","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QCXNOLAHRV5223IH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QCXNOLAH","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QCXNOLAHRV5223IH5SA56WAFU6","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-03-22T01:46:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"36204a9a4f4a2c2995f4c0b718bcdf1dca43e8d5d5fe0d9de5e8208fcc6c5b4f","abstract_canon_sha256":"2dcc81af8a0f253df390367388099f94d773bcfe41d371b32fe6d421bba9bbc9"},"schema_version":"1.0"},"canonical_sha256":"80aed72c078d7bad6d07ec81df5805a7b44b6aa81cfcfd9ddee7f61f13bb05f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:12.610076Z","signature_b64":"cmAfwnUIEnayzof3vWAWzWhpgSgjHSDmO5h10N4SpDkpHVnIdvA4Gutd+ebROuFGnPOfQfnFENw5KxKVDQrMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80aed72c078d7bad6d07ec81df5805a7b44b6aa81cfcfd9ddee7f61f13bb05f6","last_reissued_at":"2026-05-18T00:02:12.609424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:12.609424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08198","source_version":2,"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-05-18T00:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LY/5/B6+zICuhRPF9cFjYtzOqwhGZnhQfCOavL3PoziWpQdU2hceyejauiYd9xTdztz4F1M2iUY0IM/j2qE7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:25:35.986658Z"},"content_sha256":"41f26effad2394327521ddbf160a5019f1a3a34563a5bc5424885f362943199c","schema_version":"1.0","event_id":"sha256:41f26effad2394327521ddbf160a5019f1a3a34563a5bc5424885f362943199c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QCXNOLAHRV5223IH5SA56WAFU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SUCAG: Stochastic Unbiased Curvature-aided Gradient Method for Distributed Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Angelia Nedic, Anna Scaglione, Hoi-To Wai, Nikolaos M. Freris","submitted_at":"2018-03-22T01:46:49Z","abstract_excerpt":"We propose and analyze a new stochastic gradient method, which we call Stochastic Unbiased Curvature-aided Gradient (SUCAG), for finite sum optimization problems. SUCAG constitutes an unbiased total gradient tracking technique that uses Hessian information to accelerate con- vergence. We analyze our method under the general asynchronous model of computation, in which each function is selected infinitely often with possibly unbounded (but sublinear) delay. For strongly convex problems, we establish linear convergence for the SUCAG method. When the initialization point is sufficiently close to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08198","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/50DQKmg/vxZmGkMDcocLONFkulSfveM5WwnZtjB+6lrK8wFy0my3q4wx78J4RR++WVgVANaZfQuHSL/HEkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:25:35.986999Z"},"content_sha256":"560e5a962886c1bbf2422d9bfc836642eed377cb40d5ba4e7a5d1c8827edfa47","schema_version":"1.0","event_id":"sha256:560e5a962886c1bbf2422d9bfc836642eed377cb40d5ba4e7a5d1c8827edfa47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCXNOLAHRV5223IH5SA56WAFU6/bundle.json","state_url":"https://pith.science/pith/QCXNOLAHRV5223IH5SA56WAFU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCXNOLAHRV5223IH5SA56WAFU6/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-06-01T16:25:35Z","links":{"resolver":"https://pith.science/pith/QCXNOLAHRV5223IH5SA56WAFU6","bundle":"https://pith.science/pith/QCXNOLAHRV5223IH5SA56WAFU6/bundle.json","state":"https://pith.science/pith/QCXNOLAHRV5223IH5SA56WAFU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCXNOLAHRV5223IH5SA56WAFU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QCXNOLAHRV5223IH5SA56WAFU6","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":"2dcc81af8a0f253df390367388099f94d773bcfe41d371b32fe6d421bba9bbc9","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-03-22T01:46:49Z","title_canon_sha256":"36204a9a4f4a2c2995f4c0b718bcdf1dca43e8d5d5fe0d9de5e8208fcc6c5b4f"},"schema_version":"1.0","source":{"id":"1803.08198","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08198","created_at":"2026-05-18T00:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08198v2","created_at":"2026-05-18T00:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08198","created_at":"2026-05-18T00:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"QCXNOLAHRV52","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QCXNOLAHRV5223IH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QCXNOLAH","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:560e5a962886c1bbf2422d9bfc836642eed377cb40d5ba4e7a5d1c8827edfa47","target":"graph","created_at":"2026-05-18T00:02:12Z","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"},"paper":{"abstract_excerpt":"We propose and analyze a new stochastic gradient method, which we call Stochastic Unbiased Curvature-aided Gradient (SUCAG), for finite sum optimization problems. SUCAG constitutes an unbiased total gradient tracking technique that uses Hessian information to accelerate con- vergence. We analyze our method under the general asynchronous model of computation, in which each function is selected infinitely often with possibly unbounded (but sublinear) delay. For strongly convex problems, we establish linear convergence for the SUCAG method. When the initialization point is sufficiently close to t","authors_text":"Angelia Nedic, Anna Scaglione, Hoi-To Wai, Nikolaos M. Freris","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-03-22T01:46:49Z","title":"SUCAG: Stochastic Unbiased Curvature-aided Gradient Method for Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08198","kind":"arxiv","version":2},"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:41f26effad2394327521ddbf160a5019f1a3a34563a5bc5424885f362943199c","target":"record","created_at":"2026-05-18T00:02:12Z","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":"2dcc81af8a0f253df390367388099f94d773bcfe41d371b32fe6d421bba9bbc9","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-03-22T01:46:49Z","title_canon_sha256":"36204a9a4f4a2c2995f4c0b718bcdf1dca43e8d5d5fe0d9de5e8208fcc6c5b4f"},"schema_version":"1.0","source":{"id":"1803.08198","kind":"arxiv","version":2}},"canonical_sha256":"80aed72c078d7bad6d07ec81df5805a7b44b6aa81cfcfd9ddee7f61f13bb05f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80aed72c078d7bad6d07ec81df5805a7b44b6aa81cfcfd9ddee7f61f13bb05f6","first_computed_at":"2026-05-18T00:02:12.609424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:12.609424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cmAfwnUIEnayzof3vWAWzWhpgSgjHSDmO5h10N4SpDkpHVnIdvA4Gutd+ebROuFGnPOfQfnFENw5KxKVDQrMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:12.610076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08198","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41f26effad2394327521ddbf160a5019f1a3a34563a5bc5424885f362943199c","sha256:560e5a962886c1bbf2422d9bfc836642eed377cb40d5ba4e7a5d1c8827edfa47"],"state_sha256":"0394cbc6f01cd0b9069485a88c62773c18771893ff3ec1a6e355379a41053926"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i3UfkRdm45D9RrXQ1srM/OsL/7PxN5MyDmGLgTl8Oq4794k80Rqroe0b2j6DQ3DZ38IiDYPKNZ92Ve25gQZiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:25:35.989019Z","bundle_sha256":"ad54c94500fede86312f621c2f13c9105341720ee2eda744aa0be3a83fade99e"}}