{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TTIGDOUB244LRWBWASO2NFA7AD","short_pith_number":"pith:TTIGDOUB","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"},"canonical_sha256":"9cd061ba81d738b8d836049da6941f00db6c9302a71c9ab9c2fd30c7a60ed530","source":{"kind":"arxiv","id":"1905.10986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10986","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10986v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10986","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"TTIGDOUB244L","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TTIGDOUB244LRWBW","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TTIGDOUB","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TTIGDOUB244LRWBWASO2NFA7AD","target":"record","payload":{"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"},"canonical_sha256":"9cd061ba81d738b8d836049da6941f00db6c9302a71c9ab9c2fd30c7a60ed530","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"},"source_kind":"arxiv","source_id":"1905.10986","source_version":1,"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-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KoCMclrMUPyhLctztd18C8LNgbg6A4Xk1S9H7TSzceS4jap6TgpqetMVm3KOIQX4/z9FrtmHeCSzOVUku4kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:41:43.272388Z"},"content_sha256":"9f3dd7f129a96266d784f4da5806bd1e516e9fc51deb41f78ae93d72b2a13162","schema_version":"1.0","event_id":"sha256:9f3dd7f129a96266d784f4da5806bd1e516e9fc51deb41f78ae93d72b2a13162"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TTIGDOUB244LRWBWASO2NFA7AD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i22BYVpHZvRXSlOs9rfsC9vWjQefjGVREBNLl4jPb7Cw0k/gWs9+JvTz2KYTWjsR7yIC7bpAqdOjhqOytwrOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:41:43.273069Z"},"content_sha256":"c9eb264d77f563b22a04caf53a9cc92d451ccb3bc5107a4f31aef572c6d745b5","schema_version":"1.0","event_id":"sha256:c9eb264d77f563b22a04caf53a9cc92d451ccb3bc5107a4f31aef572c6d745b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/bundle.json","state_url":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTIGDOUB244LRWBWASO2NFA7AD/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-05-22T06:41:43Z","links":{"resolver":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD","bundle":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/bundle.json","state":"https://pith.science/pith/TTIGDOUB244LRWBWASO2NFA7AD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTIGDOUB244LRWBWASO2NFA7AD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TTIGDOUB244LRWBWASO2NFA7AD","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":"0831eee27717ed961bd8fbf0e033f8f86a1e4435affb09e40c04be27cd3113c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T06:07:41Z","title_canon_sha256":"91526576760adb0d04ff921982cbe205ab0c33631b0dbef628d1a677fd823e9b"},"schema_version":"1.0","source":{"id":"1905.10986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10986","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10986v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10986","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"TTIGDOUB244L","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TTIGDOUB244LRWBW","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TTIGDOUB","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:c9eb264d77f563b22a04caf53a9cc92d451ccb3bc5107a4f31aef572c6d745b5","target":"graph","created_at":"2026-05-17T23:45:03Z","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"},"paper":{"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.","authors_text":"Luk\\'a\\v{s} Adam, Martin Branda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T06:07:41Z","title":"Machine learning approach to chance-constrained problems: An algorithm based on the stochastic gradient descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10986","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:9f3dd7f129a96266d784f4da5806bd1e516e9fc51deb41f78ae93d72b2a13162","target":"record","created_at":"2026-05-17T23:45:03Z","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":"0831eee27717ed961bd8fbf0e033f8f86a1e4435affb09e40c04be27cd3113c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T06:07:41Z","title_canon_sha256":"91526576760adb0d04ff921982cbe205ab0c33631b0dbef628d1a677fd823e9b"},"schema_version":"1.0","source":{"id":"1905.10986","kind":"arxiv","version":1}},"canonical_sha256":"9cd061ba81d738b8d836049da6941f00db6c9302a71c9ab9c2fd30c7a60ed530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cd061ba81d738b8d836049da6941f00db6c9302a71c9ab9c2fd30c7a60ed530","first_computed_at":"2026-05-17T23:45:03.220098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.220098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfl0SOJDbZtq2ohqkgLzqU3W/s7z0Zx3Q2ReBt6pvPD4xnhdDzHnasFcZZHFwdbEW6LQbLpGtGrjDVNMubkwAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.220641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f3dd7f129a96266d784f4da5806bd1e516e9fc51deb41f78ae93d72b2a13162","sha256:c9eb264d77f563b22a04caf53a9cc92d451ccb3bc5107a4f31aef572c6d745b5"],"state_sha256":"cfeef38d600d57e4111b0bbeedcb1212f7827c359c646275e2b05bccfd4a7f5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcdTQBDfl2Ni/6X+iP1j01f78/k3/KPiACHObp2W7l0vVuWF0nJLAQFW0lSZl7uoAnrEcakiw0CU19h5dl3OCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T06:41:43.276916Z","bundle_sha256":"5ce4313650f2d6ca1e11fe1a7d40e08cd174e06d9fca86ad8cb323a2deec0b75"}}