{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YQOS7CECJALK4ZONGZ7CJ34VFX","short_pith_number":"pith:YQOS7CEC","schema_version":"1.0","canonical_sha256":"c41d2f88824816ae65cd367e24ef952dfd634129987e4f0199b5107fada7e446","source":{"kind":"arxiv","id":"1512.09078","version":3},"attestation_state":"computed","paper":{"title":"Solving Underdetermined Boundary Value Problems By Sequential Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jan Kuratko, Stefan Ratschan","submitted_at":"2015-12-30T19:38:44Z","abstract_excerpt":"Ordinary differential equations that model technical systems often contain states, that are considered dangerous for the system. A trajectory that reaches such a state usually indicates a flaw in the design. In this paper, we present and study the properties of an algorithm for finding such trajectories. That is, for a given ordinary differential equation, the algorithm finds a trajectory that originates in one set of states and reaches another one. The algorithm is based on sequential quadratic programming applied to a regularized optimization problem obtained by multiple shooting."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.09078","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-30T19:38:44Z","cross_cats_sorted":[],"title_canon_sha256":"68a3c858a2765b7b39008800db65826798cca7bf9f23ca5cbcc681b25097768b","abstract_canon_sha256":"741101e41ce78abf5555a755c639a1dbb84be14d283dad7bad097def80abe04f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:19.988662Z","signature_b64":"eGgs64bbh6HrxiJS2j2TFbbFAuJf1+fqNgJlYT/z+bw4UpGcBTQNU5cEeKzon1X96OnQX5nFFZuOf4B/r9DBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c41d2f88824816ae65cd367e24ef952dfd634129987e4f0199b5107fada7e446","last_reissued_at":"2026-05-18T01:03:19.988114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:19.988114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Underdetermined Boundary Value Problems By Sequential Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jan Kuratko, Stefan Ratschan","submitted_at":"2015-12-30T19:38:44Z","abstract_excerpt":"Ordinary differential equations that model technical systems often contain states, that are considered dangerous for the system. A trajectory that reaches such a state usually indicates a flaw in the design. In this paper, we present and study the properties of an algorithm for finding such trajectories. That is, for a given ordinary differential equation, the algorithm finds a trajectory that originates in one set of states and reaches another one. The algorithm is based on sequential quadratic programming applied to a regularized optimization problem obtained by multiple shooting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09078","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.09078","created_at":"2026-05-18T01:03:19.988194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09078v3","created_at":"2026-05-18T01:03:19.988194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09078","created_at":"2026-05-18T01:03:19.988194+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQOS7CECJALK","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQOS7CECJALK4ZON","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQOS7CEC","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX","json":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX.json","graph_json":"https://pith.science/api/pith-number/YQOS7CECJALK4ZONGZ7CJ34VFX/graph.json","events_json":"https://pith.science/api/pith-number/YQOS7CECJALK4ZONGZ7CJ34VFX/events.json","paper":"https://pith.science/paper/YQOS7CEC"},"agent_actions":{"view_html":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX","download_json":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX.json","view_paper":"https://pith.science/paper/YQOS7CEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09078&json=true","fetch_graph":"https://pith.science/api/pith-number/YQOS7CECJALK4ZONGZ7CJ34VFX/graph.json","fetch_events":"https://pith.science/api/pith-number/YQOS7CECJALK4ZONGZ7CJ34VFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX/action/storage_attestation","attest_author":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX/action/author_attestation","sign_citation":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX/action/citation_signature","submit_replication":"https://pith.science/pith/YQOS7CECJALK4ZONGZ7CJ34VFX/action/replication_record"}},"created_at":"2026-05-18T01:03:19.988194+00:00","updated_at":"2026-05-18T01:03:19.988194+00:00"}