{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OYKNRKSCQ7SJWT3UGII3JRI6U3","short_pith_number":"pith:OYKNRKSC","canonical_record":{"source":{"id":"1711.03471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-09T16:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"af2d522d406bdeaf84d8442cfce3bc5d4880f61e6b6278fe876befb4a8293308","abstract_canon_sha256":"8ba1abe17a0a1652199221fa4a9d0c2d76c738adab9e41e827e4c0a8de540abd"},"schema_version":"1.0"},"canonical_sha256":"7614d8aa4287e49b4f743211b4c51ea6e33a5199879279bc73240ba2ce08f81f","source":{"kind":"arxiv","id":"1711.03471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03471","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03471v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03471","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"OYKNRKSCQ7SJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OYKNRKSCQ7SJWT3U","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OYKNRKSC","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OYKNRKSCQ7SJWT3UGII3JRI6U3","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-09T16:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"af2d522d406bdeaf84d8442cfce3bc5d4880f61e6b6278fe876befb4a8293308","abstract_canon_sha256":"8ba1abe17a0a1652199221fa4a9d0c2d76c738adab9e41e827e4c0a8de540abd"},"schema_version":"1.0"},"canonical_sha256":"7614d8aa4287e49b4f743211b4c51ea6e33a5199879279bc73240ba2ce08f81f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.004967Z","signature_b64":"lMZttMTDVpWHXmVfWs0+cTCxTsBTh2iT9u7Ii9iS5qg8iCROoU1MwhVY9zzaeizV0ppabj2hLTkH7KqMmWYGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7614d8aa4287e49b4f743211b4c51ea6e33a5199879279bc73240ba2ce08f81f","last_reissued_at":"2026-05-18T00:30:56.004264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.004264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03471","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:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJtbUnA7DEgCBmmXJPF3CoGkaFW0fy6EN1QFSoiEdGh0QNp0ukR7srgpyJevQdyyb5gKZQZGlAosbzzeS4llDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:32:51.466692Z"},"content_sha256":"71bbfdbaaa1d3eca81834d52d82a04089c4706fbc8f5c0b026460228658a3ec4","schema_version":"1.0","event_id":"sha256:71bbfdbaaa1d3eca81834d52d82a04089c4706fbc8f5c0b026460228658a3ec4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OYKNRKSCQ7SJWT3UGII3JRI6U3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AC Transmission Network Expansion Planning: A Semidefinite Programming Branch-and-Cut Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bissan Ghaddar, Rabih Jabr","submitted_at":"2017-11-09T16:54:51Z","abstract_excerpt":"Transmission network expansion planning is a mixed-integer optimization problem, whose solution is used to guide future investment in transmission equipment. An approach is presented to find the global solution of the transmission planning problem using an AC network model. The approach builds on the semidefinite relaxation of the AC optimal power flow problem (ACOPF); its computational engine is a new specialized branch-and-cut algorithm for transmission expansion planning to deal with the underlying mixed-integer ACOPF problem. Valid inequalities that are based on specific knowledge of the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03471","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:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYIF7Gh6mcqULwGrAazb09EIEe5XB+M4xcjYPnk71idom6UW61DlOF4Tn7IPmj0z/lusBdBtAyVd6xx91O+aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:32:51.467036Z"},"content_sha256":"605aeb2dfe2796902bf440b87423feac6e1b4dc617a82637f53f6fcba5b81e6e","schema_version":"1.0","event_id":"sha256:605aeb2dfe2796902bf440b87423feac6e1b4dc617a82637f53f6fcba5b81e6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYKNRKSCQ7SJWT3UGII3JRI6U3/bundle.json","state_url":"https://pith.science/pith/OYKNRKSCQ7SJWT3UGII3JRI6U3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYKNRKSCQ7SJWT3UGII3JRI6U3/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-25T19:32:51Z","links":{"resolver":"https://pith.science/pith/OYKNRKSCQ7SJWT3UGII3JRI6U3","bundle":"https://pith.science/pith/OYKNRKSCQ7SJWT3UGII3JRI6U3/bundle.json","state":"https://pith.science/pith/OYKNRKSCQ7SJWT3UGII3JRI6U3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYKNRKSCQ7SJWT3UGII3JRI6U3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OYKNRKSCQ7SJWT3UGII3JRI6U3","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":"8ba1abe17a0a1652199221fa4a9d0c2d76c738adab9e41e827e4c0a8de540abd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-09T16:54:51Z","title_canon_sha256":"af2d522d406bdeaf84d8442cfce3bc5d4880f61e6b6278fe876befb4a8293308"},"schema_version":"1.0","source":{"id":"1711.03471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03471","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03471v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03471","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"OYKNRKSCQ7SJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OYKNRKSCQ7SJWT3U","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OYKNRKSC","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:605aeb2dfe2796902bf440b87423feac6e1b4dc617a82637f53f6fcba5b81e6e","target":"graph","created_at":"2026-05-18T00:30:56Z","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":"Transmission network expansion planning is a mixed-integer optimization problem, whose solution is used to guide future investment in transmission equipment. An approach is presented to find the global solution of the transmission planning problem using an AC network model. The approach builds on the semidefinite relaxation of the AC optimal power flow problem (ACOPF); its computational engine is a new specialized branch-and-cut algorithm for transmission expansion planning to deal with the underlying mixed-integer ACOPF problem. Valid inequalities that are based on specific knowledge of the e","authors_text":"Bissan Ghaddar, Rabih Jabr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-09T16:54:51Z","title":"AC Transmission Network Expansion Planning: A Semidefinite Programming Branch-and-Cut Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03471","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:71bbfdbaaa1d3eca81834d52d82a04089c4706fbc8f5c0b026460228658a3ec4","target":"record","created_at":"2026-05-18T00:30:56Z","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":"8ba1abe17a0a1652199221fa4a9d0c2d76c738adab9e41e827e4c0a8de540abd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-09T16:54:51Z","title_canon_sha256":"af2d522d406bdeaf84d8442cfce3bc5d4880f61e6b6278fe876befb4a8293308"},"schema_version":"1.0","source":{"id":"1711.03471","kind":"arxiv","version":1}},"canonical_sha256":"7614d8aa4287e49b4f743211b4c51ea6e33a5199879279bc73240ba2ce08f81f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7614d8aa4287e49b4f743211b4c51ea6e33a5199879279bc73240ba2ce08f81f","first_computed_at":"2026-05-18T00:30:56.004264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:56.004264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lMZttMTDVpWHXmVfWs0+cTCxTsBTh2iT9u7Ii9iS5qg8iCROoU1MwhVY9zzaeizV0ppabj2hLTkH7KqMmWYGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:56.004967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71bbfdbaaa1d3eca81834d52d82a04089c4706fbc8f5c0b026460228658a3ec4","sha256:605aeb2dfe2796902bf440b87423feac6e1b4dc617a82637f53f6fcba5b81e6e"],"state_sha256":"014125feee2f5eab0f91304f43acb21d29f2106b7a02bf30db066e368db5d7c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RPg4Xs20B7h99c5C3rGjy5XavieEG9npFl3WAjP4HSmNCVrrGRhXhW9b/mLZrbdEqx0W8n/MqicpmQ7dA2dBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:32:51.468963Z","bundle_sha256":"5a62fec78c6a77a7af522f8fb96d877ecc0e8a931d94e88826335a449a1f211e"}}