{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SSQS6RRKSTWAEGBKEH3NKTG4GV","short_pith_number":"pith:SSQS6RRK","schema_version":"1.0","canonical_sha256":"94a12f462a94ec02182a21f6d54cdc355860d4713de1f3d6823262d24bb38578","source":{"kind":"arxiv","id":"1804.04248","version":1},"attestation_state":"computed","paper":{"title":"Empirical Investigation of Non-Convexities in Optimal Power Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel K. Molzahn Dan Wu, Mariesa L. Crow, Mohammad Rasoul Narimani","submitted_at":"2018-04-11T22:27:30Z","abstract_excerpt":"Optimal power flow (OPF) is a central problem in the operation of electric power systems. An OPF problem optimizes a specified objective function subject to constraints imposed by both the non-linear power flow equations and engineering limits. These constraints can yield non-convex feasible spaces that result in significant computational challenges. Despite these non-convexities, local solution algorithms actually find the global optima of some practical OPF problems. This suggests that OPF problems have a range of difficulty: some problems appear to have convex or \"nearly convex\" feasible sp"},"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":"1804.04248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-11T22:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"4cd9522951f209de2b0c0f99bab5c10d6f09e101ad9572611a6bae17dc768f63","abstract_canon_sha256":"0801378b03cf83c380104e51669c500a9b120d89655c35e594d08402f1aadb10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:40.230387Z","signature_b64":"UYyYOqLpRhBuUJP+kClluNlRzSMHx1jxfzaXeLfuYx9cvgPJYED81O67NiGfDiGL1MNnVoL0TnJtDo9HhfVBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a12f462a94ec02182a21f6d54cdc355860d4713de1f3d6823262d24bb38578","last_reissued_at":"2026-05-18T00:18:40.229845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:40.229845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Empirical Investigation of Non-Convexities in Optimal Power Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel K. Molzahn Dan Wu, Mariesa L. Crow, Mohammad Rasoul Narimani","submitted_at":"2018-04-11T22:27:30Z","abstract_excerpt":"Optimal power flow (OPF) is a central problem in the operation of electric power systems. An OPF problem optimizes a specified objective function subject to constraints imposed by both the non-linear power flow equations and engineering limits. These constraints can yield non-convex feasible spaces that result in significant computational challenges. Despite these non-convexities, local solution algorithms actually find the global optima of some practical OPF problems. This suggests that OPF problems have a range of difficulty: some problems appear to have convex or \"nearly convex\" feasible sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04248","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":""},"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":"1804.04248","created_at":"2026-05-18T00:18:40.229932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04248v1","created_at":"2026-05-18T00:18:40.229932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04248","created_at":"2026-05-18T00:18:40.229932+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSQS6RRKSTWA","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSQS6RRKSTWAEGBK","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSQS6RRK","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV","json":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV.json","graph_json":"https://pith.science/api/pith-number/SSQS6RRKSTWAEGBKEH3NKTG4GV/graph.json","events_json":"https://pith.science/api/pith-number/SSQS6RRKSTWAEGBKEH3NKTG4GV/events.json","paper":"https://pith.science/paper/SSQS6RRK"},"agent_actions":{"view_html":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV","download_json":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV.json","view_paper":"https://pith.science/paper/SSQS6RRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04248&json=true","fetch_graph":"https://pith.science/api/pith-number/SSQS6RRKSTWAEGBKEH3NKTG4GV/graph.json","fetch_events":"https://pith.science/api/pith-number/SSQS6RRKSTWAEGBKEH3NKTG4GV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV/action/storage_attestation","attest_author":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV/action/author_attestation","sign_citation":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV/action/citation_signature","submit_replication":"https://pith.science/pith/SSQS6RRKSTWAEGBKEH3NKTG4GV/action/replication_record"}},"created_at":"2026-05-18T00:18:40.229932+00:00","updated_at":"2026-05-18T00:18:40.229932+00:00"}