{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2UANZSSZNVEL2YQ3VXEZ5DFXEI","short_pith_number":"pith:2UANZSSZ","canonical_record":{"source":{"id":"1502.03777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T19:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"45fae39dc0fedf32a60e75ad4add3e58a978d04f39c4fae625999655a0a2b663","abstract_canon_sha256":"4de935f0de2b9f5ace9a88dcfa16aed6c7f8c0e8f2c8b35a5fc1b08a41f76f2e"},"schema_version":"1.0"},"canonical_sha256":"d500dcca596d48bd621badc99e8cb72238eca963d6ff4b696067ea5eda6083fb","source":{"kind":"arxiv","id":"1502.03777","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03777","created_at":"2026-05-18T01:36:01Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03777v2","created_at":"2026-05-18T01:36:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03777","created_at":"2026-05-18T01:36:01Z"},{"alias_kind":"pith_short_12","alias_value":"2UANZSSZNVEL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UANZSSZNVEL2YQ3","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UANZSSZ","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2UANZSSZNVEL2YQ3VXEZ5DFXEI","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T19:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"45fae39dc0fedf32a60e75ad4add3e58a978d04f39c4fae625999655a0a2b663","abstract_canon_sha256":"4de935f0de2b9f5ace9a88dcfa16aed6c7f8c0e8f2c8b35a5fc1b08a41f76f2e"},"schema_version":"1.0"},"canonical_sha256":"d500dcca596d48bd621badc99e8cb72238eca963d6ff4b696067ea5eda6083fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:01.559436Z","signature_b64":"uIb41wrbVBn+rtqAEM50xY1tNxNbHOhXSTPyYxNBBI8J0/2dCMuwtZqsIuGkQNstoNY5A64rcHrK0rgATslxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d500dcca596d48bd621badc99e8cb72238eca963d6ff4b696067ea5eda6083fb","last_reissued_at":"2026-05-18T01:36:01.558967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:01.558967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03777","source_version":2,"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-18T01:36:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JXY6LMgfFcj925cAJ0qiIeqVeBM1Gha2rGAowcHcchyWCqIpe7AsOI+R+cpw4qo+ZPi1CCdCskxofk/sQQ3TDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:19:29.957349Z"},"content_sha256":"6746704ecf868b66089d67f18dc7d0c30d81428839a7f2de1656b03fadccdefe","schema_version":"1.0","event_id":"sha256:6746704ecf868b66089d67f18dc7d0c30d81428839a7f2de1656b03fadccdefe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2UANZSSZNVEL2YQ3VXEZ5DFXEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the AC Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Jean-Hubert Hours","submitted_at":"2015-02-12T19:20:47Z","abstract_excerpt":"A novel trust region method for solving linearly constrained nonlinear programs is presented. The proposed technique is amenable to a distributed implementation, as its salient ingredient is an alternating projected gradient sweep in place of the Cauchy point computation. It is proven that the algorithm yields a sequence that globally converges to a critical point. As a result of some changes to the standard trust region method, namely a proximal regularisation of the trust region subproblem, it is shown that the local convergence rate is linear with an arbitrarily small ratio. Thus, convergen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03777","kind":"arxiv","version":2},"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-18T01:36:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+GueJ66GWs9J2/MV0dJqfUWX73AJn6hiVAwloZuR0Ig1Ja61UTZ5SkeuwMfWBhSwj8l6Frnj8CBg0Vo4lHOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:19:29.957698Z"},"content_sha256":"45b2064c0d85a39f4eea398eec589c7248636a42a0cb7b98757a026e667f9fee","schema_version":"1.0","event_id":"sha256:45b2064c0d85a39f4eea398eec589c7248636a42a0cb7b98757a026e667f9fee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/bundle.json","state_url":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/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-01T22:19:29Z","links":{"resolver":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI","bundle":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/bundle.json","state":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2UANZSSZNVEL2YQ3VXEZ5DFXEI","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":"4de935f0de2b9f5ace9a88dcfa16aed6c7f8c0e8f2c8b35a5fc1b08a41f76f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T19:20:47Z","title_canon_sha256":"45fae39dc0fedf32a60e75ad4add3e58a978d04f39c4fae625999655a0a2b663"},"schema_version":"1.0","source":{"id":"1502.03777","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03777","created_at":"2026-05-18T01:36:01Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03777v2","created_at":"2026-05-18T01:36:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03777","created_at":"2026-05-18T01:36:01Z"},{"alias_kind":"pith_short_12","alias_value":"2UANZSSZNVEL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UANZSSZNVEL2YQ3","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UANZSSZ","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:45b2064c0d85a39f4eea398eec589c7248636a42a0cb7b98757a026e667f9fee","target":"graph","created_at":"2026-05-18T01:36:01Z","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":"A novel trust region method for solving linearly constrained nonlinear programs is presented. The proposed technique is amenable to a distributed implementation, as its salient ingredient is an alternating projected gradient sweep in place of the Cauchy point computation. It is proven that the algorithm yields a sequence that globally converges to a critical point. As a result of some changes to the standard trust region method, namely a proximal regularisation of the trust region subproblem, it is shown that the local convergence rate is linear with an arbitrarily small ratio. Thus, convergen","authors_text":"Colin N. Jones, Jean-Hubert Hours","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T19:20:47Z","title":"An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the AC Optimal Power Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03777","kind":"arxiv","version":2},"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:6746704ecf868b66089d67f18dc7d0c30d81428839a7f2de1656b03fadccdefe","target":"record","created_at":"2026-05-18T01:36:01Z","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":"4de935f0de2b9f5ace9a88dcfa16aed6c7f8c0e8f2c8b35a5fc1b08a41f76f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T19:20:47Z","title_canon_sha256":"45fae39dc0fedf32a60e75ad4add3e58a978d04f39c4fae625999655a0a2b663"},"schema_version":"1.0","source":{"id":"1502.03777","kind":"arxiv","version":2}},"canonical_sha256":"d500dcca596d48bd621badc99e8cb72238eca963d6ff4b696067ea5eda6083fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d500dcca596d48bd621badc99e8cb72238eca963d6ff4b696067ea5eda6083fb","first_computed_at":"2026-05-18T01:36:01.558967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:01.558967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uIb41wrbVBn+rtqAEM50xY1tNxNbHOhXSTPyYxNBBI8J0/2dCMuwtZqsIuGkQNstoNY5A64rcHrK0rgATslxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:01.559436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03777","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6746704ecf868b66089d67f18dc7d0c30d81428839a7f2de1656b03fadccdefe","sha256:45b2064c0d85a39f4eea398eec589c7248636a42a0cb7b98757a026e667f9fee"],"state_sha256":"3df55c310a326aa0460e542b28b32053b5d74826a41de8e83b01fa8a86236d1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ibp8vKezZm1IqAaBwkBzn7dBakn19buPYptXmh0TrYL5qF1IAuyhew3Jg+NGU4qpOrmm+EwOztuLb5PnEgC+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:19:29.959579Z","bundle_sha256":"679526083645469a499a24991e8621f7060006ee64fff66b784299c75703a1c0"}}