{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5W32XJIXSZK5G6ZVJU5Q24KFU5","short_pith_number":"pith:5W32XJIX","canonical_record":{"source":{"id":"1712.07761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-21T01:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"f990dd6d7b34607f18637d148f1c892c5371d616c5a607ecafc71ffb17481d7f","abstract_canon_sha256":"a0eb6266d64e12a80b8285573901ca3e70b4d0fc7f74f83b485ab0da4d8ea202"},"schema_version":"1.0"},"canonical_sha256":"edb7aba5179655d37b354d3b0d7145a76e6bece8f1108974d2c7119292226357","source":{"kind":"arxiv","id":"1712.07761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07761","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07761v1","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07761","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"5W32XJIXSZK5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5W32XJIXSZK5G6ZV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5W32XJIX","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5W32XJIXSZK5G6ZVJU5Q24KFU5","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-21T01:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"f990dd6d7b34607f18637d148f1c892c5371d616c5a607ecafc71ffb17481d7f","abstract_canon_sha256":"a0eb6266d64e12a80b8285573901ca3e70b4d0fc7f74f83b485ab0da4d8ea202"},"schema_version":"1.0"},"canonical_sha256":"edb7aba5179655d37b354d3b0d7145a76e6bece8f1108974d2c7119292226357","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:30.971176Z","signature_b64":"yv634a2He17f/Hn4X3Qr+U/MVl+MO1qAOx5IMcZClpGs6py2FJy6WrtZVsiI1uIZnH/OLMAdPmdypvP749kkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb7aba5179655d37b354d3b0d7145a76e6bece8f1108974d2c7119292226357","last_reissued_at":"2026-05-18T00:27:30.970550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:30.970550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07761","source_version":1,"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-05-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zYiAbt0IPD9Jkm+9DqXDExU9LtuIgFIfZQ+iY+y3RQZiUdSaiY0hNNEY8ou4ZZOl+tOim/CPbBKXBXK7OleFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:06:08.429582Z"},"content_sha256":"2d1249a34b7620b05a74a81d5736adae1433bcfe009184a41b711779c180155b","schema_version":"1.0","event_id":"sha256:2d1249a34b7620b05a74a81d5736adae1433bcfe009184a41b711779c180155b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5W32XJIXSZK5G6ZVJU5Q24KFU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-order convergent Finite-Elements Direct Transcription Method for Constrained Optimal Control Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Martin Peter Neuenhofen","submitted_at":"2017-12-21T01:30:27Z","abstract_excerpt":"In this paper we present a finite element method for the direct transcription of constrained non-linear optimal control problems.\n  We prove that our method converges of high order under mild assumptions. Our analysis uses a regularized penalty-barrier functional. The convergence result is obtained from local strict convexity and Lipschitz-continuity of this functional in the finite-element space.\n  The method is very flexible. Each component of the numerical solution can be discretized with a different mesh. General differential-algebraic constraints of arbitrary index can be treated easily w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07761","kind":"arxiv","version":1},"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"},"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-05-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QkKm49069KWQ3Z/mj+F2xnjJmIxRFanY5cj2LcTx/BnPLo9uPfAAzdmp/gFRrijaKJnJBSrteuXBKjT0hcmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:06:08.430332Z"},"content_sha256":"ce622181340867e63ebc04828eada05017aceb1d4568204b64ed661c9d22f7f2","schema_version":"1.0","event_id":"sha256:ce622181340867e63ebc04828eada05017aceb1d4568204b64ed661c9d22f7f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/bundle.json","state_url":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/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-06-10T12:06:08Z","links":{"resolver":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5","bundle":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/bundle.json","state":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5W32XJIXSZK5G6ZVJU5Q24KFU5","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":"a0eb6266d64e12a80b8285573901ca3e70b4d0fc7f74f83b485ab0da4d8ea202","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-21T01:30:27Z","title_canon_sha256":"f990dd6d7b34607f18637d148f1c892c5371d616c5a607ecafc71ffb17481d7f"},"schema_version":"1.0","source":{"id":"1712.07761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07761","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07761v1","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07761","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"5W32XJIXSZK5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5W32XJIXSZK5G6ZV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5W32XJIX","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:ce622181340867e63ebc04828eada05017aceb1d4568204b64ed661c9d22f7f2","target":"graph","created_at":"2026-05-18T00:27:30Z","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"},"paper":{"abstract_excerpt":"In this paper we present a finite element method for the direct transcription of constrained non-linear optimal control problems.\n  We prove that our method converges of high order under mild assumptions. Our analysis uses a regularized penalty-barrier functional. The convergence result is obtained from local strict convexity and Lipschitz-continuity of this functional in the finite-element space.\n  The method is very flexible. Each component of the numerical solution can be discretized with a different mesh. General differential-algebraic constraints of arbitrary index can be treated easily w","authors_text":"Martin Peter Neuenhofen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-21T01:30:27Z","title":"High-order convergent Finite-Elements Direct Transcription Method for Constrained Optimal Control Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07761","kind":"arxiv","version":1},"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:2d1249a34b7620b05a74a81d5736adae1433bcfe009184a41b711779c180155b","target":"record","created_at":"2026-05-18T00:27:30Z","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":"a0eb6266d64e12a80b8285573901ca3e70b4d0fc7f74f83b485ab0da4d8ea202","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-21T01:30:27Z","title_canon_sha256":"f990dd6d7b34607f18637d148f1c892c5371d616c5a607ecafc71ffb17481d7f"},"schema_version":"1.0","source":{"id":"1712.07761","kind":"arxiv","version":1}},"canonical_sha256":"edb7aba5179655d37b354d3b0d7145a76e6bece8f1108974d2c7119292226357","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edb7aba5179655d37b354d3b0d7145a76e6bece8f1108974d2c7119292226357","first_computed_at":"2026-05-18T00:27:30.970550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:30.970550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yv634a2He17f/Hn4X3Qr+U/MVl+MO1qAOx5IMcZClpGs6py2FJy6WrtZVsiI1uIZnH/OLMAdPmdypvP749kkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:30.971176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d1249a34b7620b05a74a81d5736adae1433bcfe009184a41b711779c180155b","sha256:ce622181340867e63ebc04828eada05017aceb1d4568204b64ed661c9d22f7f2"],"state_sha256":"e570e452293263588a2aa92a21b3eca75c90d4cc9b3bf17380e5809ff8788d59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwgSeF3ikpCYb0LdOHhb6Vcqvshc4R3E9Me0ypXNdG33rZdWqXQpRz5WlCBFSuVv/kW09d1ELLzdnfAAhy7VBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:06:08.434294Z","bundle_sha256":"f7be7f9cbd3c422abe64562c29c49d3861aee527e41ef6bfcc9ec7adb1cdc720"}}