{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OXZMST2UHXMVPQDMTETFVMGHQI","short_pith_number":"pith:OXZMST2U","schema_version":"1.0","canonical_sha256":"75f2c94f543dd957c06c99265ab0c782174e416dbf6c4ae31ff6bdbd1782d92f","source":{"kind":"arxiv","id":"1507.07212","version":2},"attestation_state":"computed","paper":{"title":"A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C\\'edric Josz, Daniel K. Molzahn, Ian A. Hiskens, Patrick Panciatici","submitted_at":"2015-07-26T15:41:06Z","abstract_excerpt":"A semidefinite programming (SDP) relaxation globally solves many optimal power flow (OPF) problems. For other OPF problems where the SDP relaxation only provides a lower bound on the objective value rather than the globally optimal decision variables, recent literature has proposed a penalization approach to find feasible points that are often nearly globally optimal. A disadvantage of this penalization approach is the need to specify penalty parameters. This paper presents an alternative approach that algorithmically determines a penalization appropriate for many OPF problems. The proposed ap"},"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":"1507.07212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-26T15:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"95867d7a420bb10680a15e08f2a73a8bc985969e84c089ee68bf6c905d99e25e","abstract_canon_sha256":"3c688db18461de7a8f0701c0ef25074a47c55c83afc85ea9d063126501b3a65b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:52.660903Z","signature_b64":"OIm+lM2anDkOFG9dhx0yvXkPZKmRtTfD/2IMEEdAHOt4F7NZiilhaIQeCJ6YLZDUIvHkEwh9rV+Ieta8OcXrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75f2c94f543dd957c06c99265ab0c782174e416dbf6c4ae31ff6bdbd1782d92f","last_reissued_at":"2026-05-18T01:17:52.660180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:52.660180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C\\'edric Josz, Daniel K. Molzahn, Ian A. Hiskens, Patrick Panciatici","submitted_at":"2015-07-26T15:41:06Z","abstract_excerpt":"A semidefinite programming (SDP) relaxation globally solves many optimal power flow (OPF) problems. For other OPF problems where the SDP relaxation only provides a lower bound on the objective value rather than the globally optimal decision variables, recent literature has proposed a penalization approach to find feasible points that are often nearly globally optimal. A disadvantage of this penalization approach is the need to specify penalty parameters. This paper presents an alternative approach that algorithmically determines a penalization appropriate for many OPF problems. The proposed ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07212","kind":"arxiv","version":2},"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":"1507.07212","created_at":"2026-05-18T01:17:52.660306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07212v2","created_at":"2026-05-18T01:17:52.660306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07212","created_at":"2026-05-18T01:17:52.660306+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXZMST2UHXMV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXZMST2UHXMVPQDM","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXZMST2U","created_at":"2026-05-18T12:29:34.919912+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/OXZMST2UHXMVPQDMTETFVMGHQI","json":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI.json","graph_json":"https://pith.science/api/pith-number/OXZMST2UHXMVPQDMTETFVMGHQI/graph.json","events_json":"https://pith.science/api/pith-number/OXZMST2UHXMVPQDMTETFVMGHQI/events.json","paper":"https://pith.science/paper/OXZMST2U"},"agent_actions":{"view_html":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI","download_json":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI.json","view_paper":"https://pith.science/paper/OXZMST2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07212&json=true","fetch_graph":"https://pith.science/api/pith-number/OXZMST2UHXMVPQDMTETFVMGHQI/graph.json","fetch_events":"https://pith.science/api/pith-number/OXZMST2UHXMVPQDMTETFVMGHQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/action/storage_attestation","attest_author":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/action/author_attestation","sign_citation":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/action/citation_signature","submit_replication":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/action/replication_record"}},"created_at":"2026-05-18T01:17:52.660306+00:00","updated_at":"2026-05-18T01:17:52.660306+00:00"}