{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OXZMST2UHXMVPQDMTETFVMGHQI","short_pith_number":"pith:OXZMST2U","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"},"canonical_sha256":"75f2c94f543dd957c06c99265ab0c782174e416dbf6c4ae31ff6bdbd1782d92f","source":{"kind":"arxiv","id":"1507.07212","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07212","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07212v2","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07212","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"OXZMST2UHXMV","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXZMST2UHXMVPQDM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXZMST2U","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OXZMST2UHXMVPQDMTETFVMGHQI","target":"record","payload":{"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"},"canonical_sha256":"75f2c94f543dd957c06c99265ab0c782174e416dbf6c4ae31ff6bdbd1782d92f","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"},"source_kind":"arxiv","source_id":"1507.07212","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDmcpJyUE8K/He06psh4pVxVtXUhpC6+Y3RQdqLsGdAUzRr8a4e0y3n2TxmeVwY9+k8s7U1Kql+lsPeuH8oUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:57:26.170947Z"},"content_sha256":"de06c6129d4e42b75c069696a9d2c6071c40bc2a9af1490f00908c6bcd2cb5de","schema_version":"1.0","event_id":"sha256:de06c6129d4e42b75c069696a9d2c6071c40bc2a9af1490f00908c6bcd2cb5de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OXZMST2UHXMVPQDMTETFVMGHQI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uouHHDHozt1juckV4uXfSE1r3RYhDN7Q3vkXPul9sqg8zlxkzJIfDTb7CsqbC3RTRodVsGOMMZC8kBIvYFmuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:57:26.171285Z"},"content_sha256":"7ac6cfaa1192add04e4095eb6eb9ae5ab7ea8a16962419ab5f34ed132f9d1371","schema_version":"1.0","event_id":"sha256:7ac6cfaa1192add04e4095eb6eb9ae5ab7ea8a16962419ab5f34ed132f9d1371"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/bundle.json","state_url":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXZMST2UHXMVPQDMTETFVMGHQI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T20:57:26Z","links":{"resolver":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI","bundle":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/bundle.json","state":"https://pith.science/pith/OXZMST2UHXMVPQDMTETFVMGHQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXZMST2UHXMVPQDMTETFVMGHQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OXZMST2UHXMVPQDMTETFVMGHQI","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":"3c688db18461de7a8f0701c0ef25074a47c55c83afc85ea9d063126501b3a65b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-26T15:41:06Z","title_canon_sha256":"95867d7a420bb10680a15e08f2a73a8bc985969e84c089ee68bf6c905d99e25e"},"schema_version":"1.0","source":{"id":"1507.07212","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07212","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07212v2","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07212","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"OXZMST2UHXMV","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXZMST2UHXMVPQDM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXZMST2U","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:7ac6cfaa1192add04e4095eb6eb9ae5ab7ea8a16962419ab5f34ed132f9d1371","target":"graph","created_at":"2026-05-18T01:17:52Z","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"},"paper":{"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","authors_text":"C\\'edric Josz, Daniel K. Molzahn, Ian A. Hiskens, Patrick Panciatici","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-26T15:41:06Z","title":"A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07212","kind":"arxiv","version":2},"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:de06c6129d4e42b75c069696a9d2c6071c40bc2a9af1490f00908c6bcd2cb5de","target":"record","created_at":"2026-05-18T01:17:52Z","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":"3c688db18461de7a8f0701c0ef25074a47c55c83afc85ea9d063126501b3a65b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-26T15:41:06Z","title_canon_sha256":"95867d7a420bb10680a15e08f2a73a8bc985969e84c089ee68bf6c905d99e25e"},"schema_version":"1.0","source":{"id":"1507.07212","kind":"arxiv","version":2}},"canonical_sha256":"75f2c94f543dd957c06c99265ab0c782174e416dbf6c4ae31ff6bdbd1782d92f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75f2c94f543dd957c06c99265ab0c782174e416dbf6c4ae31ff6bdbd1782d92f","first_computed_at":"2026-05-18T01:17:52.660180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:52.660180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OIm+lM2anDkOFG9dhx0yvXkPZKmRtTfD/2IMEEdAHOt4F7NZiilhaIQeCJ6YLZDUIvHkEwh9rV+Ieta8OcXrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:52.660903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07212","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de06c6129d4e42b75c069696a9d2c6071c40bc2a9af1490f00908c6bcd2cb5de","sha256:7ac6cfaa1192add04e4095eb6eb9ae5ab7ea8a16962419ab5f34ed132f9d1371"],"state_sha256":"acac556086af4c1eaab6293bf1d0c94546236c59104fe62fd7a08d3dffe692f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkXRWcG9tqm4XnrFnulxNBqf8IiWxGnVzeCGOFNhiQ4Lx3ZO/YzVvSdmCZ7+qEZeEf3jZB7ogG+9BdSmXLhYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:57:26.173146Z","bundle_sha256":"04a9147933201b8db94811b88231a0e6eb44e539800c30d866880d44ad8bc84c"}}