{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:67TS2WVKBRFNVYFNAA2LIIQRKG","short_pith_number":"pith:67TS2WVK","schema_version":"1.0","canonical_sha256":"f7e72d5aaa0c4adae0ad0034b422115196bf778036c84466a40ed1c685cd658c","source":{"kind":"arxiv","id":"2507.14025","version":1},"attestation_state":"computed","paper":{"title":"Reference-Free Iterative Learning Model Predictive Control with Neural Certificates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Kazumune Hashimoto, Masako Kishida, Shigemasa Takai, Wataru Hashimoto","submitted_at":"2025-07-18T15:53:44Z","abstract_excerpt":"In this paper, we propose a novel reference-free iterative learning model predictive control (MPC). In the proposed method, a certificate function based on the concept of Control Lyapunov Barrier Function (CLBF) is learned using data collected from past control executions and used to define the terminal set and cost in the MPC optimization problem at the current iteration. This scheme enables the progressive refinement of the MPC's terminal components over successive iterations. Unlike existing methods that rely on mixed-integer programming and suffer from numerical difficulties, the proposed "},"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":"2507.14025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-07-18T15:53:44Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"605f1663dc06facb371a10492632c73a1002127a1de04f76b6d57a773ea3bb68","abstract_canon_sha256":"9398c6f36e65e1838db57b17fde331092dcdf701293a405982ef578be78b6ecf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:27.148455Z","signature_b64":"0eqeWI8byCWpiGbRpU52YBNg0Ucr+GnM0CgJka30DRW10SyULfu5LL/2cC3LcTRWRzaV+Lmj0C+3RgghvtMZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7e72d5aaa0c4adae0ad0034b422115196bf778036c84466a40ed1c685cd658c","last_reissued_at":"2026-07-05T11:39:27.147991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:27.147991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reference-Free Iterative Learning Model Predictive Control with Neural Certificates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Kazumune Hashimoto, Masako Kishida, Shigemasa Takai, Wataru Hashimoto","submitted_at":"2025-07-18T15:53:44Z","abstract_excerpt":"In this paper, we propose a novel reference-free iterative learning model predictive control (MPC). In the proposed method, a certificate function based on the concept of Control Lyapunov Barrier Function (CLBF) is learned using data collected from past control executions and used to define the terminal set and cost in the MPC optimization problem at the current iteration. This scheme enables the progressive refinement of the MPC's terminal components over successive iterations. Unlike existing methods that rely on mixed-integer programming and suffer from numerical difficulties, the proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14025","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.14025/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":"2507.14025","created_at":"2026-07-05T11:39:27.148049+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14025v1","created_at":"2026-07-05T11:39:27.148049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14025","created_at":"2026-07-05T11:39:27.148049+00:00"},{"alias_kind":"pith_short_12","alias_value":"67TS2WVKBRFN","created_at":"2026-07-05T11:39:27.148049+00:00"},{"alias_kind":"pith_short_16","alias_value":"67TS2WVKBRFNVYFN","created_at":"2026-07-05T11:39:27.148049+00:00"},{"alias_kind":"pith_short_8","alias_value":"67TS2WVK","created_at":"2026-07-05T11:39:27.148049+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/67TS2WVKBRFNVYFNAA2LIIQRKG","json":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG.json","graph_json":"https://pith.science/api/pith-number/67TS2WVKBRFNVYFNAA2LIIQRKG/graph.json","events_json":"https://pith.science/api/pith-number/67TS2WVKBRFNVYFNAA2LIIQRKG/events.json","paper":"https://pith.science/paper/67TS2WVK"},"agent_actions":{"view_html":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG","download_json":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG.json","view_paper":"https://pith.science/paper/67TS2WVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14025&json=true","fetch_graph":"https://pith.science/api/pith-number/67TS2WVKBRFNVYFNAA2LIIQRKG/graph.json","fetch_events":"https://pith.science/api/pith-number/67TS2WVKBRFNVYFNAA2LIIQRKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG/action/storage_attestation","attest_author":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG/action/author_attestation","sign_citation":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG/action/citation_signature","submit_replication":"https://pith.science/pith/67TS2WVKBRFNVYFNAA2LIIQRKG/action/replication_record"}},"created_at":"2026-07-05T11:39:27.148049+00:00","updated_at":"2026-07-05T11:39:27.148049+00:00"}