{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4V56AH3NRC4R74V2JNLGK52VQV","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":"4f4a2b6620ac8bc4cabdff47dd954aba761f49753e68849de8e794dd87ba4618","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-09T16:45:19Z","title_canon_sha256":"861a94b35a7e0bfb22b25b66ce765a79a737b9de44362f3f208339d6c5b3046c"},"schema_version":"1.0","source":{"id":"2109.04405","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.04405","created_at":"2026-07-05T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"2109.04405v5","created_at":"2026-07-05T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.04405","created_at":"2026-07-05T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"4V56AH3NRC4R","created_at":"2026-07-05T03:50:36Z"},{"alias_kind":"pith_short_16","alias_value":"4V56AH3NRC4R74V2","created_at":"2026-07-05T03:50:36Z"},{"alias_kind":"pith_short_8","alias_value":"4V56AH3N","created_at":"2026-07-05T03:50:36Z"}],"graph_snapshots":[{"event_id":"sha256:4d59c00a3469ca81ccbfd7aed468c08e4f3b904ca1bbf8924853707a6ec5ea28","target":"graph","created_at":"2026-07-05T03:50:36Z","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/2109.04405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate $O(1/p^{\\alpha})$, where $p$ is the iteration number and $\\alpha$ is the given positive integer. The proposed algorithm improves the convergence rate of existing algorithms that achieve $O(1/p^{2})$. The key idea is that iterative parameters are selected from a group of specific high order polynomial equations. The performance of the proposed algorithm is assessed on the randomly generated model predictive control (MPC) optimization p","authors_text":"Jia Wang, Ying Yang","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-09T16:45:19Z","title":"An Accelerated Proximal Gradient-based Model Predictive Control Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.04405","kind":"arxiv","version":5},"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:e8ec41db53f74dc6d5c1c0a977923254cda6f9b3b7a140e875ae3938d681d26c","target":"record","created_at":"2026-07-05T03:50:36Z","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":"4f4a2b6620ac8bc4cabdff47dd954aba761f49753e68849de8e794dd87ba4618","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-09T16:45:19Z","title_canon_sha256":"861a94b35a7e0bfb22b25b66ce765a79a737b9de44362f3f208339d6c5b3046c"},"schema_version":"1.0","source":{"id":"2109.04405","kind":"arxiv","version":5}},"canonical_sha256":"e57be01f6d88b91ff2ba4b566577558546be2c2c96e4034f9771225910f42939","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e57be01f6d88b91ff2ba4b566577558546be2c2c96e4034f9771225910f42939","first_computed_at":"2026-07-05T03:50:36.241094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:50:36.241094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e+97SmSbAYxiLZWAGCUkIwbWOnIbOEoOu0MEVkAroDxYNPOoEHjS9a19e2hpPTFmDIhWedwJXAf9qLmhuchOCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:50:36.241526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.04405","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8ec41db53f74dc6d5c1c0a977923254cda6f9b3b7a140e875ae3938d681d26c","sha256:4d59c00a3469ca81ccbfd7aed468c08e4f3b904ca1bbf8924853707a6ec5ea28"],"state_sha256":"491ad05cc1a82a61ae572148aa53367ffea96b3be72296d4af90473195c7171e"}