{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:QWY4H3TF3UVGG52ZIQCH5KU33J","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":"2e9cfb83d1d49f4b83bf6280273eb35bdfef322152859f299921f127bff3cb1a","cross_cats_sorted":["cs.NA","cs.RO","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-23T09:53:35Z","title_canon_sha256":"7c6698f0510e6fba25746970e72b51cfc7e12e8916be1b584c8ed66446ae4161"},"schema_version":"1.0","source":{"id":"2302.11891","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.11891","created_at":"2026-07-05T07:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"2302.11891v2","created_at":"2026-07-05T07:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11891","created_at":"2026-07-05T07:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"QWY4H3TF3UVG","created_at":"2026-07-05T07:54:48Z"},{"alias_kind":"pith_short_16","alias_value":"QWY4H3TF3UVGG52Z","created_at":"2026-07-05T07:54:48Z"},{"alias_kind":"pith_short_8","alias_value":"QWY4H3TF","created_at":"2026-07-05T07:54:48Z"}],"graph_snapshots":[{"event_id":"sha256:a8903e7d937e84b56e4e8f772aaaab8b2a23c915cf1c9a6cad25281f3a63291b","target":"graph","created_at":"2026-07-05T07:54:48Z","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/2302.11891/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a sequential hierarchical least-squares programming solver with trust-region and hierarchical step-filter with application to prioritized discrete non-linear optimal control. It is based on a hierarchical step-filter which resolves each priority level of a non-linear hierarchical least-squares programming via a globally convergent sequential quadratic programming step-filter. Leveraging a condition on the trust-region or the filter initialization, our hierarchical step-filter maintains this global convergence property. The hierarchical least-squares programming sub-problems are solv","authors_text":"Abderrahmane Kheddar, Kai Pfeiffer","cross_cats":["cs.NA","cs.RO","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-23T09:53:35Z","title":"Sequential Hierarchical Least-Squares Programming for Prioritized Non-Linear Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11891","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:841e55e09b1363b66fc522af9706bb9c4d40e4da62e5a6eb53e5769848b5312c","target":"record","created_at":"2026-07-05T07:54:48Z","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":"2e9cfb83d1d49f4b83bf6280273eb35bdfef322152859f299921f127bff3cb1a","cross_cats_sorted":["cs.NA","cs.RO","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-23T09:53:35Z","title_canon_sha256":"7c6698f0510e6fba25746970e72b51cfc7e12e8916be1b584c8ed66446ae4161"},"schema_version":"1.0","source":{"id":"2302.11891","kind":"arxiv","version":2}},"canonical_sha256":"85b1c3ee65dd2a63775944047eaa9bda4f3f7c02f162cfb1e03eead15d7e2af7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85b1c3ee65dd2a63775944047eaa9bda4f3f7c02f162cfb1e03eead15d7e2af7","first_computed_at":"2026-07-05T07:54:48.116606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:54:48.116606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mEKPuZzzxMCtIbc6mIVYFmysiu7B9yDEbFZNNB886UXPKkMpz4vxg2rFGPRk3SgJJN8p5c9dg4ikXQtAq/wgAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:54:48.117067Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.11891","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:841e55e09b1363b66fc522af9706bb9c4d40e4da62e5a6eb53e5769848b5312c","sha256:a8903e7d937e84b56e4e8f772aaaab8b2a23c915cf1c9a6cad25281f3a63291b"],"state_sha256":"f3804743934d5f9b5ffa1e2c3bd83a18214b9ec6ce9c86b01f36e4764eca52a1"}