{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z23LILDF5U5HBO4NVL424HDENB","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":"56d9e3118eed16e76690e7aa531fecc3c45b977cc6e9ed9dacd0da206f424be1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T08:36:29Z","title_canon_sha256":"3b5bcbd3289987dd578d97322cc21c896a6c00806f15d43636cba49b9042c8eb"},"schema_version":"1.0","source":{"id":"2605.16875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16875","created_at":"2026-05-20T00:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16875v1","created_at":"2026-05-20T00:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16875","created_at":"2026-05-20T00:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"Z23LILDF5U5H","created_at":"2026-05-20T00:03:27Z"},{"alias_kind":"pith_short_16","alias_value":"Z23LILDF5U5HBO4N","created_at":"2026-05-20T00:03:27Z"},{"alias_kind":"pith_short_8","alias_value":"Z23LILDF","created_at":"2026-05-20T00:03:27Z"}],"graph_snapshots":[{"event_id":"sha256:e51ed45a2f523f65d6b17278d4a0351a99945cadba7e58cedaf3e09d73957cc4","target":"graph","created_at":"2026-05-20T00:03:27Z","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":"Stochastic optimization problems can be motivated from a statistical perspective and a statistical learning perspective, where the goal is to maximize the log-likelihood or minimize the population risk, using offline (Monte Carlo / Sample Average Approximation) and online (Stochastic Approximation) approaches."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that the two described approaches (offline Monte Carlo/SAA and online SA) are the primary or sufficient ways to solve the expectation minimization problems arising in statistical settings, without needing additional context or comparisons."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper motivates stochastic optimization problems from statistical perspectives and describes offline and online approaches to solve expectation minimization problems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Stochastic optimization problems arise when maximizing log-likelihood or minimizing population risk in statistical estimation and learning."}],"snapshot_sha256":"c2190f61e6fdafc87b2b6c53cae9892933cd0a668db85ff27838fa14e28decd0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8d8bc1826c88e7d60e050544a0bc2adb59537f71a8b068aa227b98b2ad746044"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.194051Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:11:39.033068Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.295057Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.371853Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16875/integrity.json","findings":[],"snapshot_sha256":"c71959a06eb510bbd8ba0e65caad37d465eebe397cadb838a06570f2a285ec38","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper aims to motivate stochastic optimization problems from a statistical perspective and a statistical learning perspective, where the goal is to maximize the log-likelihood or minimize the population risk. We briefly describe the two main approaches: offline (Monte Carlo / Sample Average Approximation) and online (Stochastic Approximation) approaches -- to solve the expectation minimization problems.","authors_text":"Alexander Gasnikov, Arutyun Avetisyan, Darina Dvinskikh, Denis Turdakov, Nazarii Tupitsa, Vladimir Temlyakov","cross_cats":[],"headline":"Stochastic optimization problems arise when maximizing log-likelihood or minimizing population risk in statistical estimation and learning.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T08:36:29Z","title":"Stochastic Optimization and Data Science"},"references":{"count":162,"internal_anchors":5,"resolved_work":162,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Journal of machine learning research , volume=","work_id":"b92f59a6-b9c7-4bb7-8f32-ab8c247fef7b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Mathematical Programming , volume=","work_id":"0e35fe4e-9662-4620-8eef-f240d3dc4ffa","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Optimization Methods and Software , volume=","work_id":"f5badf57-3741-44ae-acf3-6d9956c9776c","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The Twelfth International Conference on Learning Representations , year=","work_id":"c3f8c949-39ff-44a0-8cc2-79e1a4ed6bcb","year":null},{"cited_arxiv_id":"","doi":"10.1137/070704277","is_internal_anchor":false,"ref_index":5,"title":"Robust Stochastic Approximation Approach to Stochastic Programming","work_id":"b5eb7dca-6883-4820-8fa0-98092f39f6ac","year":2009}],"snapshot_sha256":"efd0bc721f60595861312d006770d07e296bd21b1de207e03c49f1a6108551a3"},"source":{"id":"2605.16875","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:04:14.358367Z","id":"a44a8c58-a70c-4dae-9ff4-263da3d4c3e6","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper motivates stochastic optimization problems from statistical perspectives and describes offline and online approaches to solve expectation minimization problems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Stochastic optimization problems arise when maximizing log-likelihood or minimizing population risk in statistical estimation and learning.","strongest_claim":"Stochastic optimization problems can be motivated from a statistical perspective and a statistical learning perspective, where the goal is to maximize the log-likelihood or minimize the population risk, using offline (Monte Carlo / Sample Average Approximation) and online (Stochastic Approximation) approaches.","weakest_assumption":"The assumption that the two described approaches (offline Monte Carlo/SAA and online SA) are the primary or sufficient ways to solve the expectation minimization problems arising in statistical settings, without needing additional context or comparisons."}},"verdict_id":"a44a8c58-a70c-4dae-9ff4-263da3d4c3e6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6bd45583468b9c78624bcc30e230b5f9f41ba8297b6b37a4b9f8b830380a21ec","target":"record","created_at":"2026-05-20T00:03:27Z","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":"56d9e3118eed16e76690e7aa531fecc3c45b977cc6e9ed9dacd0da206f424be1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T08:36:29Z","title_canon_sha256":"3b5bcbd3289987dd578d97322cc21c896a6c00806f15d43636cba49b9042c8eb"},"schema_version":"1.0","source":{"id":"2605.16875","kind":"arxiv","version":1}},"canonical_sha256":"ceb6b42c65ed3a70bb8daaf9ae1c64684aa770497ebbd16da98b908baf7f8b3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceb6b42c65ed3a70bb8daaf9ae1c64684aa770497ebbd16da98b908baf7f8b3f","first_computed_at":"2026-05-20T00:03:27.693041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:27.693041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GyfdL8ItDwtdR3f8gl0iNN/QdWcO9rzKWXhiy6ijNsyZMs8AUuiZjbBckbXOcYFmCm7wDU872Bv1a1J9y9lmBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:27.693773Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bd45583468b9c78624bcc30e230b5f9f41ba8297b6b37a4b9f8b830380a21ec","sha256:e51ed45a2f523f65d6b17278d4a0351a99945cadba7e58cedaf3e09d73957cc4"],"state_sha256":"66ac1fa9c118dbde7a388a37974845f53e2be3a3bcc2d5fc15c68b6be213da8c"}