{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4ADZLYQDI3ESLA325WATACMVNO","short_pith_number":"pith:4ADZLYQD","schema_version":"1.0","canonical_sha256":"e00795e20346c925837aed813009956b9f6201b54b02443b9fb420f4081e8d07","source":{"kind":"arxiv","id":"1801.00500","version":1},"attestation_state":"computed","paper":{"title":"Chance-Constrained Outage Scheduling using a Machine Learning Proxy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Elad Gilboa, Gal Dalal, Louis Wehenkel, Shie Mannor","submitted_at":"2018-01-01T19:56:33Z","abstract_excerpt":"Outage scheduling aims at defining, over a horizon of several months to years, when different components needing maintenance should be taken out of operation. Its objective is to minimize operation-cost expectation while satisfying reliability-related constraints. We propose a distributed scenario-based chance-constrained optimization formulation for this problem. To tackle tractability issues arising in large networks, we use machine learning to build a proxy for predicting outcomes of power system operation processes in this context. On the IEEE-RTS79 and IEEE-RTS96 networks, our solution ob"},"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":"1801.00500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-01-01T19:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"549435cca980206bc36c7058ab7f91f10d0c7e37445082f03a43dee1bdcc8ecd","abstract_canon_sha256":"4c9fe16df49f3cc860c91e04f893c8d24b5c8901e83a8f0a0316b7fd56b799d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:53.189133Z","signature_b64":"bmvGcqczyOQXuND4IirEWFk8942HeMi6kiPy9G/Gi9Z80d0TwaQmZwYYMP4boNZMATL3Wg6hDlZ1YWNUTsK3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e00795e20346c925837aed813009956b9f6201b54b02443b9fb420f4081e8d07","last_reissued_at":"2026-05-18T00:26:53.188419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:53.188419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chance-Constrained Outage Scheduling using a Machine Learning Proxy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Elad Gilboa, Gal Dalal, Louis Wehenkel, Shie Mannor","submitted_at":"2018-01-01T19:56:33Z","abstract_excerpt":"Outage scheduling aims at defining, over a horizon of several months to years, when different components needing maintenance should be taken out of operation. Its objective is to minimize operation-cost expectation while satisfying reliability-related constraints. We propose a distributed scenario-based chance-constrained optimization formulation for this problem. To tackle tractability issues arising in large networks, we use machine learning to build a proxy for predicting outcomes of power system operation processes in this context. On the IEEE-RTS79 and IEEE-RTS96 networks, our solution ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00500","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":"1801.00500","created_at":"2026-05-18T00:26:53.188548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00500v1","created_at":"2026-05-18T00:26:53.188548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00500","created_at":"2026-05-18T00:26:53.188548+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ADZLYQDI3ES","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ADZLYQDI3ESLA32","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ADZLYQD","created_at":"2026-05-18T12:32:05.422762+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/4ADZLYQDI3ESLA325WATACMVNO","json":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO.json","graph_json":"https://pith.science/api/pith-number/4ADZLYQDI3ESLA325WATACMVNO/graph.json","events_json":"https://pith.science/api/pith-number/4ADZLYQDI3ESLA325WATACMVNO/events.json","paper":"https://pith.science/paper/4ADZLYQD"},"agent_actions":{"view_html":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO","download_json":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO.json","view_paper":"https://pith.science/paper/4ADZLYQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00500&json=true","fetch_graph":"https://pith.science/api/pith-number/4ADZLYQDI3ESLA325WATACMVNO/graph.json","fetch_events":"https://pith.science/api/pith-number/4ADZLYQDI3ESLA325WATACMVNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/action/storage_attestation","attest_author":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/action/author_attestation","sign_citation":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/action/citation_signature","submit_replication":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/action/replication_record"}},"created_at":"2026-05-18T00:26:53.188548+00:00","updated_at":"2026-05-18T00:26:53.188548+00:00"}