{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SVXC3IMQX4K4CSUCAMKDHSLCOE","short_pith_number":"pith:SVXC3IMQ","canonical_record":{"source":{"id":"1311.7170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-27T22:26:47Z","cross_cats_sorted":[],"title_canon_sha256":"fde300e52ca8c1f4b5985b2946c1e62cc5efd0cdec58617cb6ae91188f79d97a","abstract_canon_sha256":"7792acccbd33bad9c5d5c9972793ce843c8a241b5c17005856fae9eac879ae58"},"schema_version":"1.0"},"canonical_sha256":"956e2da190bf15c14a82031433c9627116e701612306d12d4dc508f11a093871","source":{"kind":"arxiv","id":"1311.7170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7170","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7170v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7170","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"SVXC3IMQX4K4","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SVXC3IMQX4K4CSUC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SVXC3IMQ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SVXC3IMQX4K4CSUCAMKDHSLCOE","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-27T22:26:47Z","cross_cats_sorted":[],"title_canon_sha256":"fde300e52ca8c1f4b5985b2946c1e62cc5efd0cdec58617cb6ae91188f79d97a","abstract_canon_sha256":"7792acccbd33bad9c5d5c9972793ce843c8a241b5c17005856fae9eac879ae58"},"schema_version":"1.0"},"canonical_sha256":"956e2da190bf15c14a82031433c9627116e701612306d12d4dc508f11a093871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.508780Z","signature_b64":"N0QCQe3piyvWHVjenhupg+b7SptZJJypvX7xgmydnpkv6e/baySIKPyhAz2rcBfo3SshJddf6y+KZkc39Q2JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"956e2da190bf15c14a82031433c9627116e701612306d12d4dc508f11a093871","last_reissued_at":"2026-05-18T00:57:52.508068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.508068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7170","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-18T00:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5K+1fnKmtnkbqNXO7bldhd2D2qgTZ9odVPvse6lVDECPKut8ARILc43gRZs966LTUwpUcOVtb9/8lPsQTR2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T00:30:14.021301Z"},"content_sha256":"583aca9056632df241bcec64c646108887ec624c9cd492d07d263fa3b3d37b39","schema_version":"1.0","event_id":"sha256:583aca9056632df241bcec64c646108887ec624c9cd492d07d263fa3b3d37b39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SVXC3IMQX4K4CSUCAMKDHSLCOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Convex Relaxation of Optimal Power Flow in Radial 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":"2013-11-27T22:26:47Z","abstract_excerpt":"The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly, the global optimum of OPF can be recovered via a second-order cone programming (SOCP) relaxation under a condition that can be checked a priori. The condition holds for the IEEE 13-, 34-, 37-, 123-bus networks and two real-world networks, and has a physical interpretation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7170","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-18T00:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T091eupYw5y53NUqE21/xAouu2nG13hqkgWwgPmbkeXCw9+WuZHdI4eJsHPDoTwMIPRBpl5E33/md7qYnzOlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T00:30:14.021931Z"},"content_sha256":"81a377c73e593bfea53cb77d7c1214dc03d92e0b3b6dbb305cb25c2b10c4ed49","schema_version":"1.0","event_id":"sha256:81a377c73e593bfea53cb77d7c1214dc03d92e0b3b6dbb305cb25c2b10c4ed49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVXC3IMQX4K4CSUCAMKDHSLCOE/bundle.json","state_url":"https://pith.science/pith/SVXC3IMQX4K4CSUCAMKDHSLCOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVXC3IMQX4K4CSUCAMKDHSLCOE/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-04T00:30:14Z","links":{"resolver":"https://pith.science/pith/SVXC3IMQX4K4CSUCAMKDHSLCOE","bundle":"https://pith.science/pith/SVXC3IMQX4K4CSUCAMKDHSLCOE/bundle.json","state":"https://pith.science/pith/SVXC3IMQX4K4CSUCAMKDHSLCOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVXC3IMQX4K4CSUCAMKDHSLCOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SVXC3IMQX4K4CSUCAMKDHSLCOE","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":"7792acccbd33bad9c5d5c9972793ce843c8a241b5c17005856fae9eac879ae58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-27T22:26:47Z","title_canon_sha256":"fde300e52ca8c1f4b5985b2946c1e62cc5efd0cdec58617cb6ae91188f79d97a"},"schema_version":"1.0","source":{"id":"1311.7170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7170","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7170v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7170","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"SVXC3IMQX4K4","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SVXC3IMQX4K4CSUC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SVXC3IMQ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:81a377c73e593bfea53cb77d7c1214dc03d92e0b3b6dbb305cb25c2b10c4ed49","target":"graph","created_at":"2026-05-18T00:57: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":"The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly, the global optimum of OPF can be recovered via a second-order cone programming (SOCP) relaxation under a condition that can be checked a priori. The condition holds for the IEEE 13-, 34-, 37-, 123-bus networks and two real-world networks, and has a physical interpretation.","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":"2013-11-27T22:26:47Z","title":"Exact Convex Relaxation of Optimal Power Flow in Radial Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7170","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:583aca9056632df241bcec64c646108887ec624c9cd492d07d263fa3b3d37b39","target":"record","created_at":"2026-05-18T00:57: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":"7792acccbd33bad9c5d5c9972793ce843c8a241b5c17005856fae9eac879ae58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-27T22:26:47Z","title_canon_sha256":"fde300e52ca8c1f4b5985b2946c1e62cc5efd0cdec58617cb6ae91188f79d97a"},"schema_version":"1.0","source":{"id":"1311.7170","kind":"arxiv","version":1}},"canonical_sha256":"956e2da190bf15c14a82031433c9627116e701612306d12d4dc508f11a093871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"956e2da190bf15c14a82031433c9627116e701612306d12d4dc508f11a093871","first_computed_at":"2026-05-18T00:57:52.508068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.508068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N0QCQe3piyvWHVjenhupg+b7SptZJJypvX7xgmydnpkv6e/baySIKPyhAz2rcBfo3SshJddf6y+KZkc39Q2JCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.508780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:583aca9056632df241bcec64c646108887ec624c9cd492d07d263fa3b3d37b39","sha256:81a377c73e593bfea53cb77d7c1214dc03d92e0b3b6dbb305cb25c2b10c4ed49"],"state_sha256":"a56703433793d60b9b4336e8594193bfe00b970fd74ecd9dfba4c1d37836395b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opMyO4ikt9cDuZNOa+sFs24Ogkur9rmbD4eaNeMTnmVwrcTW+E4Bg721yM1gfiMRZMkpQKiO/bHoHZVUr6BYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T00:30:14.025423Z","bundle_sha256":"db18f5f3759bab21261d01ecad8a9e9b5a9a68c3854f19b6f75d7fc3c76d328c"}}