{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TV53R6Q2A4NJR7KJ5EGMBRU4K3","short_pith_number":"pith:TV53R6Q2","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"},"canonical_sha256":"9d7bb8fa1a071a98fd49e90cc0c69c56e8fc5ef45944de23d3059e40b053ed98","source":{"kind":"arxiv","id":"1810.06764","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06764","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06764v2","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06764","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"pith_short_12","alias_value":"TV53R6Q2A4NJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TV53R6Q2A4NJR7KJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TV53R6Q2","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TV53R6Q2A4NJR7KJ5EGMBRU4K3","target":"record","payload":{"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"},"canonical_sha256":"9d7bb8fa1a071a98fd49e90cc0c69c56e8fc5ef45944de23d3059e40b053ed98","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"},"source_kind":"arxiv","source_id":"1810.06764","source_version":2,"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-17T23:50:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4ByGBTBMJm289J6nmto7srwvIXWYpFgIqcTeOBYSRkPRNzFeAidya5A6EsCYgCTe0tHZlND4230okqVEY3qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:30:34.377408Z"},"content_sha256":"43e9fd3895857833d18f0393787c5d70239d2f65e1219160009673091b0ded9d","schema_version":"1.0","event_id":"sha256:43e9fd3895857833d18f0393787c5d70239d2f65e1219160009673091b0ded9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TV53R6Q2A4NJR7KJ5EGMBRU4K3","target":"graph","payload":{"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"},"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-17T23:50:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PseCYrTNbEVvI3BDGjstN8Yot+M4uepLu3D8bCly+uk2TMxcfGMduWs2g+8BOB0XL8JoP3RqrHOawpJZL9o8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:30:34.377759Z"},"content_sha256":"c21ad7465a30e0f9cd3088ebb920dd58ab4577558d6909a98505a6aa2b94964d","schema_version":"1.0","event_id":"sha256:c21ad7465a30e0f9cd3088ebb920dd58ab4577558d6909a98505a6aa2b94964d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/bundle.json","state_url":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/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-01T16:30:34Z","links":{"resolver":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3","bundle":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/bundle.json","state":"https://pith.science/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TV53R6Q2A4NJR7KJ5EGMBRU4K3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TV53R6Q2A4NJR7KJ5EGMBRU4K3","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":"970d57f1c4de0aaca237bdd75aa9abd213f2b9b4c9e3b78301133b3a00ffdeda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T00:22:30Z","title_canon_sha256":"dd2157ac0a81a6ef795811a293379e0a637c1f5d796a34abe30eb50fd1ae3ef5"},"schema_version":"1.0","source":{"id":"1810.06764","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06764","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06764v2","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06764","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"pith_short_12","alias_value":"TV53R6Q2A4NJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TV53R6Q2A4NJR7KJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TV53R6Q2","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:c21ad7465a30e0f9cd3088ebb920dd58ab4577558d6909a98505a6aa2b94964d","target":"graph","created_at":"2026-05-17T23:50:44Z","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":"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","authors_text":"Francesco Borrelli, Ugo Rosolia, Xiaojing Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T00:22:30Z","title":"Simple Policy Evaluation for Data-Rich Iterative Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06764","kind":"arxiv","version":2},"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:43e9fd3895857833d18f0393787c5d70239d2f65e1219160009673091b0ded9d","target":"record","created_at":"2026-05-17T23:50:44Z","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":"970d57f1c4de0aaca237bdd75aa9abd213f2b9b4c9e3b78301133b3a00ffdeda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T00:22:30Z","title_canon_sha256":"dd2157ac0a81a6ef795811a293379e0a637c1f5d796a34abe30eb50fd1ae3ef5"},"schema_version":"1.0","source":{"id":"1810.06764","kind":"arxiv","version":2}},"canonical_sha256":"9d7bb8fa1a071a98fd49e90cc0c69c56e8fc5ef45944de23d3059e40b053ed98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d7bb8fa1a071a98fd49e90cc0c69c56e8fc5ef45944de23d3059e40b053ed98","first_computed_at":"2026-05-17T23:50:44.904799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:44.904799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TKxpYaGTj0MKRqCwCLHy3oQ+nw2pOLcTMMhkSILxfDw9t042yBAxEqy7XGzPc+f4QAz4ncP5QszWRPvL2WAEDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:44.905203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06764","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43e9fd3895857833d18f0393787c5d70239d2f65e1219160009673091b0ded9d","sha256:c21ad7465a30e0f9cd3088ebb920dd58ab4577558d6909a98505a6aa2b94964d"],"state_sha256":"38cc902ea218b6afa1852a102d28c1e0ce25f287984374b480f8a887a3fb1a95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0IKZqths62fErmzoyWHGnRvBx9yUHBohsXey85shaPb+cR81TxIzf+f2g5l/upC8Dxh2R4uT/ehoB1I6ANwqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:30:34.379675Z","bundle_sha256":"9f52bb08937142527165847909dbe85fac079638e9415fe44e8d29a09b69cb2c"}}