{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TDB54CIPZBBIIKOS4CNY3QXGRN","short_pith_number":"pith:TDB54CIP","schema_version":"1.0","canonical_sha256":"98c3de090fc8428429d2e09b8dc2e68b717aff6e8279e583270feebcb7875011","source":{"kind":"arxiv","id":"1903.05508","version":2},"attestation_state":"computed","paper":{"title":"Efficient Implementation of Rate Constraints for Nonlinear Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Eric Kerrigan, Yuanbo Nie","submitted_at":"2019-03-13T14:23:04Z","abstract_excerpt":"We propose a general approach to directly implement rate constraints on the discretization mesh for all collocation methods, for both state and input variables. Unlike conventional approaches that may lead to singular control arcs, the solution of this on-mesh implementation has better properties. Moreover, computational speedups of more than 30% can be achieved by exploiting the properties of the resulting linear constraint equations."},"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":"1903.05508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-13T14:23:04Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"47289d3d452722446e1f08999eab4307375822c41cfada9c2a5474d534733640","abstract_canon_sha256":"fec8e16283f7a9e3d8f4cdb105e2c6cdc1557ea97f387d4d4e700cbd8c62a131"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:14:13.191705Z","signature_b64":"hQY3AYkWETZvzHk2cKFTcgq7xGVrMyvknEdWJo3ylBIn7R1Ejkjteh3jLwNdebiTkZ23hqVmLIkc36TPc0fBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98c3de090fc8428429d2e09b8dc2e68b717aff6e8279e583270feebcb7875011","last_reissued_at":"2026-06-04T20:14:13.191252Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:14:13.191252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Implementation of Rate Constraints for Nonlinear Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Eric Kerrigan, Yuanbo Nie","submitted_at":"2019-03-13T14:23:04Z","abstract_excerpt":"We propose a general approach to directly implement rate constraints on the discretization mesh for all collocation methods, for both state and input variables. Unlike conventional approaches that may lead to singular control arcs, the solution of this on-mesh implementation has better properties. Moreover, computational speedups of more than 30% can be achieved by exploiting the properties of the resulting linear constraint equations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05508","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/1903.05508/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.05508","created_at":"2026-06-04T20:14:13.191326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05508v2","created_at":"2026-06-04T20:14:13.191326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05508","created_at":"2026-06-04T20:14:13.191326+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDB54CIPZBBI","created_at":"2026-06-04T20:14:13.191326+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDB54CIPZBBIIKOS","created_at":"2026-06-04T20:14:13.191326+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDB54CIP","created_at":"2026-06-04T20:14:13.191326+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/TDB54CIPZBBIIKOS4CNY3QXGRN","json":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN.json","graph_json":"https://pith.science/api/pith-number/TDB54CIPZBBIIKOS4CNY3QXGRN/graph.json","events_json":"https://pith.science/api/pith-number/TDB54CIPZBBIIKOS4CNY3QXGRN/events.json","paper":"https://pith.science/paper/TDB54CIP"},"agent_actions":{"view_html":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN","download_json":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN.json","view_paper":"https://pith.science/paper/TDB54CIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05508&json=true","fetch_graph":"https://pith.science/api/pith-number/TDB54CIPZBBIIKOS4CNY3QXGRN/graph.json","fetch_events":"https://pith.science/api/pith-number/TDB54CIPZBBIIKOS4CNY3QXGRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN/action/storage_attestation","attest_author":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN/action/author_attestation","sign_citation":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN/action/citation_signature","submit_replication":"https://pith.science/pith/TDB54CIPZBBIIKOS4CNY3QXGRN/action/replication_record"}},"created_at":"2026-06-04T20:14:13.191326+00:00","updated_at":"2026-06-04T20:14:13.191326+00:00"}