{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4DRVQCXLCIMI36Q7V7WHTZGP3E","short_pith_number":"pith:4DRVQCXL","canonical_record":{"source":{"id":"2310.13143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-19T20:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"a6dada48957e8ee457698ef8e3da1fc689c7a48fe47fcfad778f0ef5b4fd1444","abstract_canon_sha256":"8ee09c03396c2358af3a824d6aefc5d8f83860c82dac732ad73b37468766f13c"},"schema_version":"1.0"},"canonical_sha256":"e0e3580aeb12188dfa1fafec79e4cfd914474daa0c07af323e97492230efdfc2","source":{"kind":"arxiv","id":"2310.13143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.13143","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"2310.13143v1","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.13143","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"4DRVQCXLCIMI","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"pith_short_16","alias_value":"4DRVQCXLCIMI36Q7","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"pith_short_8","alias_value":"4DRVQCXL","created_at":"2026-07-05T07:02:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4DRVQCXLCIMI36Q7V7WHTZGP3E","target":"record","payload":{"canonical_record":{"source":{"id":"2310.13143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-19T20:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"a6dada48957e8ee457698ef8e3da1fc689c7a48fe47fcfad778f0ef5b4fd1444","abstract_canon_sha256":"8ee09c03396c2358af3a824d6aefc5d8f83860c82dac732ad73b37468766f13c"},"schema_version":"1.0"},"canonical_sha256":"e0e3580aeb12188dfa1fafec79e4cfd914474daa0c07af323e97492230efdfc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:57.753782Z","signature_b64":"ZOSyDx/Yh7PV9inZZb/8kLRvgssU96HPXkLWT27udIVnYiIhqum9jKwegjRRKMiN51+xZvs4EPTu51pnWgIhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e3580aeb12188dfa1fafec79e4cfd914474daa0c07af323e97492230efdfc2","last_reissued_at":"2026-07-05T07:02:57.753338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:57.753338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.13143","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-05T07:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8Kzmo22w2x5lzOeChum2Kstk5jERkrmqptrLCOtSMoudk+dxh8eI+Nj47zXgBCIoD8FGmecWdQlWmE7+MnWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T05:23:04.967146Z"},"content_sha256":"cc7ec8c3dbaac082821a40e7726f4e8a5d7ada51784124bcf1e04b6e13371b7b","schema_version":"1.0","event_id":"sha256:cc7ec8c3dbaac082821a40e7726f4e8a5d7ada51784124bcf1e04b6e13371b7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4DRVQCXLCIMI36Q7V7WHTZGP3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GPU-Accelerated Sequential Quadratic Programming Algorithm for Solving ACOPF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bowen Li, Kibaek Kim, Michel Schanen","submitted_at":"2023-10-19T20:37:29Z","abstract_excerpt":"Sequential quadratic programming (SQP) is widely used in solving nonlinear optimization problem, with advantages of warm-starting solutions, as well as finding high-accurate solution and converging quadratically using second-order information, such as the Hessian matrix. In this study we develop a scalable SQP algorithm for solving the alternate current optimal power flow problem (ACOPF), leveraging the parallel computing capabilities of graphics processing units (GPUs). Our methodology incorporates the alternating direction method of multipliers (ADMM) to initialize and decompose the quadrati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.13143","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/2310.13143/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-05T07:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fdo2bfav0l5RjS0YgglY9LHjwf9aq1VQ2XL8xBPybJmpkhr9wQPjY/hGXguxPi1+AVXV7TDMnSRn7/3ajpNnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T05:23:04.967540Z"},"content_sha256":"e5a75d866d6d814792ec8631762fe772ad0b5749bda6699ad1c1937cc668a8c1","schema_version":"1.0","event_id":"sha256:e5a75d866d6d814792ec8631762fe772ad0b5749bda6699ad1c1937cc668a8c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DRVQCXLCIMI36Q7V7WHTZGP3E/bundle.json","state_url":"https://pith.science/pith/4DRVQCXLCIMI36Q7V7WHTZGP3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DRVQCXLCIMI36Q7V7WHTZGP3E/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-22T05:23:04Z","links":{"resolver":"https://pith.science/pith/4DRVQCXLCIMI36Q7V7WHTZGP3E","bundle":"https://pith.science/pith/4DRVQCXLCIMI36Q7V7WHTZGP3E/bundle.json","state":"https://pith.science/pith/4DRVQCXLCIMI36Q7V7WHTZGP3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DRVQCXLCIMI36Q7V7WHTZGP3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4DRVQCXLCIMI36Q7V7WHTZGP3E","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":"8ee09c03396c2358af3a824d6aefc5d8f83860c82dac732ad73b37468766f13c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-19T20:37:29Z","title_canon_sha256":"a6dada48957e8ee457698ef8e3da1fc689c7a48fe47fcfad778f0ef5b4fd1444"},"schema_version":"1.0","source":{"id":"2310.13143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.13143","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"2310.13143v1","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.13143","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"4DRVQCXLCIMI","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"pith_short_16","alias_value":"4DRVQCXLCIMI36Q7","created_at":"2026-07-05T07:02:57Z"},{"alias_kind":"pith_short_8","alias_value":"4DRVQCXL","created_at":"2026-07-05T07:02:57Z"}],"graph_snapshots":[{"event_id":"sha256:e5a75d866d6d814792ec8631762fe772ad0b5749bda6699ad1c1937cc668a8c1","target":"graph","created_at":"2026-07-05T07:02:57Z","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/2310.13143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sequential quadratic programming (SQP) is widely used in solving nonlinear optimization problem, with advantages of warm-starting solutions, as well as finding high-accurate solution and converging quadratically using second-order information, such as the Hessian matrix. In this study we develop a scalable SQP algorithm for solving the alternate current optimal power flow problem (ACOPF), leveraging the parallel computing capabilities of graphics processing units (GPUs). Our methodology incorporates the alternating direction method of multipliers (ADMM) to initialize and decompose the quadrati","authors_text":"Bowen Li, Kibaek Kim, Michel Schanen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-19T20:37:29Z","title":"GPU-Accelerated Sequential Quadratic Programming Algorithm for Solving ACOPF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.13143","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:cc7ec8c3dbaac082821a40e7726f4e8a5d7ada51784124bcf1e04b6e13371b7b","target":"record","created_at":"2026-07-05T07:02:57Z","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":"8ee09c03396c2358af3a824d6aefc5d8f83860c82dac732ad73b37468766f13c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-19T20:37:29Z","title_canon_sha256":"a6dada48957e8ee457698ef8e3da1fc689c7a48fe47fcfad778f0ef5b4fd1444"},"schema_version":"1.0","source":{"id":"2310.13143","kind":"arxiv","version":1}},"canonical_sha256":"e0e3580aeb12188dfa1fafec79e4cfd914474daa0c07af323e97492230efdfc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0e3580aeb12188dfa1fafec79e4cfd914474daa0c07af323e97492230efdfc2","first_computed_at":"2026-07-05T07:02:57.753338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:02:57.753338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZOSyDx/Yh7PV9inZZb/8kLRvgssU96HPXkLWT27udIVnYiIhqum9jKwegjRRKMiN51+xZvs4EPTu51pnWgIhBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:02:57.753782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.13143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc7ec8c3dbaac082821a40e7726f4e8a5d7ada51784124bcf1e04b6e13371b7b","sha256:e5a75d866d6d814792ec8631762fe772ad0b5749bda6699ad1c1937cc668a8c1"],"state_sha256":"b943c40836a37d9403c64e5c560f466342fa79c206580c135e518e53088daf6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19vEJhoBdss8I3zRGGm/iMCfChIQcyvF3buYiOKDNrdjZOu1Cbg7/PrR7931Xiqa0hbiqfsMrWYD26TCLw5sAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T05:23:04.969702Z","bundle_sha256":"7f759fc3da576b753643a92e3072c4e0d6aeafda7bca7181ebec25402e1e8d6f"}}