{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VSDXBS3XQIBOHLR6A3VV5MG42H","short_pith_number":"pith:VSDXBS3X","canonical_record":{"source":{"id":"2406.11899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-15T02:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"48ef4b2ac6a6731c54e237ab4fbf8433ba47bb79879410ec8e96d6ac075293a9","abstract_canon_sha256":"391cfa793abe2aafd37910e88d98e61f9b0874ba47dafb6d259a098fc15018d0"},"schema_version":"1.0"},"canonical_sha256":"ac8770cb778202e3ae3e06eb5eb0dcd1e8a7508dfdc5077b228c2649d10cd022","source":{"kind":"arxiv","id":"2406.11899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.11899","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.11899v1","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11899","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"pith_short_12","alias_value":"VSDXBS3XQIBO","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"pith_short_16","alias_value":"VSDXBS3XQIBOHLR6","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"pith_short_8","alias_value":"VSDXBS3X","created_at":"2026-07-05T08:33:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VSDXBS3XQIBOHLR6A3VV5MG42H","target":"record","payload":{"canonical_record":{"source":{"id":"2406.11899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-15T02:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"48ef4b2ac6a6731c54e237ab4fbf8433ba47bb79879410ec8e96d6ac075293a9","abstract_canon_sha256":"391cfa793abe2aafd37910e88d98e61f9b0874ba47dafb6d259a098fc15018d0"},"schema_version":"1.0"},"canonical_sha256":"ac8770cb778202e3ae3e06eb5eb0dcd1e8a7508dfdc5077b228c2649d10cd022","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:03.388686Z","signature_b64":"rOprY66SqQJYeqbBPci7hIcT9oDKfckxtYc4aEhc+RBJpVREPBeVItI+9eOkZ2BMKoPh3mSDEsemk/Y1wMDmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8770cb778202e3ae3e06eb5eb0dcd1e8a7508dfdc5077b228c2649d10cd022","last_reissued_at":"2026-07-05T08:33:03.388261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:03.388261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.11899","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-07-05T08:33:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUJEqcLIWP5z749wvnMK/ROdqfgB5xRhOV46hvoHA3IgX5d7Wu4yXbG4Enoseu68h0Sf8Lruk0SJngHGt4GABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:51:43.688662Z"},"content_sha256":"4142ba4a7230b22792492564d9a94d82164469673622998e8b838c928612acba","schema_version":"1.0","event_id":"sha256:4142ba4a7230b22792492564d9a94d82164469673622998e8b838c928612acba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VSDXBS3XQIBOHLR6A3VV5MG42H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Global Solution Algorithm for AC Optimal Power Flow through Linear Constrained Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masoud Barati","submitted_at":"2024-06-15T02:46:09Z","abstract_excerpt":"We formulate the Alternating Current Optimal Power Flow Problem (ACOPF) as a Linear Constrained Quadratic Program (LCQP) with many negative eigenvalues ($r$) and linear constraints, making it NP-hard. We propose two algorithms, Feasible Successive Linear Programming (FSLP) and Feasible Branch-and-Bound (FBB), for a global optimal solution. These use optimization strategies like bounded successive linear programming, convex relaxation, initialization, and branch-and-bound to find a globally optimal solution within a predefined $\\epsilon$-tolerance. The complexity of FSLP and FBB is $\\mathcal{O}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11899","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.11899/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:33:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"917qfM0k3cDeWw43TfXdA9/kHbRBToIUihHr+R686A8QOgFG3pWRY0YAb4c7fZIye3lQ+jzKtIESLJAGGF+VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:51:43.689001Z"},"content_sha256":"4723bdbdb1b3a98422189f9f7c65854d26530b19ebac2667cededa2d8ee9cbde","schema_version":"1.0","event_id":"sha256:4723bdbdb1b3a98422189f9f7c65854d26530b19ebac2667cededa2d8ee9cbde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSDXBS3XQIBOHLR6A3VV5MG42H/bundle.json","state_url":"https://pith.science/pith/VSDXBS3XQIBOHLR6A3VV5MG42H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSDXBS3XQIBOHLR6A3VV5MG42H/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-08-21T16:51:43Z","links":{"resolver":"https://pith.science/pith/VSDXBS3XQIBOHLR6A3VV5MG42H","bundle":"https://pith.science/pith/VSDXBS3XQIBOHLR6A3VV5MG42H/bundle.json","state":"https://pith.science/pith/VSDXBS3XQIBOHLR6A3VV5MG42H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSDXBS3XQIBOHLR6A3VV5MG42H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VSDXBS3XQIBOHLR6A3VV5MG42H","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":"391cfa793abe2aafd37910e88d98e61f9b0874ba47dafb6d259a098fc15018d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-15T02:46:09Z","title_canon_sha256":"48ef4b2ac6a6731c54e237ab4fbf8433ba47bb79879410ec8e96d6ac075293a9"},"schema_version":"1.0","source":{"id":"2406.11899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.11899","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.11899v1","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11899","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"pith_short_12","alias_value":"VSDXBS3XQIBO","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"pith_short_16","alias_value":"VSDXBS3XQIBOHLR6","created_at":"2026-07-05T08:33:03Z"},{"alias_kind":"pith_short_8","alias_value":"VSDXBS3X","created_at":"2026-07-05T08:33:03Z"}],"graph_snapshots":[{"event_id":"sha256:4723bdbdb1b3a98422189f9f7c65854d26530b19ebac2667cededa2d8ee9cbde","target":"graph","created_at":"2026-07-05T08:33:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.11899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We formulate the Alternating Current Optimal Power Flow Problem (ACOPF) as a Linear Constrained Quadratic Program (LCQP) with many negative eigenvalues ($r$) and linear constraints, making it NP-hard. We propose two algorithms, Feasible Successive Linear Programming (FSLP) and Feasible Branch-and-Bound (FBB), for a global optimal solution. These use optimization strategies like bounded successive linear programming, convex relaxation, initialization, and branch-and-bound to find a globally optimal solution within a predefined $\\epsilon$-tolerance. The complexity of FSLP and FBB is $\\mathcal{O}","authors_text":"Masoud Barati","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-15T02:46:09Z","title":"A Global Solution Algorithm for AC Optimal Power Flow through Linear Constrained Quadratic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11899","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:4142ba4a7230b22792492564d9a94d82164469673622998e8b838c928612acba","target":"record","created_at":"2026-07-05T08:33:03Z","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":"391cfa793abe2aafd37910e88d98e61f9b0874ba47dafb6d259a098fc15018d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-15T02:46:09Z","title_canon_sha256":"48ef4b2ac6a6731c54e237ab4fbf8433ba47bb79879410ec8e96d6ac075293a9"},"schema_version":"1.0","source":{"id":"2406.11899","kind":"arxiv","version":1}},"canonical_sha256":"ac8770cb778202e3ae3e06eb5eb0dcd1e8a7508dfdc5077b228c2649d10cd022","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac8770cb778202e3ae3e06eb5eb0dcd1e8a7508dfdc5077b228c2649d10cd022","first_computed_at":"2026-07-05T08:33:03.388261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:33:03.388261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOprY66SqQJYeqbBPci7hIcT9oDKfckxtYc4aEhc+RBJpVREPBeVItI+9eOkZ2BMKoPh3mSDEsemk/Y1wMDmBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:33:03.388686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.11899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4142ba4a7230b22792492564d9a94d82164469673622998e8b838c928612acba","sha256:4723bdbdb1b3a98422189f9f7c65854d26530b19ebac2667cededa2d8ee9cbde"],"state_sha256":"13a9ed67d5af5111f7329e9c099f5a849d289c21088e6fa3fef7d0d366bbe5b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ReVUH19XYcpDdKDrCDEjsy5AxyVHtGwtmhSVIosxKEKqPf/19KcY2GX82aUgGf5ukou+hZnmqtE6UFCI8TScDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T16:51:43.692265Z","bundle_sha256":"92ae82dfc50ace7cafcea24651a25eb82625139c4dc0abb2366cc8fdf4806db7"}}