{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KUAPKJZ2SBWF2LWHBXMZZTAPHP","short_pith_number":"pith:KUAPKJZ2","schema_version":"1.0","canonical_sha256":"5500f5273a906c5d2ec70dd99ccc0f3bf37478a3faa7b4a6f6cf7522b06b00f7","source":{"kind":"arxiv","id":"1809.09809","version":1},"attestation_state":"computed","paper":{"title":"Penalized Parabolic Relaxation for Optimal Power Flow Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Edward Quarm, Fariba Zohrizadeh, Mohsen Kheirandishfard, Ramtin Madani","submitted_at":"2018-09-26T05:07:35Z","abstract_excerpt":"This paper is concerned with optimal power flow (OPF), which is the problem of optimizing the transmission of electricity in power systems. Our main contributions are as follows: (i) we propose a novel parabolic relaxation, which transforms non-convex OPF problems into convex quadratically-constrained quadratic programs (QCQPs) and can serve as an alternative to the common practice semidefinite programming (SDP) and second-order cone programming (SOCP) relaxations, (ii) we propose a penalization technique which is compatible with the SDP, SOCP, and parabolic relaxations and guarantees the reco"},"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":"1809.09809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:07:35Z","cross_cats_sorted":[],"title_canon_sha256":"27201862694e1a3e76fb196f0a06752d8657ce9118eca79412db7615d048ef1f","abstract_canon_sha256":"0c4fd3d9c8d041bbc0d110c10d6967593764a2f7372ab8b9b6e26d8a1e913b49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.595908Z","signature_b64":"AIr/wtdtQ6w6s/2PrnN6vFStY6nPCzB+08IXpyMHXTRSBUw5jYxX2v4kfALglxRFMjOthE6RRVwuzR4IKdL4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5500f5273a906c5d2ec70dd99ccc0f3bf37478a3faa7b4a6f6cf7522b06b00f7","last_reissued_at":"2026-05-18T00:04:43.595186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.595186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Penalized Parabolic Relaxation for Optimal Power Flow Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Edward Quarm, Fariba Zohrizadeh, Mohsen Kheirandishfard, Ramtin Madani","submitted_at":"2018-09-26T05:07:35Z","abstract_excerpt":"This paper is concerned with optimal power flow (OPF), which is the problem of optimizing the transmission of electricity in power systems. Our main contributions are as follows: (i) we propose a novel parabolic relaxation, which transforms non-convex OPF problems into convex quadratically-constrained quadratic programs (QCQPs) and can serve as an alternative to the common practice semidefinite programming (SDP) and second-order cone programming (SOCP) relaxations, (ii) we propose a penalization technique which is compatible with the SDP, SOCP, and parabolic relaxations and guarantees the reco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09809","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":"1809.09809","created_at":"2026-05-18T00:04:43.595297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09809v1","created_at":"2026-05-18T00:04:43.595297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09809","created_at":"2026-05-18T00:04:43.595297+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUAPKJZ2SBWF","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUAPKJZ2SBWF2LWH","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUAPKJZ2","created_at":"2026-05-18T12:32:33.847187+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/KUAPKJZ2SBWF2LWHBXMZZTAPHP","json":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP.json","graph_json":"https://pith.science/api/pith-number/KUAPKJZ2SBWF2LWHBXMZZTAPHP/graph.json","events_json":"https://pith.science/api/pith-number/KUAPKJZ2SBWF2LWHBXMZZTAPHP/events.json","paper":"https://pith.science/paper/KUAPKJZ2"},"agent_actions":{"view_html":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP","download_json":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP.json","view_paper":"https://pith.science/paper/KUAPKJZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09809&json=true","fetch_graph":"https://pith.science/api/pith-number/KUAPKJZ2SBWF2LWHBXMZZTAPHP/graph.json","fetch_events":"https://pith.science/api/pith-number/KUAPKJZ2SBWF2LWHBXMZZTAPHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP/action/storage_attestation","attest_author":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP/action/author_attestation","sign_citation":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP/action/citation_signature","submit_replication":"https://pith.science/pith/KUAPKJZ2SBWF2LWHBXMZZTAPHP/action/replication_record"}},"created_at":"2026-05-18T00:04:43.595297+00:00","updated_at":"2026-05-18T00:04:43.595297+00:00"}