{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:735RYXLTIDKROT4ME3YLAK7MFD","short_pith_number":"pith:735RYXLT","canonical_record":{"source":{"id":"2312.01334","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-03T09:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"3c8f7c687a79d8b2ac355412c2ed1984e543b4eb327223ad8fb0fa6cdf255851","abstract_canon_sha256":"0eab71342b709f006f9ded5c320212a49d3e0f8ab9ecc06d6fa269b089aaaab5"},"schema_version":"1.0"},"canonical_sha256":"fefb1c5d7340d5174f8c26f0b02bec28d58bfe767b3575e9c5261340743f0369","source":{"kind":"arxiv","id":"2312.01334","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.01334","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"2312.01334v3","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01334","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"735RYXLTIDKR","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"pith_short_16","alias_value":"735RYXLTIDKROT4M","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"pith_short_8","alias_value":"735RYXLT","created_at":"2026-07-05T10:41:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:735RYXLTIDKROT4ME3YLAK7MFD","target":"record","payload":{"canonical_record":{"source":{"id":"2312.01334","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-03T09:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"3c8f7c687a79d8b2ac355412c2ed1984e543b4eb327223ad8fb0fa6cdf255851","abstract_canon_sha256":"0eab71342b709f006f9ded5c320212a49d3e0f8ab9ecc06d6fa269b089aaaab5"},"schema_version":"1.0"},"canonical_sha256":"fefb1c5d7340d5174f8c26f0b02bec28d58bfe767b3575e9c5261340743f0369","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:44.870477Z","signature_b64":"U3NvXtDKzkoTeTw2V7s5R63qMbMHf52kcgamhirP60mJzENPr06fheUJy1TsbP7rvYYhKcA0rvLZMxhqdX9uCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefb1c5d7340d5174f8c26f0b02bec28d58bfe767b3575e9c5261340743f0369","last_reissued_at":"2026-07-05T10:41:44.870021Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:44.870021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.01334","source_version":3,"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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABEXenwCSCoU+B2J1tzwHbOax7k9A8aKYHuVn9dAYu/tUH9cQnppHPIMkw9K+6HlsuPftyrEBcZyA4YlfXOmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T02:12:04.925373Z"},"content_sha256":"b1508de2581fd42273b9c39c87fe8a10de7d0418b7e727b3d4c5f2008c4aafa1","schema_version":"1.0","event_id":"sha256:b1508de2581fd42273b9c39c87fe8a10de7d0418b7e727b3d4c5f2008c4aafa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:735RYXLTIDKROT4ME3YLAK7MFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization Methods Rooting in Optimal Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongxia Wang, Huanshui Zhang","submitted_at":"2023-12-03T09:50:42Z","abstract_excerpt":"In the paper, we propose solving optimization problems (OPs) and understanding the Newton method from the optimal control view. We propose a new optimization algorithm based on the optimal control problem (OCP). The algorithm features converging more rapidly than gradient descent, meanwhile, it is superior to Newton's method because it is not divergent in general and can be applied in the case of a singular Hessian matrix. These merits are supported by the convergence analysis for the algorithm in the paper. We also point out that the convergence rate of the proposed algorithm is inversely pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01334","kind":"arxiv","version":3},"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/2312.01334/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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhOAX8t17BhNXlZPwCM3BajLZtfhIdHzgduUWW4lgmpzZGsxqqQrdTDGBNgZicN2d04msg9IgSbBTn7zvjw0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T02:12:04.925876Z"},"content_sha256":"ff7860ade0408e2a50da1008674d3a0d4324c1378c7cb0e7534b2f78ee1ae488","schema_version":"1.0","event_id":"sha256:ff7860ade0408e2a50da1008674d3a0d4324c1378c7cb0e7534b2f78ee1ae488"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/bundle.json","state_url":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/735RYXLTIDKROT4ME3YLAK7MFD/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-19T02:12:04Z","links":{"resolver":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD","bundle":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/bundle.json","state":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/735RYXLTIDKROT4ME3YLAK7MFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:735RYXLTIDKROT4ME3YLAK7MFD","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":"0eab71342b709f006f9ded5c320212a49d3e0f8ab9ecc06d6fa269b089aaaab5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-03T09:50:42Z","title_canon_sha256":"3c8f7c687a79d8b2ac355412c2ed1984e543b4eb327223ad8fb0fa6cdf255851"},"schema_version":"1.0","source":{"id":"2312.01334","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.01334","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"2312.01334v3","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01334","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"735RYXLTIDKR","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"pith_short_16","alias_value":"735RYXLTIDKROT4M","created_at":"2026-07-05T10:41:44Z"},{"alias_kind":"pith_short_8","alias_value":"735RYXLT","created_at":"2026-07-05T10:41:44Z"}],"graph_snapshots":[{"event_id":"sha256:ff7860ade0408e2a50da1008674d3a0d4324c1378c7cb0e7534b2f78ee1ae488","target":"graph","created_at":"2026-07-05T10:41:44Z","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/2312.01334/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the paper, we propose solving optimization problems (OPs) and understanding the Newton method from the optimal control view. We propose a new optimization algorithm based on the optimal control problem (OCP). The algorithm features converging more rapidly than gradient descent, meanwhile, it is superior to Newton's method because it is not divergent in general and can be applied in the case of a singular Hessian matrix. These merits are supported by the convergence analysis for the algorithm in the paper. We also point out that the convergence rate of the proposed algorithm is inversely pro","authors_text":"Hongxia Wang, Huanshui Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-03T09:50:42Z","title":"Optimization Methods Rooting in Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01334","kind":"arxiv","version":3},"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:b1508de2581fd42273b9c39c87fe8a10de7d0418b7e727b3d4c5f2008c4aafa1","target":"record","created_at":"2026-07-05T10:41:44Z","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":"0eab71342b709f006f9ded5c320212a49d3e0f8ab9ecc06d6fa269b089aaaab5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-03T09:50:42Z","title_canon_sha256":"3c8f7c687a79d8b2ac355412c2ed1984e543b4eb327223ad8fb0fa6cdf255851"},"schema_version":"1.0","source":{"id":"2312.01334","kind":"arxiv","version":3}},"canonical_sha256":"fefb1c5d7340d5174f8c26f0b02bec28d58bfe767b3575e9c5261340743f0369","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fefb1c5d7340d5174f8c26f0b02bec28d58bfe767b3575e9c5261340743f0369","first_computed_at":"2026-07-05T10:41:44.870021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:41:44.870021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3NvXtDKzkoTeTw2V7s5R63qMbMHf52kcgamhirP60mJzENPr06fheUJy1TsbP7rvYYhKcA0rvLZMxhqdX9uCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:41:44.870477Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.01334","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1508de2581fd42273b9c39c87fe8a10de7d0418b7e727b3d4c5f2008c4aafa1","sha256:ff7860ade0408e2a50da1008674d3a0d4324c1378c7cb0e7534b2f78ee1ae488"],"state_sha256":"9858df2d26aac30870738cca66e5411b850b9cac6aeac5bce85bd71a34cdb58a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3AfLm0jT+WnOXpkEKHIDQKSrQwLrNofd/Zn3PHlS0EDtfUXubML61EUB8y2YKQjlIze2p+XStXqLxom+mf7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T02:12:04.929542Z","bundle_sha256":"1ffddd462329a9c5f6d68f43655be9619ea0184aec9b77bd31c89bf8644d86f2"}}