{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TTIGDOUB244LRWBWASO2NFA7AD","short_pith_number":"pith:TTIGDOUB","schema_version":"1.0","canonical_sha256":"9cd061ba81d738b8d836049da6941f00db6c9302a71c9ab9c2fd30c7a60ed530","source":{"kind":"arxiv","id":"1905.10986","version":1},"attestation_state":"computed","paper":{"title":"Machine learning approach to chance-constrained problems: An algorithm based on the stochastic gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Luk\\'a\\v{s} Adam, Martin Branda","submitted_at":"2019-05-27T06:07:41Z","abstract_excerpt":"We consider chance-constrained problems with discrete random distribution. We aim for problems with a large number of scenarios. We propose a novel method based on the stochastic gradient descent method which performs updates of the decision variable based only on considering a few scenarios. We modify it to handle the non-separable objective. Complexity analysis and a comparison with the standard (batch) gradient descent method is provided. We give three examples with non-convex data and show that our method provides a good solution fast even when the number of scenarios is large."},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.10986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T06:07:41Z","cross_cats_sorted":[],"title_canon_sha256":"91526576760adb0d04ff921982cbe205ab0c33631b0dbef628d1a677fd823e9b","abstract_canon_sha256":"0831eee27717ed961bd8fbf0e033f8f86a1e4435affb09e40c04be27cd3113c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.220641Z","signature_b64":"zfl0SOJDbZtq2ohqkgLzqU3W/s7z0Zx3Q2ReBt6pvPD4xnhdDzHnasFcZZHFwdbEW6LQbLpGtGrjDVNMubkwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cd061ba81d738b8d836049da6941f00db6c9302a71c9ab9c2fd30c7a60ed530","last_reissued_at":"2026-05-17T23:45:03.220098Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.220098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine learning approach to chance-constrained problems: An algorithm based on the stochastic gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Luk\\'a\\v{s} Adam, Martin Branda","submitted_at":"2019-05-27T06:07:41Z","abstract_excerpt":"We consider chance-constrained problems with discrete random distribution. We aim for problems with a large number of scenarios. We propose a novel method based on the stochastic gradient descent method which performs updates of the decision variable based only on considering a few scenarios. We modify it to handle the non-separable objective. Complexity analysis and a comparison with the standard (batch) gradient descent method is provided. We give three examples with non-convex data and show that our method provides a good solution fast even when the number of scenarios is large."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10986","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.10986","created_at":"2026-05-17T23:45:03.220180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10986v1","created_at":"2026-05-17T23:45:03.220180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10986","created_at":"2026-05-17T23:45:03.220180+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTIGDOUB244L","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTIGDOUB244LRWBW","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTIGDOUB","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD","json":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD.json","graph_json":"https://pith.science/api/pith-number/TTIGDOUB244LRWBWASO2NFA7AD/graph.json","events_json":"https://pith.science/api/pith-number/TTIGDOUB244LRWBWASO2NFA7AD/events.json","paper":"https://pith.science/paper/TTIGDOUB"},"agent_actions":{"view_html":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD","download_json":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD.json","view_paper":"https://pith.science/paper/TTIGDOUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10986&json=true","fetch_graph":"https://pith.science/api/pith-number/TTIGDOUB244LRWBWASO2NFA7AD/graph.json","fetch_events":"https://pith.science/api/pith-number/TTIGDOUB244LRWBWASO2NFA7AD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/action/storage_attestation","attest_author":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/action/author_attestation","sign_citation":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/action/citation_signature","submit_replication":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/action/replication_record"}},"created_at":"2026-05-17T23:45:03.220180+00:00","updated_at":"2026-05-17T23:45:03.220180+00:00"}