{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IRZQA5WS332PYAELVP6XMRQNEO","short_pith_number":"pith:IRZQA5WS","canonical_record":{"source":{"id":"2605.03400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T06:21:12Z","cross_cats_sorted":[],"title_canon_sha256":"c07ed026070189a7302cab001d80ceb30e4a1946da94c0c4239408b92a3a2e31","abstract_canon_sha256":"95b4bb54c30c63ed070050bd0465a424503cf7df016f25aef3088f6c71e416a4"},"schema_version":"1.0"},"canonical_sha256":"44730076d2def4fc008babfd76460d239e336100378a6d3e722f4670db71bb75","source":{"kind":"arxiv","id":"2605.03400","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03400","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03400v2","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03400","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"IRZQA5WS332P","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"IRZQA5WS332PYAEL","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"IRZQA5WS","created_at":"2026-06-29T01:14:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IRZQA5WS332PYAELVP6XMRQNEO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.03400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T06:21:12Z","cross_cats_sorted":[],"title_canon_sha256":"c07ed026070189a7302cab001d80ceb30e4a1946da94c0c4239408b92a3a2e31","abstract_canon_sha256":"95b4bb54c30c63ed070050bd0465a424503cf7df016f25aef3088f6c71e416a4"},"schema_version":"1.0"},"canonical_sha256":"44730076d2def4fc008babfd76460d239e336100378a6d3e722f4670db71bb75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:32.771821Z","signature_b64":"WAJ1MrIlarLeCzlEE0FoKdCisxPsqJlcO+z6yjlnNZGgYl8/456CPtOXnjTNmTS/OvSnrPaAPtvjVPg3EwrEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44730076d2def4fc008babfd76460d239e336100378a6d3e722f4670db71bb75","last_reissued_at":"2026-06-29T01:14:32.771397Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:32.771397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.03400","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-06-29T01:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jH7sfmhjJQVBGSCp3yod2t67dSFBoWx4S8kp7SB0dHTz2kiTktv3JPXkyaJtb1jZ9Gsh2m3qAAD634VDaVyEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:14:42.788522Z"},"content_sha256":"db46596e72e914d65dbe9a980c1c555f3ca002197c7419c187b649b859621b8d","schema_version":"1.0","event_id":"sha256:db46596e72e914d65dbe9a980c1c555f3ca002197c7419c187b649b859621b8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IRZQA5WS332PYAELVP6XMRQNEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quadratic-Approximation-Based Stochastic Approximation Method for Weakly Convex Stochastic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"PMQSopt integrates proximal multipliers with quadratic approximations to reach O(T^{-1/4}) expected convergence on KKT metrics for weakly convex stochastic programs.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benqi Liu, Liwei Zhang, Xiantao Xiao, Yule Zhang","submitted_at":"2026-05-05T06:21:12Z","abstract_excerpt":"We propose a novel stochastic approximation algorithm, termed PMQSopt, for solving weakly convex stochastic optimization problems involving expectation-valued functions. The algorithm is constructed by integrating the proximal method of multipliers with quadratic approximations of the original stochastic problem. We analyze the sample complexity of PMQSopt in terms of the total number of stochastic gradient evaluations required. The convergence of the algorithm is characterized by three metrics associated with the $\\epsilon$-KKT conditions: the average squared norm of the gradient of the Morea"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For each of these metrics, we establish an expected convergence rate of O(T^{-1/4}) after T iterations. Furthermore, we show that with probability at least 1-1/T^{2/3}, the gradient of the Lagrangian satisfies an O(T^{-1/8}) bound; with probability at least 1-2/T^{2/3}, the constraint violation achieves an O(T^{-1/4}) bound; and with probability at least 1-3/T^{2/3}, the complementarity violation attains an O(T^{-1/4}) bound.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"All results are established under two mild conditions: (i) weak convexity of all problem functions, and (ii) the existence of a strictly feasible point.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PMQSopt achieves expected O(T^{-1/4}) convergence rates for three epsilon-KKT metrics after T iterations in weakly convex stochastic programming under weak convexity and strict feasibility assumptions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"PMQSopt integrates proximal multipliers with quadratic approximations to reach O(T^{-1/4}) expected convergence on KKT metrics for weakly convex stochastic programs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9fb4326a9d0327020d98ab3657aebad00238ec39d6ae51c8adce4ed7253c4ea9"},"source":{"id":"2605.03400","kind":"arxiv","version":2},"verdict":{"id":"cb35f1bb-0df7-4a4d-905e-35ccfe4d6037","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T15:49:38.419946Z","strongest_claim":"For each of these metrics, we establish an expected convergence rate of O(T^{-1/4}) after T iterations. Furthermore, we show that with probability at least 1-1/T^{2/3}, the gradient of the Lagrangian satisfies an O(T^{-1/8}) bound; with probability at least 1-2/T^{2/3}, the constraint violation achieves an O(T^{-1/4}) bound; and with probability at least 1-3/T^{2/3}, the complementarity violation attains an O(T^{-1/4}) bound.","one_line_summary":"PMQSopt achieves expected O(T^{-1/4}) convergence rates for three epsilon-KKT metrics after T iterations in weakly convex stochastic programming under weak convexity and strict feasibility assumptions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"All results are established under two mild conditions: (i) weak convexity of all problem functions, and (ii) the existence of a strictly feasible point.","pith_extraction_headline":"PMQSopt integrates proximal multipliers with quadratic approximations to reach O(T^{-1/4}) expected convergence on KKT metrics for weakly convex stochastic programs."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03400/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T13:42:12.422534Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T01:01:22.227077Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:26:30.524683Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6eb530f47444ed604cdfd6efd25e346c8473c7727099cc6f37243e0a401d4404"},"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":"cb35f1bb-0df7-4a4d-905e-35ccfe4d6037"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-29T01:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O897oDuFVoWAiZqiRrORbMZA81wuWBtAVXwJldZxyTH6xdMEUEUqtS26ar4OtxE2PjA9dxmtdC7Ji8HWE7HUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:14:42.789016Z"},"content_sha256":"2cf1b676332c3517b5ae239608ce7edca02b2a5d360824a90e747e405e90444f","schema_version":"1.0","event_id":"sha256:2cf1b676332c3517b5ae239608ce7edca02b2a5d360824a90e747e405e90444f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRZQA5WS332PYAELVP6XMRQNEO/bundle.json","state_url":"https://pith.science/pith/IRZQA5WS332PYAELVP6XMRQNEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRZQA5WS332PYAELVP6XMRQNEO/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-29T18:14:42Z","links":{"resolver":"https://pith.science/pith/IRZQA5WS332PYAELVP6XMRQNEO","bundle":"https://pith.science/pith/IRZQA5WS332PYAELVP6XMRQNEO/bundle.json","state":"https://pith.science/pith/IRZQA5WS332PYAELVP6XMRQNEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRZQA5WS332PYAELVP6XMRQNEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IRZQA5WS332PYAELVP6XMRQNEO","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":"95b4bb54c30c63ed070050bd0465a424503cf7df016f25aef3088f6c71e416a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T06:21:12Z","title_canon_sha256":"c07ed026070189a7302cab001d80ceb30e4a1946da94c0c4239408b92a3a2e31"},"schema_version":"1.0","source":{"id":"2605.03400","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03400","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03400v2","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03400","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"IRZQA5WS332P","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"IRZQA5WS332PYAEL","created_at":"2026-06-29T01:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"IRZQA5WS","created_at":"2026-06-29T01:14:32Z"}],"graph_snapshots":[{"event_id":"sha256:2cf1b676332c3517b5ae239608ce7edca02b2a5d360824a90e747e405e90444f","target":"graph","created_at":"2026-06-29T01:14:32Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For each of these metrics, we establish an expected convergence rate of O(T^{-1/4}) after T iterations. Furthermore, we show that with probability at least 1-1/T^{2/3}, the gradient of the Lagrangian satisfies an O(T^{-1/8}) bound; with probability at least 1-2/T^{2/3}, the constraint violation achieves an O(T^{-1/4}) bound; and with probability at least 1-3/T^{2/3}, the complementarity violation attains an O(T^{-1/4}) bound."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"All results are established under two mild conditions: (i) weak convexity of all problem functions, and (ii) the existence of a strictly feasible point."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PMQSopt achieves expected O(T^{-1/4}) convergence rates for three epsilon-KKT metrics after T iterations in weakly convex stochastic programming under weak convexity and strict feasibility assumptions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"PMQSopt integrates proximal multipliers with quadratic approximations to reach O(T^{-1/4}) expected convergence on KKT metrics for weakly convex stochastic programs."}],"snapshot_sha256":"9fb4326a9d0327020d98ab3657aebad00238ec39d6ae51c8adce4ed7253c4ea9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T13:42:12.422534Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T01:01:22.227077Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:26:30.524683Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03400/integrity.json","findings":[],"snapshot_sha256":"6eb530f47444ed604cdfd6efd25e346c8473c7727099cc6f37243e0a401d4404","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel stochastic approximation algorithm, termed PMQSopt, for solving weakly convex stochastic optimization problems involving expectation-valued functions. The algorithm is constructed by integrating the proximal method of multipliers with quadratic approximations of the original stochastic problem. We analyze the sample complexity of PMQSopt in terms of the total number of stochastic gradient evaluations required. The convergence of the algorithm is characterized by three metrics associated with the $\\epsilon$-KKT conditions: the average squared norm of the gradient of the Morea","authors_text":"Benqi Liu, Liwei Zhang, Xiantao Xiao, Yule Zhang","cross_cats":[],"headline":"PMQSopt integrates proximal multipliers with quadratic approximations to reach O(T^{-1/4}) expected convergence on KKT metrics for weakly convex stochastic programs.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T06:21:12Z","title":"A Quadratic-Approximation-Based Stochastic Approximation Method for Weakly Convex Stochastic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03400","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T15:49:38.419946Z","id":"cb35f1bb-0df7-4a4d-905e-35ccfe4d6037","model_set":{"reader":"grok-4.3"},"one_line_summary":"PMQSopt achieves expected O(T^{-1/4}) convergence rates for three epsilon-KKT metrics after T iterations in weakly convex stochastic programming under weak convexity and strict feasibility assumptions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"PMQSopt integrates proximal multipliers with quadratic approximations to reach O(T^{-1/4}) expected convergence on KKT metrics for weakly convex stochastic programs.","strongest_claim":"For each of these metrics, we establish an expected convergence rate of O(T^{-1/4}) after T iterations. Furthermore, we show that with probability at least 1-1/T^{2/3}, the gradient of the Lagrangian satisfies an O(T^{-1/8}) bound; with probability at least 1-2/T^{2/3}, the constraint violation achieves an O(T^{-1/4}) bound; and with probability at least 1-3/T^{2/3}, the complementarity violation attains an O(T^{-1/4}) bound.","weakest_assumption":"All results are established under two mild conditions: (i) weak convexity of all problem functions, and (ii) the existence of a strictly feasible point."}},"verdict_id":"cb35f1bb-0df7-4a4d-905e-35ccfe4d6037"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:db46596e72e914d65dbe9a980c1c555f3ca002197c7419c187b649b859621b8d","target":"record","created_at":"2026-06-29T01:14:32Z","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":"95b4bb54c30c63ed070050bd0465a424503cf7df016f25aef3088f6c71e416a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-05T06:21:12Z","title_canon_sha256":"c07ed026070189a7302cab001d80ceb30e4a1946da94c0c4239408b92a3a2e31"},"schema_version":"1.0","source":{"id":"2605.03400","kind":"arxiv","version":2}},"canonical_sha256":"44730076d2def4fc008babfd76460d239e336100378a6d3e722f4670db71bb75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44730076d2def4fc008babfd76460d239e336100378a6d3e722f4670db71bb75","first_computed_at":"2026-06-29T01:14:32.771397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-29T01:14:32.771397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WAJ1MrIlarLeCzlEE0FoKdCisxPsqJlcO+z6yjlnNZGgYl8/456CPtOXnjTNmTS/OvSnrPaAPtvjVPg3EwrEBA==","signature_status":"signed_v1","signed_at":"2026-06-29T01:14:32.771821Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03400","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db46596e72e914d65dbe9a980c1c555f3ca002197c7419c187b649b859621b8d","sha256:2cf1b676332c3517b5ae239608ce7edca02b2a5d360824a90e747e405e90444f"],"state_sha256":"4230d3c1a6b1c9fe9171c239201f06bd6ec479e1afa4de5adc54709db66cea58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90asPEvkO4MVHzscmvdRPW8pTEw0vpneK/LFk5Xg+ffqLWzUzOLdL+vVa3id/An6p89ollpQKpvh4gzyUSuXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:14:42.791234Z","bundle_sha256":"3f57c4deafdd76ab7f741df49c3794a14129408778ad81dc87590557116b8f88"}}