{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Z23LILDF5U5HBO4NVL424HDENB","short_pith_number":"pith:Z23LILDF","schema_version":"1.0","canonical_sha256":"ceb6b42c65ed3a70bb8daaf9ae1c64684aa770497ebbd16da98b908baf7f8b3f","source":{"kind":"arxiv","id":"2605.16875","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Optimization and Data Science","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Stochastic optimization problems arise when maximizing log-likelihood or minimizing population risk in statistical estimation and learning.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Arutyun Avetisyan, Darina Dvinskikh, Denis Turdakov, Nazarii Tupitsa, Vladimir Temlyakov","submitted_at":"2026-05-16T08:36:29Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16875","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T08:36:29Z","cross_cats_sorted":[],"title_canon_sha256":"3b5bcbd3289987dd578d97322cc21c896a6c00806f15d43636cba49b9042c8eb","abstract_canon_sha256":"56d9e3118eed16e76690e7aa531fecc3c45b977cc6e9ed9dacd0da206f424be1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:27.693773Z","signature_b64":"GyfdL8ItDwtdR3f8gl0iNN/QdWcO9rzKWXhiy6ijNsyZMs8AUuiZjbBckbXOcYFmCm7wDU872Bv1a1J9y9lmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb6b42c65ed3a70bb8daaf9ae1c64684aa770497ebbd16da98b908baf7f8b3f","last_reissued_at":"2026-05-20T00:03:27.693041Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:27.693041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Optimization and Data Science","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Stochastic optimization problems arise when maximizing log-likelihood or minimizing population risk in statistical estimation and learning.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Arutyun Avetisyan, Darina Dvinskikh, Denis Turdakov, Nazarii Tupitsa, Vladimir Temlyakov","submitted_at":"2026-05-16T08:36:29Z","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."},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper motivates stochastic optimization problems from statistical perspectives and describes offline and online approaches to solve expectation minimization problems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Stochastic optimization problems arise when maximizing log-likelihood or minimizing population risk in statistical estimation and learning.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c2190f61e6fdafc87b2b6c53cae9892933cd0a668db85ff27838fa14e28decd0"},"source":{"id":"2605.16875","kind":"arxiv","version":1},"verdict":{"id":"a44a8c58-a70c-4dae-9ff4-263da3d4c3e6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:04:14.358367Z","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.","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","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.","pith_extraction_headline":"Stochastic optimization problems arise when maximizing log-likelihood or minimizing population risk in statistical estimation and learning."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16875/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"c71959a06eb510bbd8ba0e65caad37d465eebe397cadb838a06570f2a285ec38"},"references":{"count":162,"sample":[{"doi":"","year":null,"title":"Journal of machine learning research , volume=","work_id":"b92f59a6-b9c7-4bb7-8f32-ab8c247fef7b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Mathematical Programming , volume=","work_id":"0e35fe4e-9662-4620-8eef-f240d3dc4ffa","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Optimization Methods and Software , volume=","work_id":"f5badf57-3741-44ae-acf3-6d9956c9776c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The Twelfth International Conference on Learning Representations , year=","work_id":"c3f8c949-39ff-44a0-8cc2-79e1a4ed6bcb","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/070704277","year":2009,"title":"Robust Stochastic Approximation Approach to Stochastic Programming","work_id":"b5eb7dca-6883-4820-8fa0-98092f39f6ac","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":162,"snapshot_sha256":"efd0bc721f60595861312d006770d07e296bd21b1de207e03c49f1a6108551a3","internal_anchors":5},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8d8bc1826c88e7d60e050544a0bc2adb59537f71a8b068aa227b98b2ad746044"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.16875","created_at":"2026-05-20T00:03:27.693190+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16875v1","created_at":"2026-05-20T00:03:27.693190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16875","created_at":"2026-05-20T00:03:27.693190+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z23LILDF5U5H","created_at":"2026-05-20T00:03:27.693190+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z23LILDF5U5HBO4N","created_at":"2026-05-20T00:03:27.693190+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z23LILDF","created_at":"2026-05-20T00:03:27.693190+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB","json":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB.json","graph_json":"https://pith.science/api/pith-number/Z23LILDF5U5HBO4NVL424HDENB/graph.json","events_json":"https://pith.science/api/pith-number/Z23LILDF5U5HBO4NVL424HDENB/events.json","paper":"https://pith.science/paper/Z23LILDF"},"agent_actions":{"view_html":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB","download_json":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB.json","view_paper":"https://pith.science/paper/Z23LILDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16875&json=true","fetch_graph":"https://pith.science/api/pith-number/Z23LILDF5U5HBO4NVL424HDENB/graph.json","fetch_events":"https://pith.science/api/pith-number/Z23LILDF5U5HBO4NVL424HDENB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB/action/storage_attestation","attest_author":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB/action/author_attestation","sign_citation":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB/action/citation_signature","submit_replication":"https://pith.science/pith/Z23LILDF5U5HBO4NVL424HDENB/action/replication_record"}},"created_at":"2026-05-20T00:03:27.693190+00:00","updated_at":"2026-05-20T00:03:27.693190+00:00"}