{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2WTJG2JVKH45Q3X2OQSV4QPNWM","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":"838512e976b6b87ba4cb91c335448af9873eb998237ee1a22b79820312d03ac9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-31T19:03:03Z","title_canon_sha256":"9d6efe29be3d3bffdbe53cbf80f6fefbc977124eb5fc64711b7ba0b8feb3d6db"},"schema_version":"1.0","source":{"id":"2006.00585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00585","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00585v1","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00585","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"2WTJG2JVKH45","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_16","alias_value":"2WTJG2JVKH45Q3X2","created_at":"2026-07-05T01:07:03Z"},{"alias_kind":"pith_short_8","alias_value":"2WTJG2JV","created_at":"2026-07-05T01:07:03Z"}],"graph_snapshots":[{"event_id":"sha256:43ed6e6f9243012fb9db1be2e1d220356b82d7d3ac1ad3c2276fd30b27710fb0","target":"graph","created_at":"2026-07-05T01:07:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.00585/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Javad Mohammadi, Kyri Baker, Mohammadhafez Bazrafshan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-31T19:03:03Z","title":"Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00585","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:5e54d888fe845da1bb0d16a4e934f80fdc075a687857b69e676d485c7699c329","target":"record","created_at":"2026-07-05T01:07:03Z","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":"838512e976b6b87ba4cb91c335448af9873eb998237ee1a22b79820312d03ac9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-31T19:03:03Z","title_canon_sha256":"9d6efe29be3d3bffdbe53cbf80f6fefbc977124eb5fc64711b7ba0b8feb3d6db"},"schema_version":"1.0","source":{"id":"2006.00585","kind":"arxiv","version":1}},"canonical_sha256":"d5a693693551f9d86efa74255e41edb31d3352a3eb9b467d27a1cd6e3feb12db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5a693693551f9d86efa74255e41edb31d3352a3eb9b467d27a1cd6e3feb12db","first_computed_at":"2026-07-05T01:07:03.349748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:07:03.349748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E0qGAr6slABSap/ZqjJzbaCHAjeZqnhlDTuIRo8mWEL9aQCVT8JrIw+O5gzAceg3tS2ZN1/izfrafCyyG4zxBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:07:03.350246Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.00585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e54d888fe845da1bb0d16a4e934f80fdc075a687857b69e676d485c7699c329","sha256:43ed6e6f9243012fb9db1be2e1d220356b82d7d3ac1ad3c2276fd30b27710fb0"],"state_sha256":"ecdca72bae11d6a4f7f3be5a7279b050f659117869ffa9586b07343fe0c077dd"}