{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LP54N5ZWW7TND2NVZXRZB3PDPL","short_pith_number":"pith:LP54N5ZW","canonical_record":{"source":{"id":"1906.08257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T06:08:06Z","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"6325dbfb3d5a7f1c78bf6487a9d16921f60e0f1c14b825c332d42d91dc4daa1c","abstract_canon_sha256":"028ab3391e2411e6b16a55669f6c8b8ade78d94c52c91b704892ae77d3915f1c"},"schema_version":"1.0"},"canonical_sha256":"5bfbc6f736b7e6d1e9b5cde390ede37af85c6cf91dfa83db1b513aa45f2300c7","source":{"kind":"arxiv","id":"1906.08257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08257","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08257v1","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08257","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"LP54N5ZWW7TN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LP54N5ZWW7TND2NV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LP54N5ZW","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LP54N5ZWW7TND2NVZXRZB3PDPL","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T06:08:06Z","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"6325dbfb3d5a7f1c78bf6487a9d16921f60e0f1c14b825c332d42d91dc4daa1c","abstract_canon_sha256":"028ab3391e2411e6b16a55669f6c8b8ade78d94c52c91b704892ae77d3915f1c"},"schema_version":"1.0"},"canonical_sha256":"5bfbc6f736b7e6d1e9b5cde390ede37af85c6cf91dfa83db1b513aa45f2300c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:52.929058Z","signature_b64":"HWyWizcPg07nFHu5HQK1zQWZEszwgZHHdOQcOJQCv3Gu2bLL7EvhiR8uIeKv220bxeHkZttTlFiW4fzKMLaPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bfbc6f736b7e6d1e9b5cde390ede37af85c6cf91dfa83db1b513aa45f2300c7","last_reissued_at":"2026-05-17T23:42:52.928434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:52.928434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08257","source_version":1,"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:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4wtl7tnIlDFB1ISWhadDq8Y4ldKcZHtLfx50JfZ9RwSiK0zk/MPEfYw9ivfugaua76SJ+fhcx2t7kNWdNG9NAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:30:11.463307Z"},"content_sha256":"83f6333fe0e6746e20d2587703d1c6f648b8861b1f7f01850411f934e175ab65","schema_version":"1.0","event_id":"sha256:83f6333fe0e6746e20d2587703d1c6f648b8861b1f7f01850411f934e175ab65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LP54N5ZWW7TND2NVZXRZB3PDPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe and Near-Optimal Policy Learning for Model Predictive Control using Primal-Dual Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Borrelli, Monimoy Bujarbaruah, Xiaojing Zhang","submitted_at":"2019-06-19T06:08:06Z","abstract_excerpt":"In this paper, we propose a novel framework for approximating the explicit MPC law for linear parameter-varying systems using supervised learning. In contrast to most existing approaches, we not only learn the control policy, but also a \"certificate policy\", that allows us to estimate the sub-optimality of the learned control policy online, during execution-time. We learn both these policies from data using supervised learning techniques, and also provide a randomized method that allows us to guarantee the quality of each learned policy, measured in terms of feasibility and optimality. This in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08257","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"},"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:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXsJEtxrHrvbafqqNQGUM3qdBBUMTSul53m9UR55DsjZp+Z+stgJdRTKDdei2YptSs3wwLmTWZTmiRKi5QoADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:30:11.463682Z"},"content_sha256":"ed0e0eb82188eae5512408799b94b50cbfc2e51a5b1d35c5f67395a23b577ada","schema_version":"1.0","event_id":"sha256:ed0e0eb82188eae5512408799b94b50cbfc2e51a5b1d35c5f67395a23b577ada"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LP54N5ZWW7TND2NVZXRZB3PDPL/bundle.json","state_url":"https://pith.science/pith/LP54N5ZWW7TND2NVZXRZB3PDPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LP54N5ZWW7TND2NVZXRZB3PDPL/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-01T10:30:11Z","links":{"resolver":"https://pith.science/pith/LP54N5ZWW7TND2NVZXRZB3PDPL","bundle":"https://pith.science/pith/LP54N5ZWW7TND2NVZXRZB3PDPL/bundle.json","state":"https://pith.science/pith/LP54N5ZWW7TND2NVZXRZB3PDPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LP54N5ZWW7TND2NVZXRZB3PDPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LP54N5ZWW7TND2NVZXRZB3PDPL","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":"028ab3391e2411e6b16a55669f6c8b8ade78d94c52c91b704892ae77d3915f1c","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T06:08:06Z","title_canon_sha256":"6325dbfb3d5a7f1c78bf6487a9d16921f60e0f1c14b825c332d42d91dc4daa1c"},"schema_version":"1.0","source":{"id":"1906.08257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08257","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08257v1","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08257","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"LP54N5ZWW7TN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LP54N5ZWW7TND2NV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LP54N5ZW","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:ed0e0eb82188eae5512408799b94b50cbfc2e51a5b1d35c5f67395a23b577ada","target":"graph","created_at":"2026-05-17T23:42:52Z","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":"In this paper, we propose a novel framework for approximating the explicit MPC law for linear parameter-varying systems using supervised learning. In contrast to most existing approaches, we not only learn the control policy, but also a \"certificate policy\", that allows us to estimate the sub-optimality of the learned control policy online, during execution-time. We learn both these policies from data using supervised learning techniques, and also provide a randomized method that allows us to guarantee the quality of each learned policy, measured in terms of feasibility and optimality. This in","authors_text":"Francesco Borrelli, Monimoy Bujarbaruah, Xiaojing Zhang","cross_cats":["cs.SY","eess.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T06:08:06Z","title":"Safe and Near-Optimal Policy Learning for Model Predictive Control using Primal-Dual Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08257","kind":"arxiv","version":1},"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:83f6333fe0e6746e20d2587703d1c6f648b8861b1f7f01850411f934e175ab65","target":"record","created_at":"2026-05-17T23:42:52Z","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":"028ab3391e2411e6b16a55669f6c8b8ade78d94c52c91b704892ae77d3915f1c","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T06:08:06Z","title_canon_sha256":"6325dbfb3d5a7f1c78bf6487a9d16921f60e0f1c14b825c332d42d91dc4daa1c"},"schema_version":"1.0","source":{"id":"1906.08257","kind":"arxiv","version":1}},"canonical_sha256":"5bfbc6f736b7e6d1e9b5cde390ede37af85c6cf91dfa83db1b513aa45f2300c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bfbc6f736b7e6d1e9b5cde390ede37af85c6cf91dfa83db1b513aa45f2300c7","first_computed_at":"2026-05-17T23:42:52.928434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:52.928434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HWyWizcPg07nFHu5HQK1zQWZEszwgZHHdOQcOJQCv3Gu2bLL7EvhiR8uIeKv220bxeHkZttTlFiW4fzKMLaPAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:52.929058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83f6333fe0e6746e20d2587703d1c6f648b8861b1f7f01850411f934e175ab65","sha256:ed0e0eb82188eae5512408799b94b50cbfc2e51a5b1d35c5f67395a23b577ada"],"state_sha256":"6f2f9a81293b5a10153fac6af2af80e9128424c8062c1d8753f3f622588385d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TP/J9gs2bvyW8epRTpV1BV9GWKOQ1Ba9qG2sQRUcYUur7c6T3fqZGyZYc5vF2ItG9uCqVLJgFTgcSWm79f68CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:30:11.465804Z","bundle_sha256":"d115f78f5ab8cf6ec21184f93c6b5b66cb6fa4a382921f794875c9e232166644"}}