{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:F522F6GRDRHPLQHEW43TOG2VFQ","short_pith_number":"pith:F522F6GR","schema_version":"1.0","canonical_sha256":"2f75a2f8d11c4ef5c0e4b737371b552c2b26c44dfe60499d3ae3c93f0c678380","source":{"kind":"arxiv","id":"2110.01669","version":1},"attestation_state":"computed","paper":{"title":"Solving realistic security-constrained optimal power flow problems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cosmin G. Petra, Ignacio Aravena","submitted_at":"2021-10-04T19:07:46Z","abstract_excerpt":"We present a decomposition approach for obtaining good feasible solutions for the security-constrained alternating-current optimal power flow (SCACOPF) problem at an industrial scale and under real-world time and computational limits. The approach aims at complementing the existing body of literature on bounding the problem via convex relaxations. It was designed for the participation in ARPA-E's Grid Optimization (GO) Competition Challenge 1. The challenge focused on a near-real-time version of the SCACOPF problem where a base case operating point is optimized taking into account possible sin"},"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":"2110.01669","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-04T19:07:46Z","cross_cats_sorted":[],"title_canon_sha256":"839ac9b434ef42c7a655ebb04df278285474ac2e9c4a84f9b64a22cfee084672","abstract_canon_sha256":"15a26a5f32af0436d9d58a89ae20e843ee0332e02ab392bf32ee1fb4dc7d2fc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:16.014567Z","signature_b64":"/N1M9M9vAsr/E4i13nykHlJL1/cawgTlQpNeyJVwtrpbVwsbjWS0HwTaSy5kVshEGII7KbDzAKG86pZUcMVECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f75a2f8d11c4ef5c0e4b737371b552c2b26c44dfe60499d3ae3c93f0c678380","last_reissued_at":"2026-07-05T03:20:16.014162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:16.014162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving realistic security-constrained optimal power flow problems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cosmin G. Petra, Ignacio Aravena","submitted_at":"2021-10-04T19:07:46Z","abstract_excerpt":"We present a decomposition approach for obtaining good feasible solutions for the security-constrained alternating-current optimal power flow (SCACOPF) problem at an industrial scale and under real-world time and computational limits. The approach aims at complementing the existing body of literature on bounding the problem via convex relaxations. It was designed for the participation in ARPA-E's Grid Optimization (GO) Competition Challenge 1. The challenge focused on a near-real-time version of the SCACOPF problem where a base case operating point is optimized taking into account possible sin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.01669","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/2110.01669/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":"2110.01669","created_at":"2026-07-05T03:20:16.014213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.01669v1","created_at":"2026-07-05T03:20:16.014213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01669","created_at":"2026-07-05T03:20:16.014213+00:00"},{"alias_kind":"pith_short_12","alias_value":"F522F6GRDRHP","created_at":"2026-07-05T03:20:16.014213+00:00"},{"alias_kind":"pith_short_16","alias_value":"F522F6GRDRHPLQHE","created_at":"2026-07-05T03:20:16.014213+00:00"},{"alias_kind":"pith_short_8","alias_value":"F522F6GR","created_at":"2026-07-05T03:20:16.014213+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04623","citing_title":"Large-scale Grid Optimization: The Workhorse of Future Grid Computations","ref_index":80,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ","json":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ.json","graph_json":"https://pith.science/api/pith-number/F522F6GRDRHPLQHEW43TOG2VFQ/graph.json","events_json":"https://pith.science/api/pith-number/F522F6GRDRHPLQHEW43TOG2VFQ/events.json","paper":"https://pith.science/paper/F522F6GR"},"agent_actions":{"view_html":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ","download_json":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ.json","view_paper":"https://pith.science/paper/F522F6GR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.01669&json=true","fetch_graph":"https://pith.science/api/pith-number/F522F6GRDRHPLQHEW43TOG2VFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/F522F6GRDRHPLQHEW43TOG2VFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/action/storage_attestation","attest_author":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/action/author_attestation","sign_citation":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/action/citation_signature","submit_replication":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/action/replication_record"}},"created_at":"2026-07-05T03:20:16.014213+00:00","updated_at":"2026-07-05T03:20:16.014213+00:00"}