{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CNXBOWFQFLHBLTBCOVIIOMS73Z","short_pith_number":"pith:CNXBOWFQ","canonical_record":{"source":{"id":"2403.10115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-15T09:03:13Z","cross_cats_sorted":[],"title_canon_sha256":"39d5e37fc653a873b9de4951efe5107677bac555784d967105dd2c2c98728e33","abstract_canon_sha256":"0debfed973bbe2b0ed08acae674e8d959fe0a4fc5c62b6159eb5a22068c9001a"},"schema_version":"1.0"},"canonical_sha256":"136e1758b02ace15cc22755087325fde62279ccdc8c38d33884f41509416f34e","source":{"kind":"arxiv","id":"2403.10115","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.10115","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"2403.10115v2","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10115","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"CNXBOWFQFLHB","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"pith_short_16","alias_value":"CNXBOWFQFLHBLTBC","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"pith_short_8","alias_value":"CNXBOWFQ","created_at":"2026-07-05T08:40:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CNXBOWFQFLHBLTBCOVIIOMS73Z","target":"record","payload":{"canonical_record":{"source":{"id":"2403.10115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-15T09:03:13Z","cross_cats_sorted":[],"title_canon_sha256":"39d5e37fc653a873b9de4951efe5107677bac555784d967105dd2c2c98728e33","abstract_canon_sha256":"0debfed973bbe2b0ed08acae674e8d959fe0a4fc5c62b6159eb5a22068c9001a"},"schema_version":"1.0"},"canonical_sha256":"136e1758b02ace15cc22755087325fde62279ccdc8c38d33884f41509416f34e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:15.053191Z","signature_b64":"uwR/8hzyQxCyIj/J9+QJ0b+GdhmCnfrIT2EBD4pesPhJy0HmZUSMKz5ZQLpgyHNFCIk9jsmFDSGCZ7MCDN3vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"136e1758b02ace15cc22755087325fde62279ccdc8c38d33884f41509416f34e","last_reissued_at":"2026-07-05T08:40:15.052697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:15.052697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.10115","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-05T08:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qy9xv0XeGsYvDU4FXdyn8qfO4gsNPVZqxEq9XSjezpEYLEKqACer3LSMz6oZLKyVx5VTUpsdzxa3cDjF+rhHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T00:00:53.065682Z"},"content_sha256":"77646a476cd6d3b4196e29bf747cf4c611728cb861b1c514f693ee159981f0fb","schema_version":"1.0","event_id":"sha256:77646a476cd6d3b4196e29bf747cf4c611728cb861b1c514f693ee159981f0fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CNXBOWFQFLHBLTBCOVIIOMS73Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Generation of Feasible Trajectories in Direct Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Kiessling, Jan Swevers, Jonathan Frey, Katrin Baumg\\\"artner, Moritz Diehl, Wilm Decr\\'e","submitted_at":"2024-03-15T09:03:13Z","abstract_excerpt":"This paper examines the question of finding feasible points to discrete-time optimal control problems. The optimization problem of finding a feasible trajectory is transcribed to an unconstrained optimal control problem. An efficient algorithm, called FP-DDP, is proposed that solves the resulting problem using Differential Dynamic Programming preserving feasibility with respect to the system dynamics in every iteration. Notably, FP-DDP admits global and rapid local convergence properties induced by a combination of a Levenberg-Marquardt method and an Armijo-type line search. The efficiency of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10115","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/2403.10115/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-05T08:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbhejL5KpxKl41cElcmYIskCrPp4KsDLFOp1xK5JdbZfLwttQFWTr7oiC84DHz85v8ZI6smEWqHX85mlOX40BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T00:00:53.066053Z"},"content_sha256":"5f5a0838b4797754a49d3410cefdcc1ec99b482c90eb4f3ce8c88d851b1f1d6e","schema_version":"1.0","event_id":"sha256:5f5a0838b4797754a49d3410cefdcc1ec99b482c90eb4f3ce8c88d851b1f1d6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/bundle.json","state_url":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/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-07-20T00:00:53Z","links":{"resolver":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z","bundle":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/bundle.json","state":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CNXBOWFQFLHBLTBCOVIIOMS73Z","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":"0debfed973bbe2b0ed08acae674e8d959fe0a4fc5c62b6159eb5a22068c9001a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-15T09:03:13Z","title_canon_sha256":"39d5e37fc653a873b9de4951efe5107677bac555784d967105dd2c2c98728e33"},"schema_version":"1.0","source":{"id":"2403.10115","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.10115","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"2403.10115v2","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10115","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"CNXBOWFQFLHB","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"pith_short_16","alias_value":"CNXBOWFQFLHBLTBC","created_at":"2026-07-05T08:40:15Z"},{"alias_kind":"pith_short_8","alias_value":"CNXBOWFQ","created_at":"2026-07-05T08:40:15Z"}],"graph_snapshots":[{"event_id":"sha256:5f5a0838b4797754a49d3410cefdcc1ec99b482c90eb4f3ce8c88d851b1f1d6e","target":"graph","created_at":"2026-07-05T08:40:15Z","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/2403.10115/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper examines the question of finding feasible points to discrete-time optimal control problems. The optimization problem of finding a feasible trajectory is transcribed to an unconstrained optimal control problem. An efficient algorithm, called FP-DDP, is proposed that solves the resulting problem using Differential Dynamic Programming preserving feasibility with respect to the system dynamics in every iteration. Notably, FP-DDP admits global and rapid local convergence properties induced by a combination of a Levenberg-Marquardt method and an Armijo-type line search. The efficiency of ","authors_text":"David Kiessling, Jan Swevers, Jonathan Frey, Katrin Baumg\\\"artner, Moritz Diehl, Wilm Decr\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-15T09:03:13Z","title":"Fast Generation of Feasible Trajectories in Direct Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10115","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:77646a476cd6d3b4196e29bf747cf4c611728cb861b1c514f693ee159981f0fb","target":"record","created_at":"2026-07-05T08:40:15Z","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":"0debfed973bbe2b0ed08acae674e8d959fe0a4fc5c62b6159eb5a22068c9001a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-15T09:03:13Z","title_canon_sha256":"39d5e37fc653a873b9de4951efe5107677bac555784d967105dd2c2c98728e33"},"schema_version":"1.0","source":{"id":"2403.10115","kind":"arxiv","version":2}},"canonical_sha256":"136e1758b02ace15cc22755087325fde62279ccdc8c38d33884f41509416f34e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"136e1758b02ace15cc22755087325fde62279ccdc8c38d33884f41509416f34e","first_computed_at":"2026-07-05T08:40:15.052697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:40:15.052697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uwR/8hzyQxCyIj/J9+QJ0b+GdhmCnfrIT2EBD4pesPhJy0HmZUSMKz5ZQLpgyHNFCIk9jsmFDSGCZ7MCDN3vCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:40:15.053191Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.10115","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77646a476cd6d3b4196e29bf747cf4c611728cb861b1c514f693ee159981f0fb","sha256:5f5a0838b4797754a49d3410cefdcc1ec99b482c90eb4f3ce8c88d851b1f1d6e"],"state_sha256":"c717ea4ea27636b8d72a049b5927ac02b8d680d268905f8fbc985fd689373a8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gm6wIEeXOO1YgqKi7ilOnNKvS5Vdkq5bEQ+pGcQfK1XkKlXxeIjmRoyC1qXpjpYdiS3Hq9uEEytc7ZakDdAVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-20T00:00:53.068214Z","bundle_sha256":"f7d47e190e0c5f7c9257cf42f616a7a29eeeb2cd61e1d3435c2d927d57b949dc"}}