{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2SXTPBLJWZJBEDH7ETYBVWPNDV","short_pith_number":"pith:2SXTPBLJ","canonical_record":{"source":{"id":"1208.4076","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-20T18:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"d0cf65ea2aee554d0ea9b8096e51e85ff63dee1a96bb8375f7fd4dce597bda21","abstract_canon_sha256":"94a159392eb94d798c42b1887da83d7725fe506fed3c7fd50afe068e539d2443"},"schema_version":"1.0"},"canonical_sha256":"d4af378569b652120cff24f01ad9ed1d47bac5d117b1d42c59c4ab805a3b3826","source":{"kind":"arxiv","id":"1208.4076","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4076","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4076v4","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4076","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"2SXTPBLJWZJB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2SXTPBLJWZJBEDH7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2SXTPBLJ","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2SXTPBLJWZJBEDH7ETYBVWPNDV","target":"record","payload":{"canonical_record":{"source":{"id":"1208.4076","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-20T18:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"d0cf65ea2aee554d0ea9b8096e51e85ff63dee1a96bb8375f7fd4dce597bda21","abstract_canon_sha256":"94a159392eb94d798c42b1887da83d7725fe506fed3c7fd50afe068e539d2443"},"schema_version":"1.0"},"canonical_sha256":"d4af378569b652120cff24f01ad9ed1d47bac5d117b1d42c59c4ab805a3b3826","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:35.258108Z","signature_b64":"vKtYUuV5TP1Nwah+eXvIBbsQ67eFgbhI+epI5wYlj7h2a7AB6mmfJj6eVoyT2llv3RS7FX5ee/xCNVuM+WmcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4af378569b652120cff24f01ad9ed1d47bac5d117b1d42c59c4ab805a3b3826","last_reissued_at":"2026-05-18T03:19:35.257539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:35.257539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.4076","source_version":4,"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-18T03:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvVQw4GmuJShAp1vs6/FdrKeXqDZ6r+SL+5dHzcRmnNkj6FxUn1fCU4xyHiH8+M1BV4pB7iS2ZGp95wFgtxaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:32:15.475672Z"},"content_sha256":"f28e9e2eecea2b95c32a6e35c876689482e1845a020164dcc55e1454d13d024c","schema_version":"1.0","event_id":"sha256:f28e9e2eecea2b95c32a6e35c876689482e1845a020164dcc55e1454d13d024c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2SXTPBLJWZJBEDH7ETYBVWPNDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Convex Relaxation of Optimal Power Flow in Tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lingwen Gan, Na Li, Steven H. Low, Ufuk Topcu","submitted_at":"2012-08-20T18:18:57Z","abstract_excerpt":"The optimal power flow (OPF) problem seeks to control power generation/demand to optimize certain objectives such as minimizing the generation cost or power loss in the network. It is becoming increasingly important for distribution networks, which are tree networks, due to the emergence of distributed generation and controllable loads. In this paper, we study the OPF problem in tree networks. The OPF problem is nonconvex. We prove that after a \"small\" modification to the OPF problem, its global optimum can be recovered via a second-order cone programming (SOCP) relaxation, under a \"mild\" cond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4076","kind":"arxiv","version":4},"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-18T03:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zq12p7Z/kf4gcyioT1+jDDra8qu6c6rIyr8lPJ3urkyJeMBrEx0gYOFzeCqYLp6cGNmCzt3ytLhpYq21EnN9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:32:15.476373Z"},"content_sha256":"dff10545b22a18dbe89a16ed4a1bbe0457577e701f25bc7516b1212c8c05b762","schema_version":"1.0","event_id":"sha256:dff10545b22a18dbe89a16ed4a1bbe0457577e701f25bc7516b1212c8c05b762"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SXTPBLJWZJBEDH7ETYBVWPNDV/bundle.json","state_url":"https://pith.science/pith/2SXTPBLJWZJBEDH7ETYBVWPNDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SXTPBLJWZJBEDH7ETYBVWPNDV/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-06-07T17:32:15Z","links":{"resolver":"https://pith.science/pith/2SXTPBLJWZJBEDH7ETYBVWPNDV","bundle":"https://pith.science/pith/2SXTPBLJWZJBEDH7ETYBVWPNDV/bundle.json","state":"https://pith.science/pith/2SXTPBLJWZJBEDH7ETYBVWPNDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SXTPBLJWZJBEDH7ETYBVWPNDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2SXTPBLJWZJBEDH7ETYBVWPNDV","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":"94a159392eb94d798c42b1887da83d7725fe506fed3c7fd50afe068e539d2443","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-20T18:18:57Z","title_canon_sha256":"d0cf65ea2aee554d0ea9b8096e51e85ff63dee1a96bb8375f7fd4dce597bda21"},"schema_version":"1.0","source":{"id":"1208.4076","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4076","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4076v4","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4076","created_at":"2026-05-18T03:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"2SXTPBLJWZJB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2SXTPBLJWZJBEDH7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2SXTPBLJ","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:dff10545b22a18dbe89a16ed4a1bbe0457577e701f25bc7516b1212c8c05b762","target":"graph","created_at":"2026-05-18T03:19:35Z","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":"The optimal power flow (OPF) problem seeks to control power generation/demand to optimize certain objectives such as minimizing the generation cost or power loss in the network. It is becoming increasingly important for distribution networks, which are tree networks, due to the emergence of distributed generation and controllable loads. In this paper, we study the OPF problem in tree networks. The OPF problem is nonconvex. We prove that after a \"small\" modification to the OPF problem, its global optimum can be recovered via a second-order cone programming (SOCP) relaxation, under a \"mild\" cond","authors_text":"Lingwen Gan, Na Li, Steven H. Low, Ufuk Topcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-20T18:18:57Z","title":"Exact Convex Relaxation of Optimal Power Flow in Tree Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4076","kind":"arxiv","version":4},"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:f28e9e2eecea2b95c32a6e35c876689482e1845a020164dcc55e1454d13d024c","target":"record","created_at":"2026-05-18T03:19:35Z","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":"94a159392eb94d798c42b1887da83d7725fe506fed3c7fd50afe068e539d2443","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-20T18:18:57Z","title_canon_sha256":"d0cf65ea2aee554d0ea9b8096e51e85ff63dee1a96bb8375f7fd4dce597bda21"},"schema_version":"1.0","source":{"id":"1208.4076","kind":"arxiv","version":4}},"canonical_sha256":"d4af378569b652120cff24f01ad9ed1d47bac5d117b1d42c59c4ab805a3b3826","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4af378569b652120cff24f01ad9ed1d47bac5d117b1d42c59c4ab805a3b3826","first_computed_at":"2026-05-18T03:19:35.257539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:35.257539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vKtYUuV5TP1Nwah+eXvIBbsQ67eFgbhI+epI5wYlj7h2a7AB6mmfJj6eVoyT2llv3RS7FX5ee/xCNVuM+WmcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:35.258108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.4076","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f28e9e2eecea2b95c32a6e35c876689482e1845a020164dcc55e1454d13d024c","sha256:dff10545b22a18dbe89a16ed4a1bbe0457577e701f25bc7516b1212c8c05b762"],"state_sha256":"3f7a624bf59e060970c30bbd20887c5b3c6b3dd7bd5beb484daaddd65ac6bd7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItwnHk2ts5dnI82FZfmWBCTEwFXXxR4hpLBkq/nACSqxYWksJtVxGTpP5qea6l/38orTZNmy7epMS5Sf7Z3dCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:32:15.480034Z","bundle_sha256":"90ee8fba07b6f60e1fc5ba5eb293c21d9ad47b7549451e784367bdf7ca05ec86"}}