{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3PBEJ3NOBVA6XQFGVOSCJX5Q5E","short_pith_number":"pith:3PBEJ3NO","canonical_record":{"source":{"id":"2205.00754","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-02T08:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"a5aecbd67f88d53eb9ebc5f7ff6ba7dcfefefde73f232b7b9fbfc501fa6512f2","abstract_canon_sha256":"dcad089947a1391aa424d8d0212255225ded7593a5b67ca8e638e86bd681248d"},"schema_version":"1.0"},"canonical_sha256":"dbc244edae0d41ebc0a6aba424dfb0e90adabb58dfa007117616780709971421","source":{"kind":"arxiv","id":"2205.00754","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00754","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00754v3","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00754","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"3PBEJ3NOBVA6","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"pith_short_16","alias_value":"3PBEJ3NOBVA6XQFG","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"pith_short_8","alias_value":"3PBEJ3NO","created_at":"2026-07-05T07:55:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3PBEJ3NOBVA6XQFGVOSCJX5Q5E","target":"record","payload":{"canonical_record":{"source":{"id":"2205.00754","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-02T08:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"a5aecbd67f88d53eb9ebc5f7ff6ba7dcfefefde73f232b7b9fbfc501fa6512f2","abstract_canon_sha256":"dcad089947a1391aa424d8d0212255225ded7593a5b67ca8e638e86bd681248d"},"schema_version":"1.0"},"canonical_sha256":"dbc244edae0d41ebc0a6aba424dfb0e90adabb58dfa007117616780709971421","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:56.062980Z","signature_b64":"RBmqYuxPbyk42X3uDYWtmNmqWpxKbf/RGVhVLUKmcjrbSoP6m3R/73b85qtb8rlYRIbbVfsm/uyN4BklTMgCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc244edae0d41ebc0a6aba424dfb0e90adabb58dfa007117616780709971421","last_reissued_at":"2026-07-05T07:55:56.062521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:56.062521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.00754","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-05T07:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMBibv/n0r8h9WHG7g+3aCRg7jEZeID7yulohUX1oauchXh/1skvyVACudPUpYLMl4WoA/UM4s81o7klo32pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:52:31.635646Z"},"content_sha256":"2859109e94facd067bcb95cbf4dde0e1708770e6b6cff31bc65b9a69bf95bf40","schema_version":"1.0","event_id":"sha256:2859109e94facd067bcb95cbf4dde0e1708770e6b6cff31bc65b9a69bf95bf40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3PBEJ3NOBVA6XQFGVOSCJX5Q5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Feasible Sequential Linear Programming Algorithm with Application to Time-Optimal Path Planning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Zanelli, Armin Nurkanovi\\'c, David Kiessling, Goele Pipeleers, Jan Swevers, Joris Gillis, Melanie Zeilinger, Moritz Diehl","submitted_at":"2022-05-02T08:59:29Z","abstract_excerpt":"In this paper, we propose a Feasible Sequential Linear Programming (FSLP) algorithm applied to time-optimal control problems (TOCP) obtained through direct multiple shooting discretization. This method is motivated by TOCP with nonlinear constraints which arise in motion planning of mechatronic systems. The algorithm applies a trust-region globalization strategy ensuring global convergence. For fully determined problems our algorithm provides locally quadratic convergence. Moreover, the algorithm keeps all iterates feasible enabling early termination at suboptimal, feasible solutions. This add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00754","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/2205.00754/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-05T07:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMEpbPSg6OuZdTJUub3rK3SI1isLHtXs04+pOr/VYLYvPargqWhZ4vCA3x2qkchJnX92adIgdNjF64rE95KwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:52:31.636156Z"},"content_sha256":"3f41c3d913887e5fdf7be2fd7c7a884e55895491e10346683ae238dadb128b52","schema_version":"1.0","event_id":"sha256:3f41c3d913887e5fdf7be2fd7c7a884e55895491e10346683ae238dadb128b52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PBEJ3NOBVA6XQFGVOSCJX5Q5E/bundle.json","state_url":"https://pith.science/pith/3PBEJ3NOBVA6XQFGVOSCJX5Q5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PBEJ3NOBVA6XQFGVOSCJX5Q5E/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-06T11:52:31Z","links":{"resolver":"https://pith.science/pith/3PBEJ3NOBVA6XQFGVOSCJX5Q5E","bundle":"https://pith.science/pith/3PBEJ3NOBVA6XQFGVOSCJX5Q5E/bundle.json","state":"https://pith.science/pith/3PBEJ3NOBVA6XQFGVOSCJX5Q5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PBEJ3NOBVA6XQFGVOSCJX5Q5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3PBEJ3NOBVA6XQFGVOSCJX5Q5E","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":"dcad089947a1391aa424d8d0212255225ded7593a5b67ca8e638e86bd681248d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-02T08:59:29Z","title_canon_sha256":"a5aecbd67f88d53eb9ebc5f7ff6ba7dcfefefde73f232b7b9fbfc501fa6512f2"},"schema_version":"1.0","source":{"id":"2205.00754","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00754","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00754v3","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00754","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"3PBEJ3NOBVA6","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"pith_short_16","alias_value":"3PBEJ3NOBVA6XQFG","created_at":"2026-07-05T07:55:56Z"},{"alias_kind":"pith_short_8","alias_value":"3PBEJ3NO","created_at":"2026-07-05T07:55:56Z"}],"graph_snapshots":[{"event_id":"sha256:3f41c3d913887e5fdf7be2fd7c7a884e55895491e10346683ae238dadb128b52","target":"graph","created_at":"2026-07-05T07:55:56Z","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/2205.00754/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a Feasible Sequential Linear Programming (FSLP) algorithm applied to time-optimal control problems (TOCP) obtained through direct multiple shooting discretization. This method is motivated by TOCP with nonlinear constraints which arise in motion planning of mechatronic systems. The algorithm applies a trust-region globalization strategy ensuring global convergence. For fully determined problems our algorithm provides locally quadratic convergence. Moreover, the algorithm keeps all iterates feasible enabling early termination at suboptimal, feasible solutions. This add","authors_text":"Andrea Zanelli, Armin Nurkanovi\\'c, David Kiessling, Goele Pipeleers, Jan Swevers, Joris Gillis, Melanie Zeilinger, Moritz Diehl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-02T08:59:29Z","title":"A Feasible Sequential Linear Programming Algorithm with Application to Time-Optimal Path Planning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00754","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:2859109e94facd067bcb95cbf4dde0e1708770e6b6cff31bc65b9a69bf95bf40","target":"record","created_at":"2026-07-05T07:55:56Z","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":"dcad089947a1391aa424d8d0212255225ded7593a5b67ca8e638e86bd681248d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-02T08:59:29Z","title_canon_sha256":"a5aecbd67f88d53eb9ebc5f7ff6ba7dcfefefde73f232b7b9fbfc501fa6512f2"},"schema_version":"1.0","source":{"id":"2205.00754","kind":"arxiv","version":3}},"canonical_sha256":"dbc244edae0d41ebc0a6aba424dfb0e90adabb58dfa007117616780709971421","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbc244edae0d41ebc0a6aba424dfb0e90adabb58dfa007117616780709971421","first_computed_at":"2026-07-05T07:55:56.062521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:55:56.062521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RBmqYuxPbyk42X3uDYWtmNmqWpxKbf/RGVhVLUKmcjrbSoP6m3R/73b85qtb8rlYRIbbVfsm/uyN4BklTMgCDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:55:56.062980Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.00754","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2859109e94facd067bcb95cbf4dde0e1708770e6b6cff31bc65b9a69bf95bf40","sha256:3f41c3d913887e5fdf7be2fd7c7a884e55895491e10346683ae238dadb128b52"],"state_sha256":"401116534d6b541ea8338041a6121cb03bdd83e84969a0c9cf02b5b26beda366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIOBKU2ZZA9sr/Zgns9s6jbUaNAxThcjkSAC/qRwrfOJ3i4xaW5YRAVoiCn6Wvx8NaGSpl3XEFA21FX1zFjTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:52:31.641540Z","bundle_sha256":"98fda306e80199d2a662e575f56c0705651595ac434b9b497d03a827742ea7ab"}}