{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VASB7OFPXK24RRE2RPMWZMRCLK","short_pith_number":"pith:VASB7OFP","canonical_record":{"source":{"id":"2109.07081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-15T05:13:08Z","cross_cats_sorted":[],"title_canon_sha256":"22844aaabbf99e97c9a47b14bc15ef8f41df4f35194805e644ecc7081c1f2526","abstract_canon_sha256":"9ddf2d30132c70e88ea4f228f567f1f76a76d07f8f24abf4675765c2bbcf271a"},"schema_version":"1.0"},"canonical_sha256":"a8241fb8afbab5c8c49a8bd96cb2225a8625090de7ec7b972d0966bc1ef0834b","source":{"kind":"arxiv","id":"2109.07081","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.07081","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"2109.07081v2","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07081","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"VASB7OFPXK24","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"pith_short_16","alias_value":"VASB7OFPXK24RRE2","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"pith_short_8","alias_value":"VASB7OFP","created_at":"2026-07-05T04:20:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VASB7OFPXK24RRE2RPMWZMRCLK","target":"record","payload":{"canonical_record":{"source":{"id":"2109.07081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-15T05:13:08Z","cross_cats_sorted":[],"title_canon_sha256":"22844aaabbf99e97c9a47b14bc15ef8f41df4f35194805e644ecc7081c1f2526","abstract_canon_sha256":"9ddf2d30132c70e88ea4f228f567f1f76a76d07f8f24abf4675765c2bbcf271a"},"schema_version":"1.0"},"canonical_sha256":"a8241fb8afbab5c8c49a8bd96cb2225a8625090de7ec7b972d0966bc1ef0834b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:20:29.568388Z","signature_b64":"OfNc74FcDOYCO+Vl50YZTEfayFWf9Q/HZsVGhXFQsPZSeQxxtlzb+u5metVtsiUwmji8GXlgGlERxxUNZWh9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8241fb8afbab5c8c49a8bd96cb2225a8625090de7ec7b972d0966bc1ef0834b","last_reissued_at":"2026-07-05T04:20:29.567986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:20:29.567986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.07081","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-05T04:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZnE/2cjQaSPKyB/EMsS7tS84+dfQoYw90k/OrC+sqXaUrWCJbOZCV9D/3CQdZrsTXZW82Q7L7f7QbXUlj2hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:42:47.142305Z"},"content_sha256":"90a4ed0786c0039ca6c365da46b953f69afaf10f03fa0d65e6de24eb5378a612","schema_version":"1.0","event_id":"sha256:90a4ed0786c0039ca6c365da46b953f69afaf10f03fa0d65e6de24eb5378a612"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VASB7OFPXK24RRE2RPMWZMRCLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Trajectories with Closed-Loop Dynamic SQP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Jacques Slotine, Sumeet Singh, Vikas Sindhwani","submitted_at":"2021-09-15T05:13:08Z","abstract_excerpt":"Indirect trajectory optimization methods such as Differential Dynamic Programming (DDP) have found considerable success when only planning under dynamic feasibility constraints. Meanwhile, nonlinear programming (NLP) has been the state-of-the-art approach when faced with additional constraints (e.g., control bounds, obstacle avoidance). However, a na$\\\"i$ve implementation of NLP algorithms, e.g., shooting-based sequential quadratic programming (SQP), may suffer from slow convergence -- caused from natural instabilities of the underlying system manifesting as poor numerical stability within the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07081","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/2109.07081/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-05T04:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISlBUiwhxzVvEnrhEYzSoopuCAnzZ1D686l0OvgVuBkmzpZXMjNhyxvBeubdrHos37wHXs9WkUsk1I+uBdVDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:42:47.143954Z"},"content_sha256":"3854206932b0003c2cedae7c6ded8664157460b272d04802fb41f46c821505af","schema_version":"1.0","event_id":"sha256:3854206932b0003c2cedae7c6ded8664157460b272d04802fb41f46c821505af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VASB7OFPXK24RRE2RPMWZMRCLK/bundle.json","state_url":"https://pith.science/pith/VASB7OFPXK24RRE2RPMWZMRCLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VASB7OFPXK24RRE2RPMWZMRCLK/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-05T13:42:47Z","links":{"resolver":"https://pith.science/pith/VASB7OFPXK24RRE2RPMWZMRCLK","bundle":"https://pith.science/pith/VASB7OFPXK24RRE2RPMWZMRCLK/bundle.json","state":"https://pith.science/pith/VASB7OFPXK24RRE2RPMWZMRCLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VASB7OFPXK24RRE2RPMWZMRCLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VASB7OFPXK24RRE2RPMWZMRCLK","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":"9ddf2d30132c70e88ea4f228f567f1f76a76d07f8f24abf4675765c2bbcf271a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-15T05:13:08Z","title_canon_sha256":"22844aaabbf99e97c9a47b14bc15ef8f41df4f35194805e644ecc7081c1f2526"},"schema_version":"1.0","source":{"id":"2109.07081","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.07081","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"2109.07081v2","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07081","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"VASB7OFPXK24","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"pith_short_16","alias_value":"VASB7OFPXK24RRE2","created_at":"2026-07-05T04:20:29Z"},{"alias_kind":"pith_short_8","alias_value":"VASB7OFP","created_at":"2026-07-05T04:20:29Z"}],"graph_snapshots":[{"event_id":"sha256:3854206932b0003c2cedae7c6ded8664157460b272d04802fb41f46c821505af","target":"graph","created_at":"2026-07-05T04:20:29Z","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.07081/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Indirect trajectory optimization methods such as Differential Dynamic Programming (DDP) have found considerable success when only planning under dynamic feasibility constraints. Meanwhile, nonlinear programming (NLP) has been the state-of-the-art approach when faced with additional constraints (e.g., control bounds, obstacle avoidance). However, a na$\\\"i$ve implementation of NLP algorithms, e.g., shooting-based sequential quadratic programming (SQP), may suffer from slow convergence -- caused from natural instabilities of the underlying system manifesting as poor numerical stability within the","authors_text":"Jean-Jacques Slotine, Sumeet Singh, Vikas Sindhwani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-15T05:13:08Z","title":"Optimizing Trajectories with Closed-Loop Dynamic SQP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07081","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:90a4ed0786c0039ca6c365da46b953f69afaf10f03fa0d65e6de24eb5378a612","target":"record","created_at":"2026-07-05T04:20:29Z","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":"9ddf2d30132c70e88ea4f228f567f1f76a76d07f8f24abf4675765c2bbcf271a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-15T05:13:08Z","title_canon_sha256":"22844aaabbf99e97c9a47b14bc15ef8f41df4f35194805e644ecc7081c1f2526"},"schema_version":"1.0","source":{"id":"2109.07081","kind":"arxiv","version":2}},"canonical_sha256":"a8241fb8afbab5c8c49a8bd96cb2225a8625090de7ec7b972d0966bc1ef0834b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8241fb8afbab5c8c49a8bd96cb2225a8625090de7ec7b972d0966bc1ef0834b","first_computed_at":"2026-07-05T04:20:29.567986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:20:29.567986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OfNc74FcDOYCO+Vl50YZTEfayFWf9Q/HZsVGhXFQsPZSeQxxtlzb+u5metVtsiUwmji8GXlgGlERxxUNZWh9Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T04:20:29.568388Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.07081","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90a4ed0786c0039ca6c365da46b953f69afaf10f03fa0d65e6de24eb5378a612","sha256:3854206932b0003c2cedae7c6ded8664157460b272d04802fb41f46c821505af"],"state_sha256":"b8d1779fb08e5a84dd822022c79ba4a90d0ad5752948f99696338798f66cab0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P88OghrhecU4+8BSCt0sp/KZiWe9tJfg/IAlXowVaPFJCDyraEANNsuWR+Qt+S3c4e9nzAIc10Kff7LoYMorCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:42:47.158213Z","bundle_sha256":"eadf1c07c4f6f3d498d3a4795de3657c7574f8461271791d25d9d69bb300e4af"}}