{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4FU4KK4V4VMRJPUOY4XLWMLA43","short_pith_number":"pith:4FU4KK4V","canonical_record":{"source":{"id":"1903.05390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-13T10:18:20Z","cross_cats_sorted":["cs.CE","cs.RO"],"title_canon_sha256":"d9b947c9455201381f8bd3771cd35f24945ffac6907e9293dac07efe2478bec3","abstract_canon_sha256":"436fa9e9ec289c727266bc2fb5dec67b2800f2f596a85c854a437d71d8f84511"},"schema_version":"1.0"},"canonical_sha256":"e169c52b95e55914be8ec72ebb3160e6ef387bbcb152e10e15bef8808aa2aba9","source":{"kind":"arxiv","id":"1903.05390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05390","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05390v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05390","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"4FU4KK4V4VMR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4FU4KK4V4VMRJPUO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4FU4KK4V","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4FU4KK4V4VMRJPUOY4XLWMLA43","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-13T10:18:20Z","cross_cats_sorted":["cs.CE","cs.RO"],"title_canon_sha256":"d9b947c9455201381f8bd3771cd35f24945ffac6907e9293dac07efe2478bec3","abstract_canon_sha256":"436fa9e9ec289c727266bc2fb5dec67b2800f2f596a85c854a437d71d8f84511"},"schema_version":"1.0"},"canonical_sha256":"e169c52b95e55914be8ec72ebb3160e6ef387bbcb152e10e15bef8808aa2aba9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.421147Z","signature_b64":"49CZs0v44Xr6+KfUN0fRMFwqleQLarDefnfek49OW+s1p3SpDk40M/ig07Fj3U7ghxYdAwPhPDkKhiKEujucAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e169c52b95e55914be8ec72ebb3160e6ef387bbcb152e10e15bef8808aa2aba9","last_reissued_at":"2026-05-17T23:51:24.420582Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.420582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05390","source_version":1,"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0vW7Pod8eESEWYFTTgX86tst6zt0T8vgoElW7/WXAHMl4gR3r1wmkZSxsNDvb//G0QR+GQFddBTjOtZ+B87BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:22:31.765631Z"},"content_sha256":"cbbf675a3173bd1b385a36a4bed06b71f0cfc27db2286bae0b3869c352e6c505","schema_version":"1.0","event_id":"sha256:cbbf675a3173bd1b385a36a4bed06b71f0cfc27db2286bae0b3869c352e6c505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4FU4KK4V4VMRJPUOY4XLWMLA43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.RO"],"primary_cat":"math.OC","authors_text":"Am\\'elie Lambert (CEDRIC), Hadrien Godard (CEDRIC - OC, Jean Maeght, Manuel Ruiz (G-SCOP_OC), Sourour Elloumi (CEDRIC), UMA)","submitted_at":"2019-03-13T10:18:20Z","abstract_excerpt":"Optimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality. To this end, we specialize the Mixed-Integer Quadratic Convex Reformulation method (MIQCR) to (OPF). This is a method in two steps. First, a Semi-Definite Programming (SDP) relaxation of (OPF) is solved. Then the optimal dual variables of this relaxation are used to reformulate OPF into an equivalent new quadratic program, where all the non-convexity is moved to one additional constraint. In the second step, this reformulation is solved w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05390","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"},"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"reuJ867IqifitEqSVOKL6UvEb1lVgpERnheHD8IZC+YVptCYMZgSv+Fm7pYuWSrzMtz7WubrVYMFlq9nBONYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:22:31.766291Z"},"content_sha256":"e51cdbb1e34a15e5f0f62187702905fb7b00833c4a539018a7b10d14255564b5","schema_version":"1.0","event_id":"sha256:e51cdbb1e34a15e5f0f62187702905fb7b00833c4a539018a7b10d14255564b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FU4KK4V4VMRJPUOY4XLWMLA43/bundle.json","state_url":"https://pith.science/pith/4FU4KK4V4VMRJPUOY4XLWMLA43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FU4KK4V4VMRJPUOY4XLWMLA43/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-05-24T12:22:31Z","links":{"resolver":"https://pith.science/pith/4FU4KK4V4VMRJPUOY4XLWMLA43","bundle":"https://pith.science/pith/4FU4KK4V4VMRJPUOY4XLWMLA43/bundle.json","state":"https://pith.science/pith/4FU4KK4V4VMRJPUOY4XLWMLA43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FU4KK4V4VMRJPUOY4XLWMLA43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4FU4KK4V4VMRJPUOY4XLWMLA43","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":"436fa9e9ec289c727266bc2fb5dec67b2800f2f596a85c854a437d71d8f84511","cross_cats_sorted":["cs.CE","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-13T10:18:20Z","title_canon_sha256":"d9b947c9455201381f8bd3771cd35f24945ffac6907e9293dac07efe2478bec3"},"schema_version":"1.0","source":{"id":"1903.05390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05390","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05390v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05390","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"4FU4KK4V4VMR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4FU4KK4V4VMRJPUO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4FU4KK4V","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e51cdbb1e34a15e5f0f62187702905fb7b00833c4a539018a7b10d14255564b5","target":"graph","created_at":"2026-05-17T23:51:24Z","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":"Optimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality. To this end, we specialize the Mixed-Integer Quadratic Convex Reformulation method (MIQCR) to (OPF). This is a method in two steps. First, a Semi-Definite Programming (SDP) relaxation of (OPF) is solved. Then the optimal dual variables of this relaxation are used to reformulate OPF into an equivalent new quadratic program, where all the non-convexity is moved to one additional constraint. In the second step, this reformulation is solved w","authors_text":"Am\\'elie Lambert (CEDRIC), Hadrien Godard (CEDRIC - OC, Jean Maeght, Manuel Ruiz (G-SCOP_OC), Sourour Elloumi (CEDRIC), UMA)","cross_cats":["cs.CE","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-13T10:18:20Z","title":"Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05390","kind":"arxiv","version":1},"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:cbbf675a3173bd1b385a36a4bed06b71f0cfc27db2286bae0b3869c352e6c505","target":"record","created_at":"2026-05-17T23:51:24Z","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":"436fa9e9ec289c727266bc2fb5dec67b2800f2f596a85c854a437d71d8f84511","cross_cats_sorted":["cs.CE","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-13T10:18:20Z","title_canon_sha256":"d9b947c9455201381f8bd3771cd35f24945ffac6907e9293dac07efe2478bec3"},"schema_version":"1.0","source":{"id":"1903.05390","kind":"arxiv","version":1}},"canonical_sha256":"e169c52b95e55914be8ec72ebb3160e6ef387bbcb152e10e15bef8808aa2aba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e169c52b95e55914be8ec72ebb3160e6ef387bbcb152e10e15bef8808aa2aba9","first_computed_at":"2026-05-17T23:51:24.420582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.420582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"49CZs0v44Xr6+KfUN0fRMFwqleQLarDefnfek49OW+s1p3SpDk40M/ig07Fj3U7ghxYdAwPhPDkKhiKEujucAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.421147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbbf675a3173bd1b385a36a4bed06b71f0cfc27db2286bae0b3869c352e6c505","sha256:e51cdbb1e34a15e5f0f62187702905fb7b00833c4a539018a7b10d14255564b5"],"state_sha256":"b08650b156922b5187d5ba04fae33cc8e1a15fddc465d8661c57621be7e2f2b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhDDCy0pOhiiuV2w//ZlmGJpke5Q6t27N4EO4W+AadNiCkbodHxa8pk2eVBtizzl/UBvcX9ZVeogBDL1d/93Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T12:22:31.769422Z","bundle_sha256":"4c4d8e242927e9ae197b23acb59ff51254c88bbdb1204fc7bc28ecc96df9224e"}}