{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2WTJG2JVKH45Q3X2OQSV4QPNWM","short_pith_number":"pith:2WTJG2JV","schema_version":"1.0","canonical_sha256":"d5a693693551f9d86efa74255e41edb31d3352a3eb9b467d27a1cd6e3feb12db","source":{"kind":"arxiv","id":"2006.00585","version":1},"attestation_state":"computed","paper":{"title":"Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javad Mohammadi, Kyri Baker, Mohammadhafez Bazrafshan","submitted_at":"2020-05-31T19:03:03Z","abstract_excerpt":"In this paper, we discuss our approach and algorithmic framework for solving large-scale security constrained optimal power flow (SCOPF) problems. SCOPF is a mixed integer non-convex optimization problem that aims to obtain the minimum dispatch cost while maintaining the system N-1 secure. Finding a feasible solution for this problem over large networks is challenging and this paper presents contingency selection, approximation methods, and decomposition techniques to address this challenge in a short period of time. The performance of the proposed methods are verified through large-scale synt"},"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":"2006.00585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-31T19:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"9d6efe29be3d3bffdbe53cbf80f6fefbc977124eb5fc64711b7ba0b8feb3d6db","abstract_canon_sha256":"838512e976b6b87ba4cb91c335448af9873eb998237ee1a22b79820312d03ac9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:03.350246Z","signature_b64":"E0qGAr6slABSap/ZqjJzbaCHAjeZqnhlDTuIRo8mWEL9aQCVT8JrIw+O5gzAceg3tS2ZN1/izfrafCyyG4zxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5a693693551f9d86efa74255e41edb31d3352a3eb9b467d27a1cd6e3feb12db","last_reissued_at":"2026-07-05T01:07:03.349748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:03.349748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javad Mohammadi, Kyri Baker, Mohammadhafez Bazrafshan","submitted_at":"2020-05-31T19:03:03Z","abstract_excerpt":"In this paper, we discuss our approach and algorithmic framework for solving large-scale security constrained optimal power flow (SCOPF) problems. SCOPF is a mixed integer non-convex optimization problem that aims to obtain the minimum dispatch cost while maintaining the system N-1 secure. Finding a feasible solution for this problem over large networks is challenging and this paper presents contingency selection, approximation methods, and decomposition techniques to address this challenge in a short period of time. The performance of the proposed methods are verified through large-scale synt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00585","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/2006.00585/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":"2006.00585","created_at":"2026-07-05T01:07:03.349813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.00585v1","created_at":"2026-07-05T01:07:03.349813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00585","created_at":"2026-07-05T01:07:03.349813+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WTJG2JVKH45","created_at":"2026-07-05T01:07:03.349813+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WTJG2JVKH45Q3X2","created_at":"2026-07-05T01:07:03.349813+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WTJG2JV","created_at":"2026-07-05T01:07:03.349813+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":82,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM","json":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM.json","graph_json":"https://pith.science/api/pith-number/2WTJG2JVKH45Q3X2OQSV4QPNWM/graph.json","events_json":"https://pith.science/api/pith-number/2WTJG2JVKH45Q3X2OQSV4QPNWM/events.json","paper":"https://pith.science/paper/2WTJG2JV"},"agent_actions":{"view_html":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM","download_json":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM.json","view_paper":"https://pith.science/paper/2WTJG2JV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.00585&json=true","fetch_graph":"https://pith.science/api/pith-number/2WTJG2JVKH45Q3X2OQSV4QPNWM/graph.json","fetch_events":"https://pith.science/api/pith-number/2WTJG2JVKH45Q3X2OQSV4QPNWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM/action/storage_attestation","attest_author":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM/action/author_attestation","sign_citation":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM/action/citation_signature","submit_replication":"https://pith.science/pith/2WTJG2JVKH45Q3X2OQSV4QPNWM/action/replication_record"}},"created_at":"2026-07-05T01:07:03.349813+00:00","updated_at":"2026-07-05T01:07:03.349813+00:00"}