{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HSSBSI2X4XQ3OIGOUBIFUQANMC","short_pith_number":"pith:HSSBSI2X","schema_version":"1.0","canonical_sha256":"3ca4192357e5e1b720cea0505a400d608ffc2685e653aabfd5cd4128f9522a80","source":{"kind":"arxiv","id":"2410.17203","version":1},"attestation_state":"computed","paper":{"title":"GPU Accelerated Security Constrained Optimal Power Flow","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abbas El Gamal, Anthony Degleris, Ram Rajagopal","submitted_at":"2024-10-22T17:20:12Z","abstract_excerpt":"We propose a GPU accelerated proximal message passing algorithm for solving contingency-constrained DC optimal power flow problems (OPF). We consider a highly general formulation of OPF that uses a sparse device-node model and supports a broad range of devices and constraints, e.g., energy storage and ramping limits. Our algorithm is a variant of the alternating direction method multipliers (ADMM) that does not require solving any linear systems and only consists of sparse incidence matrix multiplies and vectorized scalar operations. We develop a pure PyTorch implementation of our algorithm th"},"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":"2410.17203","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-22T17:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"08d261548e976559f73a754f2aec13e4df13b98cf2dc49349d4fbf289483bca2","abstract_canon_sha256":"0796800df20838295862e7458edde6071425a5af2b6ce60d5b05b8a0507dc304"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:13.526897Z","signature_b64":"L/j4B1TUwbR1yZRou5Z+mKVt+oMXw+Q8jRcdF+jX1+hhXDb0BOzzqh3s7kUVDdJQmNBcQRQw3SMEOn7i4lj0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ca4192357e5e1b720cea0505a400d608ffc2685e653aabfd5cd4128f9522a80","last_reissued_at":"2026-07-05T09:24:13.526480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:13.526480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU Accelerated Security Constrained Optimal Power Flow","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abbas El Gamal, Anthony Degleris, Ram Rajagopal","submitted_at":"2024-10-22T17:20:12Z","abstract_excerpt":"We propose a GPU accelerated proximal message passing algorithm for solving contingency-constrained DC optimal power flow problems (OPF). We consider a highly general formulation of OPF that uses a sparse device-node model and supports a broad range of devices and constraints, e.g., energy storage and ramping limits. Our algorithm is a variant of the alternating direction method multipliers (ADMM) that does not require solving any linear systems and only consists of sparse incidence matrix multiplies and vectorized scalar operations. We develop a pure PyTorch implementation of our algorithm th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17203","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/2410.17203/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":"2410.17203","created_at":"2026-07-05T09:24:13.526538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.17203v1","created_at":"2026-07-05T09:24:13.526538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17203","created_at":"2026-07-05T09:24:13.526538+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSSBSI2X4XQ3","created_at":"2026-07-05T09:24:13.526538+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSSBSI2X4XQ3OIGO","created_at":"2026-07-05T09:24:13.526538+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSSBSI2X","created_at":"2026-07-05T09:24:13.526538+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.03484","citing_title":"Contingency-Aware Nodal Optimal Power Investments with High Temporal Resolution","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC","json":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC.json","graph_json":"https://pith.science/api/pith-number/HSSBSI2X4XQ3OIGOUBIFUQANMC/graph.json","events_json":"https://pith.science/api/pith-number/HSSBSI2X4XQ3OIGOUBIFUQANMC/events.json","paper":"https://pith.science/paper/HSSBSI2X"},"agent_actions":{"view_html":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC","download_json":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC.json","view_paper":"https://pith.science/paper/HSSBSI2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.17203&json=true","fetch_graph":"https://pith.science/api/pith-number/HSSBSI2X4XQ3OIGOUBIFUQANMC/graph.json","fetch_events":"https://pith.science/api/pith-number/HSSBSI2X4XQ3OIGOUBIFUQANMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC/action/storage_attestation","attest_author":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC/action/author_attestation","sign_citation":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC/action/citation_signature","submit_replication":"https://pith.science/pith/HSSBSI2X4XQ3OIGOUBIFUQANMC/action/replication_record"}},"created_at":"2026-07-05T09:24:13.526538+00:00","updated_at":"2026-07-05T09:24:13.526538+00:00"}