{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Y5OLNMCN4YBYVSUIEZJZ3CEBL5","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":"e584cce468c89c9da40d588d872a3857c2431b7cabe81300f8d5c101cf9a355e","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T17:26:02Z","title_canon_sha256":"a5527e0b77747f642b5e911c397da13796e6fe1cdf85753ec839d9c787d8ab72"},"schema_version":"1.0","source":{"id":"2506.20630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.20630","created_at":"2026-07-05T11:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"2506.20630v1","created_at":"2026-07-05T11:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20630","created_at":"2026-07-05T11:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"Y5OLNMCN4YBY","created_at":"2026-07-05T11:27:15Z"},{"alias_kind":"pith_short_16","alias_value":"Y5OLNMCN4YBYVSUI","created_at":"2026-07-05T11:27:15Z"},{"alias_kind":"pith_short_8","alias_value":"Y5OLNMCN","created_at":"2026-07-05T11:27:15Z"}],"graph_snapshots":[{"event_id":"sha256:dc45c08faa6c6881aa941fd503d7736c23f4eba6d531bef4282a5ba1c428eed1","target":"graph","created_at":"2026-07-05T11:27:15Z","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/2506.20630/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study a class of stochastic and finite-sum convex optimization problems with deterministic constraints. Existing methods typically aim to find an $\\epsilon$-$expectedly\\ feasible\\ stochastic\\ optimal$ solution, in which the expected constraint violation and expected optimality gap are both within a prescribed tolerance $\\epsilon$. However, in many practical applications, constraints must be nearly satisfied with certainty, rendering such solutions potentially unsuitable due to the risk of substantial violations. To address this issue, we propose stochastic first-order methods","authors_text":"Yifeng Xiao, Zhaosong Lu","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T17:26:02Z","title":"First-order methods for stochastic and finite-sum convex optimization with deterministic constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20630","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:7c57b022ee62c0cd22c0fd282c8f72f5a8a684e12801ed8fc3b6c0ec3cf60d6a","target":"record","created_at":"2026-07-05T11:27:15Z","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":"e584cce468c89c9da40d588d872a3857c2431b7cabe81300f8d5c101cf9a355e","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T17:26:02Z","title_canon_sha256":"a5527e0b77747f642b5e911c397da13796e6fe1cdf85753ec839d9c787d8ab72"},"schema_version":"1.0","source":{"id":"2506.20630","kind":"arxiv","version":1}},"canonical_sha256":"c75cb6b04de6038aca8826539d88815f56d4619c183ccd04e9b181638f045a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c75cb6b04de6038aca8826539d88815f56d4619c183ccd04e9b181638f045a6d","first_computed_at":"2026-07-05T11:27:15.397424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:15.397424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xtC9sFc6xlhrj2idZod73ZMMZdL5+13oMkr/8Jk+KuxAg2WqmG+sEZw+SNEfPfdpLfj+bKVz8xD5hIYDGfTNDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:15.397979Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.20630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c57b022ee62c0cd22c0fd282c8f72f5a8a684e12801ed8fc3b6c0ec3cf60d6a","sha256:dc45c08faa6c6881aa941fd503d7736c23f4eba6d531bef4282a5ba1c428eed1"],"state_sha256":"328757e22ee4643e3a8dcce8a2b829aa4c2ab2ba1b3df22abff8b471722d8e4d"}