{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GCIADA3KWWP362IA6DJN4XGW6M","short_pith_number":"pith:GCIADA3K","schema_version":"1.0","canonical_sha256":"309001836ab59fbf6900f0d2de5cd6f32b3f1d37dcdaf58ce7fbaa66ca649b3b","source":{"kind":"arxiv","id":"2310.04590","version":1},"attestation_state":"computed","paper":{"title":"Deep Model Predictive Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Alex Spitzer, Byron Boots, Guanya Shi, Jacob Sacks, Kevin Huang, Rwik Rana","submitted_at":"2023-10-06T21:11:52Z","abstract_excerpt":"A major challenge in robotics is to design robust policies which enable complex and agile behaviors in the real world. On one end of the spectrum, we have model-free reinforcement learning (MFRL), which is incredibly flexible and general but often results in brittle policies. In contrast, model predictive control (MPC) continually re-plans at each time step to remain robust to perturbations and model inaccuracies. However, despite its real-world successes, MPC often under-performs the optimal strategy. This is due to model quality, myopic behavior from short planning horizons, and approximatio"},"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":"2310.04590","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-10-06T21:11:52Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"3ed7565c3121b9bf88edcefa465b009c1eb116d8dd588c69ebdd588ec6f525c8","abstract_canon_sha256":"8de8d68db02efabd9819d40e62558e13c1816cc9f7907d574bb5fd221026d045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:13:33.742727Z","signature_b64":"dtHo6YW6KYkjvudGB11ln85/AO5kaXixy98kyWi1dxCwKGT/fofHrMjNf/qj9BMGAfVW42Um+9LX8aTOESPrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309001836ab59fbf6900f0d2de5cd6f32b3f1d37dcdaf58ce7fbaa66ca649b3b","last_reissued_at":"2026-07-05T09:13:33.742162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:13:33.742162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Model Predictive Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Alex Spitzer, Byron Boots, Guanya Shi, Jacob Sacks, Kevin Huang, Rwik Rana","submitted_at":"2023-10-06T21:11:52Z","abstract_excerpt":"A major challenge in robotics is to design robust policies which enable complex and agile behaviors in the real world. On one end of the spectrum, we have model-free reinforcement learning (MFRL), which is incredibly flexible and general but often results in brittle policies. In contrast, model predictive control (MPC) continually re-plans at each time step to remain robust to perturbations and model inaccuracies. However, despite its real-world successes, MPC often under-performs the optimal strategy. This is due to model quality, myopic behavior from short planning horizons, and approximatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04590","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/2310.04590/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":"2310.04590","created_at":"2026-07-05T09:13:33.742221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04590v1","created_at":"2026-07-05T09:13:33.742221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04590","created_at":"2026-07-05T09:13:33.742221+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCIADA3KWWP3","created_at":"2026-07-05T09:13:33.742221+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCIADA3KWWP362IA","created_at":"2026-07-05T09:13:33.742221+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCIADA3K","created_at":"2026-07-05T09:13:33.742221+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":186,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M","json":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M.json","graph_json":"https://pith.science/api/pith-number/GCIADA3KWWP362IA6DJN4XGW6M/graph.json","events_json":"https://pith.science/api/pith-number/GCIADA3KWWP362IA6DJN4XGW6M/events.json","paper":"https://pith.science/paper/GCIADA3K"},"agent_actions":{"view_html":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M","download_json":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M.json","view_paper":"https://pith.science/paper/GCIADA3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04590&json=true","fetch_graph":"https://pith.science/api/pith-number/GCIADA3KWWP362IA6DJN4XGW6M/graph.json","fetch_events":"https://pith.science/api/pith-number/GCIADA3KWWP362IA6DJN4XGW6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M/action/storage_attestation","attest_author":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M/action/author_attestation","sign_citation":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M/action/citation_signature","submit_replication":"https://pith.science/pith/GCIADA3KWWP362IA6DJN4XGW6M/action/replication_record"}},"created_at":"2026-07-05T09:13:33.742221+00:00","updated_at":"2026-07-05T09:13:33.742221+00:00"}