{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TV53R6Q2A4NJR7KJ5EGMBRU4K3","short_pith_number":"pith:TV53R6Q2","schema_version":"1.0","canonical_sha256":"9d7bb8fa1a071a98fd49e90cc0c69c56e8fc5ef45944de23d3059e40b053ed98","source":{"kind":"arxiv","id":"1810.06764","version":2},"attestation_state":"computed","paper":{"title":"Simple Policy Evaluation for Data-Rich Iterative Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Francesco Borrelli, Ugo Rosolia, Xiaojing Zhang","submitted_at":"2018-10-16T00:22:30Z","abstract_excerpt":"A data-based policy for iterative control task is presented. The proposed strategy is model-free and can be applied whenever safe input and state trajectories of a system performing an iterative task are available. These trajectories, together with a user-defined cost function, are exploited to construct a piecewise affine approximation to the value function. Approximated value functions are then used to evaluate the control policy by solving a linear program. We show that for linear system subject to convex cost and constraints, the proposed strategy guarantees closed-loop constraint satisfac"},"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":"1810.06764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T00:22:30Z","cross_cats_sorted":[],"title_canon_sha256":"dd2157ac0a81a6ef795811a293379e0a637c1f5d796a34abe30eb50fd1ae3ef5","abstract_canon_sha256":"970d57f1c4de0aaca237bdd75aa9abd213f2b9b4c9e3b78301133b3a00ffdeda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:44.905203Z","signature_b64":"TKxpYaGTj0MKRqCwCLHy3oQ+nw2pOLcTMMhkSILxfDw9t042yBAxEqy7XGzPc+f4QAz4ncP5QszWRPvL2WAEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7bb8fa1a071a98fd49e90cc0c69c56e8fc5ef45944de23d3059e40b053ed98","last_reissued_at":"2026-05-17T23:50:44.904799Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:44.904799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Policy Evaluation for Data-Rich Iterative Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Francesco Borrelli, Ugo Rosolia, Xiaojing Zhang","submitted_at":"2018-10-16T00:22:30Z","abstract_excerpt":"A data-based policy for iterative control task is presented. The proposed strategy is model-free and can be applied whenever safe input and state trajectories of a system performing an iterative task are available. These trajectories, together with a user-defined cost function, are exploited to construct a piecewise affine approximation to the value function. Approximated value functions are then used to evaluate the control policy by solving a linear program. We show that for linear system subject to convex cost and constraints, the proposed strategy guarantees closed-loop constraint satisfac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06764","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":""},"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":"1810.06764","created_at":"2026-05-17T23:50:44.904865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06764v2","created_at":"2026-05-17T23:50:44.904865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06764","created_at":"2026-05-17T23:50:44.904865+00:00"},{"alias_kind":"pith_short_12","alias_value":"TV53R6Q2A4NJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TV53R6Q2A4NJR7KJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TV53R6Q2","created_at":"2026-05-18T12:32:56.356000+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/TV53R6Q2A4NJR7KJ5EGMBRU4K3","json":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3.json","graph_json":"https://pith.science/api/pith-number/TV53R6Q2A4NJR7KJ5EGMBRU4K3/graph.json","events_json":"https://pith.science/api/pith-number/TV53R6Q2A4NJR7KJ5EGMBRU4K3/events.json","paper":"https://pith.science/paper/TV53R6Q2"},"agent_actions":{"view_html":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3","download_json":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3.json","view_paper":"https://pith.science/paper/TV53R6Q2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06764&json=true","fetch_graph":"https://pith.science/api/pith-number/TV53R6Q2A4NJR7KJ5EGMBRU4K3/graph.json","fetch_events":"https://pith.science/api/pith-number/TV53R6Q2A4NJR7KJ5EGMBRU4K3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/action/storage_attestation","attest_author":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/action/author_attestation","sign_citation":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/action/citation_signature","submit_replication":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/action/replication_record"}},"created_at":"2026-05-17T23:50:44.904865+00:00","updated_at":"2026-05-17T23:50:44.904865+00:00"}