{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DJFNAH73AXDIYFGTM6KHXF6ABK","short_pith_number":"pith:DJFNAH73","schema_version":"1.0","canonical_sha256":"1a4ad01ffb05c68c14d367947b97c00a87a65bd3135c5d96247b0a6685a51023","source":{"kind":"arxiv","id":"2007.07002","version":1},"attestation_state":"computed","paper":{"title":"Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexandre Velloso, Pascal Van Hentenryck","submitted_at":"2020-07-14T12:38:21Z","abstract_excerpt":"The security-constrained optimal power flow (SCOPF) is fundamental in power systems and connects the automatic primary response (APR) of synchronized generators with the short-term schedule. Every day, the SCOPF problem is repeatedly solved for various inputs to determine robust schedules given a set of contingencies. Unfortunately, the modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs, which are hard to solve. To address this challenge, leveraging the wealth of available historical data, this paper proposes a novel approach that combines deep learn"},"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":"2007.07002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-14T12:38:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"44d14a25984224dedbd30eb844ac3d05445a7f1e49b919d8c4cacf8ae3e2755d","abstract_canon_sha256":"9f588ed2c0b2a31ed963e61995388b9e934ea2088b19c6376aeebb9946f09ad3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:18:25.733819Z","signature_b64":"NuOWB/U3Tsib0v0I0XIpDT/RYZ42GFLt+LYwJqwTZAjQSSg1sNzJw6Ir8DDhaeV3qNPoVFycUjGC/+o3CrxjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a4ad01ffb05c68c14d367947b97c00a87a65bd3135c5d96247b0a6685a51023","last_reissued_at":"2026-07-05T01:18:25.733417Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:18:25.733417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexandre Velloso, Pascal Van Hentenryck","submitted_at":"2020-07-14T12:38:21Z","abstract_excerpt":"The security-constrained optimal power flow (SCOPF) is fundamental in power systems and connects the automatic primary response (APR) of synchronized generators with the short-term schedule. Every day, the SCOPF problem is repeatedly solved for various inputs to determine robust schedules given a set of contingencies. Unfortunately, the modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs, which are hard to solve. To address this challenge, leveraging the wealth of available historical data, this paper proposes a novel approach that combines deep learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07002","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.07002/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.07002","created_at":"2026-07-05T01:18:25.733480+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.07002v1","created_at":"2026-07-05T01:18:25.733480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07002","created_at":"2026-07-05T01:18:25.733480+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJFNAH73AXDI","created_at":"2026-07-05T01:18:25.733480+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJFNAH73AXDIYFGT","created_at":"2026-07-05T01:18:25.733480+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJFNAH73","created_at":"2026-07-05T01:18:25.733480+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/DJFNAH73AXDIYFGTM6KHXF6ABK","json":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK.json","graph_json":"https://pith.science/api/pith-number/DJFNAH73AXDIYFGTM6KHXF6ABK/graph.json","events_json":"https://pith.science/api/pith-number/DJFNAH73AXDIYFGTM6KHXF6ABK/events.json","paper":"https://pith.science/paper/DJFNAH73"},"agent_actions":{"view_html":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK","download_json":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK.json","view_paper":"https://pith.science/paper/DJFNAH73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.07002&json=true","fetch_graph":"https://pith.science/api/pith-number/DJFNAH73AXDIYFGTM6KHXF6ABK/graph.json","fetch_events":"https://pith.science/api/pith-number/DJFNAH73AXDIYFGTM6KHXF6ABK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK/action/storage_attestation","attest_author":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK/action/author_attestation","sign_citation":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK/action/citation_signature","submit_replication":"https://pith.science/pith/DJFNAH73AXDIYFGTM6KHXF6ABK/action/replication_record"}},"created_at":"2026-07-05T01:18:25.733480+00:00","updated_at":"2026-07-05T01:18:25.733480+00:00"}