{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WKQVQLKCDT6JOTYYDBVD2UNV6H","short_pith_number":"pith:WKQVQLKC","schema_version":"1.0","canonical_sha256":"b2a1582d421cfc974f18186a3d51b5f1ef0e6a8ef7b57135a468095d6088628c","source":{"kind":"arxiv","id":"2202.06787","version":5},"attestation_state":"computed","paper":{"title":"An ADMM-based Distributed Optimization Method for Solving Security-Constrained AC Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amin Gholami, Kaizhao Sun, Shixuan Zhang, Xu Andy Sun","submitted_at":"2022-02-14T15:05:20Z","abstract_excerpt":"In this paper, we study efficient and robust computational methods for solving the security-constrained alternating current optimal power flow (SC-ACOPF) problem, a two-stage nonlinear optimization problem with disjunctive constraints, that is central to the operation of electric power grids. The first-stage problem in SC-ACOPF determines the operation of the power grid in normal condition, while the second-stage problem responds to various contingencies of losing generators, transmission lines, and transformers. The two stages are coupled through disjunctive constraints, which model generator"},"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":"2202.06787","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-02-14T15:05:20Z","cross_cats_sorted":[],"title_canon_sha256":"c5313b55ba29f855145ff0bbba472ff3398ee3003db83010988b1ecc274d49f5","abstract_canon_sha256":"f749ea3f69384ef7dca7cd38bac1bb46e8ba9d973d26b25e379be3533cedcf06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:48.508300Z","signature_b64":"DgZEein6y2fJEcgDuTBuB0i+dKAXLhlrxgTeb4pwI/CRRo6HQVslu0EUjZVwO1wAqHZDd8fa8fQpAK/4zTSWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2a1582d421cfc974f18186a3d51b5f1ef0e6a8ef7b57135a468095d6088628c","last_reissued_at":"2026-07-05T06:39:48.507754Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:48.507754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An ADMM-based Distributed Optimization Method for Solving Security-Constrained AC Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amin Gholami, Kaizhao Sun, Shixuan Zhang, Xu Andy Sun","submitted_at":"2022-02-14T15:05:20Z","abstract_excerpt":"In this paper, we study efficient and robust computational methods for solving the security-constrained alternating current optimal power flow (SC-ACOPF) problem, a two-stage nonlinear optimization problem with disjunctive constraints, that is central to the operation of electric power grids. The first-stage problem in SC-ACOPF determines the operation of the power grid in normal condition, while the second-stage problem responds to various contingencies of losing generators, transmission lines, and transformers. The two stages are coupled through disjunctive constraints, which model generator"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06787","kind":"arxiv","version":5},"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/2202.06787/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":"2202.06787","created_at":"2026-07-05T06:39:48.507816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.06787v5","created_at":"2026-07-05T06:39:48.507816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06787","created_at":"2026-07-05T06:39:48.507816+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKQVQLKCDT6J","created_at":"2026-07-05T06:39:48.507816+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKQVQLKCDT6JOTYY","created_at":"2026-07-05T06:39:48.507816+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKQVQLKC","created_at":"2026-07-05T06:39:48.507816+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":85,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H","json":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H.json","graph_json":"https://pith.science/api/pith-number/WKQVQLKCDT6JOTYYDBVD2UNV6H/graph.json","events_json":"https://pith.science/api/pith-number/WKQVQLKCDT6JOTYYDBVD2UNV6H/events.json","paper":"https://pith.science/paper/WKQVQLKC"},"agent_actions":{"view_html":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H","download_json":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H.json","view_paper":"https://pith.science/paper/WKQVQLKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.06787&json=true","fetch_graph":"https://pith.science/api/pith-number/WKQVQLKCDT6JOTYYDBVD2UNV6H/graph.json","fetch_events":"https://pith.science/api/pith-number/WKQVQLKCDT6JOTYYDBVD2UNV6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H/action/storage_attestation","attest_author":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H/action/author_attestation","sign_citation":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H/action/citation_signature","submit_replication":"https://pith.science/pith/WKQVQLKCDT6JOTYYDBVD2UNV6H/action/replication_record"}},"created_at":"2026-07-05T06:39:48.507816+00:00","updated_at":"2026-07-05T06:39:48.507816+00:00"}