{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BU26P6JEURJS3LJVD4AGVHFQLG","short_pith_number":"pith:BU26P6JE","canonical_record":{"source":{"id":"2411.10658","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-16T01:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"d7f7d7be93e307ee88a12cb9f746eb1db9e031b11890d540849549af4455909f","abstract_canon_sha256":"1f22e2f09f1ef1f6120cd9c94b008f0e686b36bb36ad83dc9eb61e15d60faef2"},"schema_version":"1.0"},"canonical_sha256":"0d35e7f924a4532dad351f006a9cb059a75c2720cbbec120a676583f59eb4511","source":{"kind":"arxiv","id":"2411.10658","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10658","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10658v2","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10658","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"BU26P6JEURJS","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"BU26P6JEURJS3LJV","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"BU26P6JE","created_at":"2026-07-05T10:41:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BU26P6JEURJS3LJVD4AGVHFQLG","target":"record","payload":{"canonical_record":{"source":{"id":"2411.10658","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-16T01:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"d7f7d7be93e307ee88a12cb9f746eb1db9e031b11890d540849549af4455909f","abstract_canon_sha256":"1f22e2f09f1ef1f6120cd9c94b008f0e686b36bb36ad83dc9eb61e15d60faef2"},"schema_version":"1.0"},"canonical_sha256":"0d35e7f924a4532dad351f006a9cb059a75c2720cbbec120a676583f59eb4511","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:50.336003Z","signature_b64":"SLhEYAbwjIT/46lap8AGWE+4CeZr+N5YX3rL5j4XhuyXaJQAsO9ejyNI5PGsn8oUCroh8nVjc3RnDPkVw9yGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d35e7f924a4532dad351f006a9cb059a75c2720cbbec120a676583f59eb4511","last_reissued_at":"2026-07-05T10:41:50.335500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:50.335500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.10658","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-07-05T10:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vi1rBj7ffGcZuIhLSiWVnNnKltSLKkAIlR8IhQZnrS37euLXUZdglcPCSeGkJX35MRwJtwkZ8A1U+klJZgPECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:49:22.769548Z"},"content_sha256":"e8fb754e2d1f3c559d3e58f638195b44f6380b6289ccc9631d26043e5de9b780","schema_version":"1.0","event_id":"sha256:e8fb754e2d1f3c559d3e58f638195b44f6380b6289ccc9631d26043e5de9b780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BU26P6JEURJS3LJVD4AGVHFQLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Optimization Method Based On Optimal Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Huanshui Zhang, Liping Zhang, Yeming Xu, Yue Sun, Ziyuan Guo","submitted_at":"2024-11-16T01:35:39Z","abstract_excerpt":"In this paper, a novel distributed optimization framework has been proposed. The key idea is to convert optimization problems into optimal control problems where the objective of each agent is to design the current control input minimizing the original objective function of itself and updated size for the future time instant. Compared with the existing distributed optimization problem for optimizing a sum of convex objective functions corresponding to multiple agents, we present a distributed optimization algorithm for multi-agents system based on the results from the maximum principle. Moreov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10658","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.10658/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-05T10:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBjZHQXEN630lGkNToXxIrsunXqaOkhgWye0hLoZasQ/DW7iwLj3aRwAkSRlLoDhoGVxbWq8yl2HiqdZqh9KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:49:22.770054Z"},"content_sha256":"69d97ffe4c2d7fbba0302d5af9285a8c817a142bef69fb58fed6d3d94bdbc147","schema_version":"1.0","event_id":"sha256:69d97ffe4c2d7fbba0302d5af9285a8c817a142bef69fb58fed6d3d94bdbc147"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BU26P6JEURJS3LJVD4AGVHFQLG/bundle.json","state_url":"https://pith.science/pith/BU26P6JEURJS3LJVD4AGVHFQLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BU26P6JEURJS3LJVD4AGVHFQLG/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-18T19:49:22Z","links":{"resolver":"https://pith.science/pith/BU26P6JEURJS3LJVD4AGVHFQLG","bundle":"https://pith.science/pith/BU26P6JEURJS3LJVD4AGVHFQLG/bundle.json","state":"https://pith.science/pith/BU26P6JEURJS3LJVD4AGVHFQLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BU26P6JEURJS3LJVD4AGVHFQLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BU26P6JEURJS3LJVD4AGVHFQLG","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":"1f22e2f09f1ef1f6120cd9c94b008f0e686b36bb36ad83dc9eb61e15d60faef2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-16T01:35:39Z","title_canon_sha256":"d7f7d7be93e307ee88a12cb9f746eb1db9e031b11890d540849549af4455909f"},"schema_version":"1.0","source":{"id":"2411.10658","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10658","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10658v2","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10658","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"BU26P6JEURJS","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"BU26P6JEURJS3LJV","created_at":"2026-07-05T10:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"BU26P6JE","created_at":"2026-07-05T10:41:50Z"}],"graph_snapshots":[{"event_id":"sha256:69d97ffe4c2d7fbba0302d5af9285a8c817a142bef69fb58fed6d3d94bdbc147","target":"graph","created_at":"2026-07-05T10:41:50Z","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/2411.10658/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, a novel distributed optimization framework has been proposed. The key idea is to convert optimization problems into optimal control problems where the objective of each agent is to design the current control input minimizing the original objective function of itself and updated size for the future time instant. Compared with the existing distributed optimization problem for optimizing a sum of convex objective functions corresponding to multiple agents, we present a distributed optimization algorithm for multi-agents system based on the results from the maximum principle. Moreov","authors_text":"Huanshui Zhang, Liping Zhang, Yeming Xu, Yue Sun, Ziyuan Guo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-16T01:35:39Z","title":"Distributed Optimization Method Based On Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10658","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:e8fb754e2d1f3c559d3e58f638195b44f6380b6289ccc9631d26043e5de9b780","target":"record","created_at":"2026-07-05T10:41:50Z","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":"1f22e2f09f1ef1f6120cd9c94b008f0e686b36bb36ad83dc9eb61e15d60faef2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-16T01:35:39Z","title_canon_sha256":"d7f7d7be93e307ee88a12cb9f746eb1db9e031b11890d540849549af4455909f"},"schema_version":"1.0","source":{"id":"2411.10658","kind":"arxiv","version":2}},"canonical_sha256":"0d35e7f924a4532dad351f006a9cb059a75c2720cbbec120a676583f59eb4511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d35e7f924a4532dad351f006a9cb059a75c2720cbbec120a676583f59eb4511","first_computed_at":"2026-07-05T10:41:50.335500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:41:50.335500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SLhEYAbwjIT/46lap8AGWE+4CeZr+N5YX3rL5j4XhuyXaJQAsO9ejyNI5PGsn8oUCroh8nVjc3RnDPkVw9yGBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:41:50.336003Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.10658","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8fb754e2d1f3c559d3e58f638195b44f6380b6289ccc9631d26043e5de9b780","sha256:69d97ffe4c2d7fbba0302d5af9285a8c817a142bef69fb58fed6d3d94bdbc147"],"state_sha256":"1eadd167fbc64f66be3b23f2a6251a3554a7fd00e913aefd900da1de5679bb76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPB8kqS88RedX+Bfeb8txLVFq8GaWxo4OpaecikBb46Wjg3qcY9lKz8D+HRnw3866WR1MENfSYOj/oEWsSheBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T19:49:22.775989Z","bundle_sha256":"a06d97fa634822a87a0e115b9486a7440414459f4c70db025bc2159f56339cc4"}}