{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4ADZLYQDI3ESLA325WATACMVNO","short_pith_number":"pith:4ADZLYQD","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"},"canonical_sha256":"e00795e20346c925837aed813009956b9f6201b54b02443b9fb420f4081e8d07","source":{"kind":"arxiv","id":"1801.00500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00500","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00500v1","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00500","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"4ADZLYQDI3ES","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ADZLYQDI3ESLA32","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ADZLYQD","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4ADZLYQDI3ESLA325WATACMVNO","target":"record","payload":{"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"},"canonical_sha256":"e00795e20346c925837aed813009956b9f6201b54b02443b9fb420f4081e8d07","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"},"source_kind":"arxiv","source_id":"1801.00500","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-18T00:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BeaY8ZweA6EdICk6039jepB4mxaT7FP3mDg4Eswn8L286W4Y9/+T2SD8J3gvHj9WVK9dmqwKPhM6XUCvpLxLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:56.936013Z"},"content_sha256":"ec16c65a5a76a74c2d79db8d1c1c146bf1f30eabfdb52e99a5924b44b5f9ee91","schema_version":"1.0","event_id":"sha256:ec16c65a5a76a74c2d79db8d1c1c146bf1f30eabfdb52e99a5924b44b5f9ee91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4ADZLYQDI3ESLA325WATACMVNO","target":"graph","payload":{"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"},"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-18T00:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmRew/iuXGxX2VyO/S1D+H6w9BCk6wVTgMQ9371GEL6EBlkc6giBuBMqlOHFb9o3YC34tq0FZymjkW36ANPfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:56.936712Z"},"content_sha256":"b939e588c3698b839bfb3d4f4d05ad31566dcb934f26d569a8b11b1f0849060a","schema_version":"1.0","event_id":"sha256:b939e588c3698b839bfb3d4f4d05ad31566dcb934f26d569a8b11b1f0849060a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/bundle.json","state_url":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ADZLYQDI3ESLA325WATACMVNO/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-29T15:09:56Z","links":{"resolver":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO","bundle":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/bundle.json","state":"https://pith.science/pith/4ADZLYQDI3ESLA325WATACMVNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ADZLYQDI3ESLA325WATACMVNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4ADZLYQDI3ESLA325WATACMVNO","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":"4c9fe16df49f3cc860c91e04f893c8d24b5c8901e83a8f0a0316b7fd56b799d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-01-01T19:56:33Z","title_canon_sha256":"549435cca980206bc36c7058ab7f91f10d0c7e37445082f03a43dee1bdcc8ecd"},"schema_version":"1.0","source":{"id":"1801.00500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00500","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00500v1","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00500","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"4ADZLYQDI3ES","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ADZLYQDI3ESLA32","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ADZLYQD","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:b939e588c3698b839bfb3d4f4d05ad31566dcb934f26d569a8b11b1f0849060a","target":"graph","created_at":"2026-05-18T00:26:53Z","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":"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","authors_text":"Elad Gilboa, Gal Dalal, Louis Wehenkel, Shie Mannor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-01-01T19:56:33Z","title":"Chance-Constrained Outage Scheduling using a Machine Learning Proxy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00500","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:ec16c65a5a76a74c2d79db8d1c1c146bf1f30eabfdb52e99a5924b44b5f9ee91","target":"record","created_at":"2026-05-18T00:26:53Z","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":"4c9fe16df49f3cc860c91e04f893c8d24b5c8901e83a8f0a0316b7fd56b799d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-01-01T19:56:33Z","title_canon_sha256":"549435cca980206bc36c7058ab7f91f10d0c7e37445082f03a43dee1bdcc8ecd"},"schema_version":"1.0","source":{"id":"1801.00500","kind":"arxiv","version":1}},"canonical_sha256":"e00795e20346c925837aed813009956b9f6201b54b02443b9fb420f4081e8d07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e00795e20346c925837aed813009956b9f6201b54b02443b9fb420f4081e8d07","first_computed_at":"2026-05-18T00:26:53.188419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:53.188419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmvGcqczyOQXuND4IirEWFk8942HeMi6kiPy9G/Gi9Z80d0TwaQmZwYYMP4boNZMATL3Wg6hDlZ1YWNUTsK3AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:53.189133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec16c65a5a76a74c2d79db8d1c1c146bf1f30eabfdb52e99a5924b44b5f9ee91","sha256:b939e588c3698b839bfb3d4f4d05ad31566dcb934f26d569a8b11b1f0849060a"],"state_sha256":"a0d80e079cbbb1057e1f45a0d857df682535a21e8d09d76799cdfae67df1fd8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5A3BSNOU09ldrl97lJgppS+kKbjGAEv9IouXbE5ELfr97skOZ2Lo+VKvku8b8farNof6pZ8KpSbmEXm+Onc8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:09:56.940186Z","bundle_sha256":"de39dc35f4609bfdc19274d77001996eba2f19e2d7a09afeecd35bef053b7369"}}