{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:V3ISIJXUHCIEAMHWHSM7E5Y2GO","short_pith_number":"pith:V3ISIJXU","canonical_record":{"source":{"id":"1603.04547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-15T03:59:16Z","cross_cats_sorted":[],"title_canon_sha256":"07d751b4019fc906cdd2cc0c598e7df38fd2f72a06114397bca68ce505c54096","abstract_canon_sha256":"58550fab687f27c04fa3824903a1472cba1d0771aab1b2ed49f9758426891f3b"},"schema_version":"1.0"},"canonical_sha256":"aed12426f438904030f63c99f2771a33b0080ba086811fc2752bc7082d1d0722","source":{"kind":"arxiv","id":"1603.04547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04547","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04547v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04547","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"V3ISIJXUHCIE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V3ISIJXUHCIEAMHW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V3ISIJXU","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:V3ISIJXUHCIEAMHWHSM7E5Y2GO","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-15T03:59:16Z","cross_cats_sorted":[],"title_canon_sha256":"07d751b4019fc906cdd2cc0c598e7df38fd2f72a06114397bca68ce505c54096","abstract_canon_sha256":"58550fab687f27c04fa3824903a1472cba1d0771aab1b2ed49f9758426891f3b"},"schema_version":"1.0"},"canonical_sha256":"aed12426f438904030f63c99f2771a33b0080ba086811fc2752bc7082d1d0722","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.604592Z","signature_b64":"Gg5fzY5/2yNsqKzfhTdT8kYr2y0HO1qn9NakfD/7lywznLkW1w8UKrBzA4g/52Wd8uV1gJLs/gdhcEOFC1PzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aed12426f438904030f63c99f2771a33b0080ba086811fc2752bc7082d1d0722","last_reissued_at":"2026-05-18T01:19:04.604004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.604004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04547","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-05-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSHLnDigndkWvKI8RIUn96cLl6XnUROQumvafgGoZgaQw9fNtjEeGR3SdHCLCet3rgn7+JNCh1+wGAstNMliDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:23:30.873951Z"},"content_sha256":"c15392e135c81f01242500b4de84d6aa4cb857a040dc4a93c2ad217039fc5993","schema_version":"1.0","event_id":"sha256:c15392e135c81f01242500b4de84d6aa4cb857a040dc4a93c2ad217039fc5993"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:V3ISIJXUHCIEAMHWHSM7E5Y2GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic quasi-Newton methods for non-strongly convex problems: convergence and rate analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedi\\'c, Farzad Yousefian, Uday V. Shanbha","submitted_at":"2016-03-15T03:59:16Z","abstract_excerpt":"Motivated by applications in optimization and machine learning, we consider stochastic quasi-Newton (SQN) methods for solving stochastic optimization problems. In the literature, the convergence analysis of these algorithms relies on strong convexity of the objective function. To our knowledge, no theoretical analysis is provided for the rate statements in the absence of this assumption. Motivated by this gap, we allow the objective function to be merely convex and we develop a cyclic regularized SQN method where the gradient mapping and the Hessian approximation matrix are both regularized at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04547","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":""},"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-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7r1zPdhXIzg4Y2ssRNWbq/HGJmrL9B/BgHEQ77Yj2aICFBw7vsRhbXiIXzE8EXjMMXW/j7PejQSqkZZO1SQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:23:30.874735Z"},"content_sha256":"fd1ead0eed3a3786a2d7cfce02ad78ed9ab7336acdfc3771d59eab2b92c140c4","schema_version":"1.0","event_id":"sha256:fd1ead0eed3a3786a2d7cfce02ad78ed9ab7336acdfc3771d59eab2b92c140c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3ISIJXUHCIEAMHWHSM7E5Y2GO/bundle.json","state_url":"https://pith.science/pith/V3ISIJXUHCIEAMHWHSM7E5Y2GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3ISIJXUHCIEAMHWHSM7E5Y2GO/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-12T04:23:30Z","links":{"resolver":"https://pith.science/pith/V3ISIJXUHCIEAMHWHSM7E5Y2GO","bundle":"https://pith.science/pith/V3ISIJXUHCIEAMHWHSM7E5Y2GO/bundle.json","state":"https://pith.science/pith/V3ISIJXUHCIEAMHWHSM7E5Y2GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3ISIJXUHCIEAMHWHSM7E5Y2GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V3ISIJXUHCIEAMHWHSM7E5Y2GO","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":"58550fab687f27c04fa3824903a1472cba1d0771aab1b2ed49f9758426891f3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-15T03:59:16Z","title_canon_sha256":"07d751b4019fc906cdd2cc0c598e7df38fd2f72a06114397bca68ce505c54096"},"schema_version":"1.0","source":{"id":"1603.04547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04547","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04547v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04547","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"V3ISIJXUHCIE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V3ISIJXUHCIEAMHW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V3ISIJXU","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:fd1ead0eed3a3786a2d7cfce02ad78ed9ab7336acdfc3771d59eab2b92c140c4","target":"graph","created_at":"2026-05-18T01:19:04Z","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":"Motivated by applications in optimization and machine learning, we consider stochastic quasi-Newton (SQN) methods for solving stochastic optimization problems. In the literature, the convergence analysis of these algorithms relies on strong convexity of the objective function. To our knowledge, no theoretical analysis is provided for the rate statements in the absence of this assumption. Motivated by this gap, we allow the objective function to be merely convex and we develop a cyclic regularized SQN method where the gradient mapping and the Hessian approximation matrix are both regularized at","authors_text":"Angelia Nedi\\'c, Farzad Yousefian, Uday V. Shanbha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-15T03:59:16Z","title":"Stochastic quasi-Newton methods for non-strongly convex problems: convergence and rate analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04547","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:c15392e135c81f01242500b4de84d6aa4cb857a040dc4a93c2ad217039fc5993","target":"record","created_at":"2026-05-18T01:19:04Z","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":"58550fab687f27c04fa3824903a1472cba1d0771aab1b2ed49f9758426891f3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-15T03:59:16Z","title_canon_sha256":"07d751b4019fc906cdd2cc0c598e7df38fd2f72a06114397bca68ce505c54096"},"schema_version":"1.0","source":{"id":"1603.04547","kind":"arxiv","version":1}},"canonical_sha256":"aed12426f438904030f63c99f2771a33b0080ba086811fc2752bc7082d1d0722","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aed12426f438904030f63c99f2771a33b0080ba086811fc2752bc7082d1d0722","first_computed_at":"2026-05-18T01:19:04.604004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.604004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gg5fzY5/2yNsqKzfhTdT8kYr2y0HO1qn9NakfD/7lywznLkW1w8UKrBzA4g/52Wd8uV1gJLs/gdhcEOFC1PzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.604592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c15392e135c81f01242500b4de84d6aa4cb857a040dc4a93c2ad217039fc5993","sha256:fd1ead0eed3a3786a2d7cfce02ad78ed9ab7336acdfc3771d59eab2b92c140c4"],"state_sha256":"f75cb181ce3a4120485e682e8e905d4fa8dcd8eba8474c72a9da2994ca25769c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oj4zyI1S/jAYTsjTQ76WvUC1WvmYWtPy7XqclHEfpUehUBSk8hCBWFgBrIj6MYkX5ar/t/aZSXJ+xkjxE7Z8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T04:23:30.879108Z","bundle_sha256":"7c4b4b0528f0a551f97c46bd20a7729cb242164bcc7968dd44abf99445dba06b"}}