{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M5V5EAV5GKN52VER7VJ635SDPZ","short_pith_number":"pith:M5V5EAV5","schema_version":"1.0","canonical_sha256":"676bd202bd329bdd5491fd53edf6437e591c5d26a9f016521633297deccafd8c","source":{"kind":"arxiv","id":"1603.05792","version":1},"attestation_state":"computed","paper":{"title":"An iterative Bregman regularization method for optimal control problems with inequality constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Wachsmuth, Frank P\\\"orner","submitted_at":"2016-03-18T08:39:29Z","abstract_excerpt":"We study an iterative regularization method of optimal control problems with control constraints. The regularization method is based on generalized Bregman distances. We provide convergence results under a combination of a source condition and a regularity condition on the active sets. We do not assume attainability of the desired state. Furthermore, a-priori regularization error estimates are obtained."},"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":"1603.05792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-18T08:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"30f3a84da64b2ac66e859d06673acee2b3f2e0a0fa1b704d693ef6c09fd02555","abstract_canon_sha256":"66d4e0a1986eb8e59c356ef0290fde37a944335bf305229c2c5108f31ca02188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.475754Z","signature_b64":"prUl1khLA/6LOq/xsEnXiJEY0LnmXoL0S0EzVYTnh7s0gEDcNtmnxjAY6x7CYuaaQ6D187qD05hHDF3r1WoAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"676bd202bd329bdd5491fd53edf6437e591c5d26a9f016521633297deccafd8c","last_reissued_at":"2026-05-18T01:00:19.475125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.475125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An iterative Bregman regularization method for optimal control problems with inequality constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Wachsmuth, Frank P\\\"orner","submitted_at":"2016-03-18T08:39:29Z","abstract_excerpt":"We study an iterative regularization method of optimal control problems with control constraints. The regularization method is based on generalized Bregman distances. We provide convergence results under a combination of a source condition and a regularity condition on the active sets. We do not assume attainability of the desired state. Furthermore, a-priori regularization error estimates are obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05792","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.05792","created_at":"2026-05-18T01:00:19.475207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05792v1","created_at":"2026-05-18T01:00:19.475207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05792","created_at":"2026-05-18T01:00:19.475207+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5V5EAV5GKN5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5V5EAV5GKN52VER","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5V5EAV5","created_at":"2026-05-18T12:30:29.479603+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/M5V5EAV5GKN52VER7VJ635SDPZ","json":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ.json","graph_json":"https://pith.science/api/pith-number/M5V5EAV5GKN52VER7VJ635SDPZ/graph.json","events_json":"https://pith.science/api/pith-number/M5V5EAV5GKN52VER7VJ635SDPZ/events.json","paper":"https://pith.science/paper/M5V5EAV5"},"agent_actions":{"view_html":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ","download_json":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ.json","view_paper":"https://pith.science/paper/M5V5EAV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05792&json=true","fetch_graph":"https://pith.science/api/pith-number/M5V5EAV5GKN52VER7VJ635SDPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/M5V5EAV5GKN52VER7VJ635SDPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ/action/storage_attestation","attest_author":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ/action/author_attestation","sign_citation":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ/action/citation_signature","submit_replication":"https://pith.science/pith/M5V5EAV5GKN52VER7VJ635SDPZ/action/replication_record"}},"created_at":"2026-05-18T01:00:19.475207+00:00","updated_at":"2026-05-18T01:00:19.475207+00:00"}