{"id":"d7b2c56bdd76ad44b10ed801b8c0b1eee1a6c204c35c3ff891e889ed9d5f9d3b","title":"Ke Zhang proposes ZipDrift for multimodal short-horizon MPC costs","argument":"Ke Zhang’s paper argues that short-horizon model predictive control (MPC) can miss good choices when a task has several viable paths. In its overtaking example, a slower opponent can be passed on either side; the corresponding cost corrections can have opposite signs, and tiny cost differences may determine which the expert selects. Zhang says deterministic regression can average these alternatives or reproduce inconsistent tie-breaking.\n\nZipDrift generates candidate corrections, tilting them toward low closed-loop cost using cost evaluations rather than differentiating through the optimiser. A learned critic ranks the candidates, while MPC enforces dynamics and constraints. In the paper’s kinematic overtaking benchmark, ZipDrift with eight candidates had a 0.74% crash rate, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates. A mixture density network with the same selection had a 0.76% rate. In a pre-specified test on further unseen contexts, one drifting sample had an 8.7% crash rate against 13.2% for the mixture density network; ZipDrift needed four candidates instead of eight to fall below 1%. The paper calls this a preliminary simulation study and reports that all methods degrade when many candidates let selection exploit critic errors.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The paper describes its results as a “Preliminary simulation study.” The reported crash rates are from a kinematic overtaking benchmark derived from ZipMPC; the evidence does not establish performance outside the stated benchmark and tests. The paper says all methods degrade as selection exploits critic errors when using many candidates.","speaker":{"name":"Zhang, Ke","roleAtSource":"Article author"},"source":{"title":"ZipDrift: Generating Multimodal Short-Horizon MPC Costs with One-Step Drifting Models","publisher":"arXiv eess.SY","format":"Article","url":"https://arxiv.org/abs/2611.05793","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"Ke Zhang argues that multiple viable passing choices can make the optimal cost correction multimodal, while deterministic regression may average the choices or inherit inconsistent expert tie-breaking.","excerpt":"the optimal correction is often multimodal: when a slower opponent can be passed on either side, good corrections of opposite sign coexist","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"ZipDrift generates cost corrections tilted toward low closed-loop cost using candidate cost evaluations, then ranks a few candidates with a learned critic; model-based MPC enforces dynamics and constraints.","excerpt":"trains a one-step drifting generator over MPC cost corrections, tilted toward low closed-loop cost and learned only from cost evaluations of candidate corrections","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"In the kinematic overtaking benchmark, ZipDrift with eight candidates had a reported crash rate of 0.74%, versus 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates.","excerpt":"ZipDrift with eight candidates crashes in 0.74% of episodes, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"The paper reports similar results for a mixture density network with the same selection, and lower crash rates for a single drifting sample than for a single mixture density network sample on further unseen contexts.","excerpt":"A mixture density network (MDN) with the same selection is equally good (0.76%). The benefit of drifting lies in sample quality: in a pre-specified test on further unseen contexts, a single drifting sample crashes in 8.7% of episodes against 13.2% for the MDN","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"The authors report that with many candidates, all methods degrade as selection exploits errors of the critic.","excerpt":"With many candidates, all methods degrade as selection exploits errors of the critic.","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.05793","checkedAt":"2026-11-10T17:50:13.278Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How would ZipDrift’s reported results change outside the kinematic overtaking benchmark used in this preliminary simulation study?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Ke Zhang proposes ZipDrift for multimodal short-horizon MPC costs","summary":"Ke Zhang’s paper argues that short-horizon model predictive control (MPC) can miss good choices when a task has several viable paths. In its overtaking example, a slower opponent can be passed on either side; the corresponding cost corrections can have opposite signs, and tiny cost differences may determine which the expert selects. Zhang says deterministic regression can average these alternatives or reproduce inconsistent tie-breaking.\n\nZipDrift generates candidate corrections, tilting them toward low closed-loop cost using cost evaluations rather than differentiating through the optimiser. A learned critic ranks the candidates, while MPC enforces dynamics and constraints. In the paper’s kinematic overtaking benchmark, ZipDrift with eight candidates had a 0.74% crash rate, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates. A mixture density network with the same selection had a 0.76% rate. In a pre-specified test on further unseen contexts, one drifting sample had an 8.7% crash rate against 13.2% for the mixture density network; ZipDrift needed four candidates instead of eight to fall below 1%. The paper calls this a preliminary simulation study and reports that all methods degrade when many candidates let selection exploit critic errors.","question":"How would ZipDrift’s reported results change outside the kinematic overtaking benchmark used in this preliminary simulation study?","claims":[{"text":"Ke Zhang argues that multiple viable passing choices can make the optimal cost correction multimodal, while deterministic regression may average the choices or inherit inconsistent expert tie-breaking.","excerpt":"the optimal correction is often multimodal: when a slower opponent can be passed on either side, good corrections of opposite sign coexist","support":"source-stated"},{"text":"ZipDrift generates cost corrections tilted toward low closed-loop cost using candidate cost evaluations, then ranks a few candidates with a learned critic; model-based MPC enforces dynamics and constraints.","excerpt":"trains a one-step drifting generator over MPC cost corrections, tilted toward low closed-loop cost and learned only from cost evaluations of candidate corrections","support":"source-stated"},{"text":"In the kinematic overtaking benchmark, ZipDrift with eight candidates had a reported crash rate of 0.74%, versus 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates.","excerpt":"ZipDrift with eight candidates crashes in 0.74% of episodes, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates","support":"source-stated"},{"text":"The paper reports similar results for a mixture density network with the same selection, and lower crash rates for a single drifting sample than for a single mixture density network sample on further unseen contexts.","excerpt":"A mixture density network (MDN) with the same selection is equally good (0.76%). The benefit of drifting lies in sample quality: in a pre-specified test on further unseen contexts, a single drifting sample crashes in 8.7% of episodes against 13.2% for the MDN","support":"source-stated"},{"text":"The authors report that with many candidates, all methods degrade as selection exploits errors of the critic.","excerpt":"With many candidates, all methods degrade as selection exploits errors of the critic.","support":"source-stated"}],"limitations":["The paper describes its results as a “Preliminary simulation study.”","The reported crash rates are from a kinematic overtaking benchmark derived from ZipMPC; the evidence does not establish performance outside the stated benchmark and tests.","The paper says all methods degrade as selection exploits critic errors when using many candidates."],"mediaId":"ea621de7e230ccb7aca7c19ba639041804af096d3a4c18144f73380c8ed5e951","correctionReason":null,"id":"d7b2c56bdd76ad44b10ed801b8c0b1eee1a6c204c35c3ff891e889ed9d5f9d3b","publicationId":"be13c9f5-4db0-4018-8fb2-cb00a56c037c","version":1,"sourceUrl":"https://arxiv.org/abs/2611.05793","sourceTitle":"ZipDrift: Generating Multimodal Short-Horizon MPC Costs with One-Step Drifting Models","publisher":"arXiv eess.SY","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-05T05:00:31.651Z","createdAt":"2026-11-10T17:18:36.150Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"ea621de7e230ccb7aca7c19ba639041804af096d3a4c18144f73380c8ed5e951","kind":"article","url":"https://arxiv.org/abs/2611.05793","sourceUrl":"https://arxiv.org/abs/2611.05793","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-09T00:48:01.717Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.05793","checkedAt":"2026-11-10T17:50:13.278Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"ea621de7e230ccb7aca7c19ba639041804af096d3a4c18144f73380c8ed5e951","confidence":0.73,"provider":"typesafe","model":"jev-1.13.0","inputHash":"6469c6a000fa6f962e2ed52646fd7d5eaeabab91c77b205d25516dfbfd9ff0ee","decidedAt":"2026-11-09T00:48:02.150Z"},"provenance":{"textHash":"69b9d2343f3f1fd4afd85c6fc2f0d5c695acf6bc22356850a8d365a169c19718","observationId":"322cbb1e2ee3f4bcd0defe425fb122da9deca90a5eb4c7811a6c64dec836b822","retrievedAt":"2026-11-09T00:48:01.658Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna; stream-draft-repair-v1","runId":"676e960b-bf12-41af-80d8-6e0cfc807441"},"reviewer":{"model":"gpt-6-luna","runId":"e53a1d78-96c6-4ec6-887d-e17ccd9b6003"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-10T17:18:36.150Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Zhang, Ke","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Zhang, Ke","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Zhang, Ke","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.05793","locator":"head/meta[name=author|citation_author]"},"assertionId":"f9392eca5255abc67f7346b34fadc9e96555e45032a67d714d3128948f05463d:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T17:50:13.278Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f9392eca5255abc67f7346b34fadc9e96555e45032a67d714d3128948f05463d","sourceUrl":"https://arxiv.org/abs/2611.05793","contentSha256":"0381267890f5320996b84ac10174579436ccf4cd90c33dd9de57217dc3be392a","textHash":"69b9d2343f3f1fd4afd85c6fc2f0d5c695acf6bc22356850a8d365a169c19718","observedAt":"2026-11-10T17:50:13.278Z"}}],"participationCoverage":{"total":1,"returned":1,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.05793","snapshotId":"f9392eca5255abc67f7346b34fadc9e96555e45032a67d714d3128948f05463d","contentSha256":"0381267890f5320996b84ac10174579436ccf4cd90c33dd9de57217dc3be392a","textHash":"69b9d2343f3f1fd4afd85c6fc2f0d5c695acf6bc22356850a8d365a169c19718","observedAt":"2026-11-10T17:50:13.278Z","basis":"publisher-page-metadata","sourceLinks":45,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/d7b2c56bdd76ad44b10ed801b8c0b1eee1a6c204c35c3ff891e889ed9d5f9d3b/source"}},"canonicalUrl":"https://escapemeridian.com/readings/ke-zhang-proposes-zipdrift-for-multimodal-short-horizon-mpc-d7b2c56b","formats":{"html":"/readings/ke-zhang-proposes-zipdrift-for-multimodal-short-horizon-mpc-d7b2c56b","markdown":"/readings/ke-zhang-proposes-zipdrift-for-multimodal-short-horizon-mpc-d7b2c56b.md","json":"/readings/ke-zhang-proposes-zipdrift-for-multimodal-short-horizon-mpc-d7b2c56b.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[{"id":"term-multimodal-model","name":"Multimodal model","explanation":"A model that works with more than one kind of input or output, such as text, images and audio.","referenceUrl":"https://developers.google.com/machine-learning/glossary#multimodal-model"},{"id":"term-benchmark","name":"Benchmark","explanation":"A defined set of tests used to compare systems. Results depend on the tasks and measures selected.","referenceUrl":"https://arxiv.org/abs/2211.09110"}],"entities":[{"id":"arxiv","name":"arXiv","kind":"organization","context":"arXiv is a research manuscript repository where authors share papers that may not yet have been peer reviewed.","referenceUrls":["https://arxiv.org/","https://info.arxiv.org/help/api/index.html"],"path":"/entities/arxiv","json":"/entities/arxiv.json","markdown":"/entities/arxiv.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"d7b2c56bdd76ad44b10ed801b8c0b1eee1a6c204c35c3ff891e889ed9d5f9d3b","revision":"be13c9f5-4db0-4018-8fb2-cb00a56c037c","revisionKind":"publication-id","title":"Ke Zhang proposes ZipDrift for multimodal short-horizon MPC costs","url":"https://escapemeridian.com/readings/ke-zhang-proposes-zipdrift-for-multimodal-short-horizon-mpc-d7b2c56b"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.05793","revision":"69b9d2343f3f1fd4afd85c6fc2f0d5c695acf6bc22356850a8d365a169c19718","revisionKind":"sha256-source-text","title":"ZipDrift: Generating Multimodal Short-Horizon MPC Costs with One-Step Drifting Models","url":"https://arxiv.org/abs/2611.05793"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"d7b2c56bdd76ad44b10ed801b8c0b1eee1a6c204c35c3ff891e889ed9d5f9d3b","title":"Ke Zhang proposes ZipDrift for multimodal short-horizon MPC costs","argument":"Ke Zhang’s paper argues that short-horizon model predictive control (MPC) can miss good choices when a task has several viable paths. In its overtaking example, a slower opponent can be passed on either side; the corresponding cost corrections can have opposite signs, and tiny cost differences may determine which the expert selects. Zhang says deterministic regression can average these alternatives or reproduce inconsistent tie-breaking.\n\nZipDrift generates candidate corrections, tilting them toward low closed-loop cost using cost evaluations rather than differentiating through the optimiser. A learned critic ranks the candidates, while MPC enforces dynamics and constraints. In the paper’s kinematic overtaking benchmark, ZipDrift with eight candidates had a 0.74% crash rate, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates. A mixture density network with the same selection had a 0.76% rate. In a pre-specified test on further unseen contexts, one drifting sample had an 8.7% crash rate against 13.2% for the mixture density network; ZipDrift needed four candidates instead of eight to fall below 1%. The paper calls this a preliminary simulation study and reports that all methods degrade when many candidates let selection exploit critic errors.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The paper describes its results as a “Preliminary simulation study.” The reported crash rates are from a kinematic overtaking benchmark derived from ZipMPC; the evidence does not establish performance outside the stated benchmark and tests. The paper says all methods degrade as selection exploits critic errors when using many candidates.","speaker":{"name":"Zhang, Ke","roleAtSource":"Article author"},"source":{"title":"ZipDrift: Generating Multimodal Short-Horizon MPC Costs with One-Step Drifting Models","publisher":"arXiv eess.SY","format":"Article","url":"https://arxiv.org/abs/2611.05793","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"Ke Zhang argues that multiple viable passing choices can make the optimal cost correction multimodal, while deterministic regression may average the choices or inherit inconsistent expert tie-breaking.","excerpt":"the optimal correction is often multimodal: when a slower opponent can be passed on either side, good corrections of opposite sign coexist","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"ZipDrift generates cost corrections tilted toward low closed-loop cost using candidate cost evaluations, then ranks a few candidates with a learned critic; model-based MPC enforces dynamics and constraints.","excerpt":"trains a one-step drifting generator over MPC cost corrections, tilted toward low closed-loop cost and learned only from cost evaluations of candidate corrections","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"In the kinematic overtaking benchmark, ZipDrift with eight candidates had a reported crash rate of 0.74%, versus 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates.","excerpt":"ZipDrift with eight candidates crashes in 0.74% of episodes, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"The paper reports similar results for a mixture density network with the same selection, and lower crash rates for a single drifting sample than for a single mixture density network sample on further unseen contexts.","excerpt":"A mixture density network (MDN) with the same selection is equally good (0.76%). The benefit of drifting lies in sample quality: in a pre-specified test on further unseen contexts, a single drifting sample crashes in 8.7% of episodes against 13.2% for the MDN","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"},{"text":"The authors report that with many candidates, all methods degrade as selection exploits errors of the critic.","excerpt":"With many candidates, all methods degrade as selection exploits errors of the critic.","url":"https://arxiv.org/abs/2611.05793","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.05793","checkedAt":"2026-11-10T17:50:13.278Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How would ZipDrift’s reported results change outside the kinematic overtaking benchmark used in this preliminary simulation study?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Ke Zhang proposes ZipDrift for multimodal short-horizon MPC costs","summary":"Ke Zhang’s paper argues that short-horizon model predictive control (MPC) can miss good choices when a task has several viable paths. In its overtaking example, a slower opponent can be passed on either side; the corresponding cost corrections can have opposite signs, and tiny cost differences may determine which the expert selects. Zhang says deterministic regression can average these alternatives or reproduce inconsistent tie-breaking.\n\nZipDrift generates candidate corrections, tilting them toward low closed-loop cost using cost evaluations rather than differentiating through the optimiser. A learned critic ranks the candidates, while MPC enforces dynamics and constraints. In the paper’s kinematic overtaking benchmark, ZipDrift with eight candidates had a 0.74% crash rate, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates. A mixture density network with the same selection had a 0.76% rate. In a pre-specified test on further unseen contexts, one drifting sample had an 8.7% crash rate against 13.2% for the mixture density network; ZipDrift needed four candidates instead of eight to fall below 1%. The paper calls this a preliminary simulation study and reports that all methods degrade when many candidates let selection exploit critic errors.","question":"How would ZipDrift’s reported results change outside the kinematic overtaking benchmark used in this preliminary simulation study?","claims":[{"text":"Ke Zhang argues that multiple viable passing choices can make the optimal cost correction multimodal, while deterministic regression may average the choices or inherit inconsistent expert tie-breaking.","excerpt":"the optimal correction is often multimodal: when a slower opponent can be passed on either side, good corrections of opposite sign coexist","support":"source-stated"},{"text":"ZipDrift generates cost corrections tilted toward low closed-loop cost using candidate cost evaluations, then ranks a few candidates with a learned critic; model-based MPC enforces dynamics and constraints.","excerpt":"trains a one-step drifting generator over MPC cost corrections, tilted toward low closed-loop cost and learned only from cost evaluations of candidate corrections","support":"source-stated"},{"text":"In the kinematic overtaking benchmark, ZipDrift with eight candidates had a reported crash rate of 0.74%, versus 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates.","excerpt":"ZipDrift with eight candidates crashes in 0.74% of episodes, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates","support":"source-stated"},{"text":"The paper reports similar results for a mixture density network with the same selection, and lower crash rates for a single drifting sample than for a single mixture density network sample on further unseen contexts.","excerpt":"A mixture density network (MDN) with the same selection is equally good (0.76%). The benefit of drifting lies in sample quality: in a pre-specified test on further unseen contexts, a single drifting sample crashes in 8.7% of episodes against 13.2% for the MDN","support":"source-stated"},{"text":"The authors report that with many candidates, all methods degrade as selection exploits errors of the critic.","excerpt":"With many candidates, all methods degrade as selection exploits errors of the critic.","support":"source-stated"}],"limitations":["The paper describes its results as a “Preliminary simulation study.”","The reported crash rates are from a kinematic overtaking benchmark derived from ZipMPC; the evidence does not establish performance outside the stated benchmark and tests.","The paper says all methods degrade as selection exploits critic errors when using many candidates."],"mediaId":"ea621de7e230ccb7aca7c19ba639041804af096d3a4c18144f73380c8ed5e951","correctionReason":null,"id":"d7b2c56bdd76ad44b10ed801b8c0b1eee1a6c204c35c3ff891e889ed9d5f9d3b","publicationId":"be13c9f5-4db0-4018-8fb2-cb00a56c037c","version":1,"sourceUrl":"https://arxiv.org/abs/2611.05793","sourceTitle":"ZipDrift: Generating Multimodal Short-Horizon MPC Costs with One-Step Drifting Models","publisher":"arXiv eess.SY","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-05T05:00:31.651Z","createdAt":"2026-11-10T17:18:36.150Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"ea621de7e230ccb7aca7c19ba639041804af096d3a4c18144f73380c8ed5e951","kind":"article","url":"https://arxiv.org/abs/2611.05793","sourceUrl":"https://arxiv.org/abs/2611.05793","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-09T00:48:01.717Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.05793","checkedAt":"2026-11-10T17:50:13.278Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"ea621de7e230ccb7aca7c19ba639041804af096d3a4c18144f73380c8ed5e951","confidence":0.73,"provider":"typesafe","model":"jev-1.13.0","inputHash":"6469c6a000fa6f962e2ed52646fd7d5eaeabab91c77b205d25516dfbfd9ff0ee","decidedAt":"2026-11-09T00:48:02.150Z"},"provenance":{"textHash":"69b9d2343f3f1fd4afd85c6fc2f0d5c695acf6bc22356850a8d365a169c19718","observationId":"322cbb1e2ee3f4bcd0defe425fb122da9deca90a5eb4c7811a6c64dec836b822","retrievedAt":"2026-11-09T00:48:01.658Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna; stream-draft-repair-v1","runId":"676e960b-bf12-41af-80d8-6e0cfc807441"},"reviewer":{"model":"gpt-6-luna","runId":"e53a1d78-96c6-4ec6-887d-e17ccd9b6003"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-10T17:18:36.150Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Zhang, Ke","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Zhang, Ke","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Zhang, Ke","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.05793","locator":"head/meta[name=author|citation_author]"},"assertionId":"f9392eca5255abc67f7346b34fadc9e96555e45032a67d714d3128948f05463d:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T17:50:13.278Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f9392eca5255abc67f7346b34fadc9e96555e45032a67d714d3128948f05463d","sourceUrl":"https://arxiv.org/abs/2611.05793","contentSha256":"0381267890f5320996b84ac10174579436ccf4cd90c33dd9de57217dc3be392a","textHash":"69b9d2343f3f1fd4afd85c6fc2f0d5c695acf6bc22356850a8d365a169c19718","observedAt":"2026-11-10T17:50:13.278Z"}}],"participationCoverage":{"total":1,"returned":1,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.05793","snapshotId":"f9392eca5255abc67f7346b34fadc9e96555e45032a67d714d3128948f05463d","contentSha256":"0381267890f5320996b84ac10174579436ccf4cd90c33dd9de57217dc3be392a","textHash":"69b9d2343f3f1fd4afd85c6fc2f0d5c695acf6bc22356850a8d365a169c19718","observedAt":"2026-11-10T17:50:13.278Z","basis":"publisher-page-metadata","sourceLinks":45,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/d7b2c56bdd76ad44b10ed801b8c0b1eee1a6c204c35c3ff891e889ed9d5f9d3b/source"}}}],"audits":[{"publicationId":"be13c9f5-4db0-4018-8fb2-cb00a56c037c","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The paper is correctly attributed to its sole listed author, Ke Zhang, and results are framed as the paper's reports. Claim 5 says 'The authors report' although there is one author. This is a minor wording slip; changing it to 'The paper reports' would fix it.","excerpt":"Authors:Ke Zhang"},{"dimension":"summary","status":"uncertain","explanation":"A non-specialist cannot follow the core idea. The draft never says short-horizon MPC plans only a short time ahead ('fast but myopic'). It omits ZipMPC's learned cost correction that imitates a long-horizon expert, yet then refers to 'the corresponding cost corrections' and a 'ZipMPC-style regressor' as if known. 'Drifting', 'critic', 'closed-loop cost' and 'mixture density network' go unexplained. It also drops the 28% crash baseline for manual short-horizon MPC. Smallest repair: add the myopia/ZipMPC framing and the baseline, and gloss the terms.","excerpt":"Short-horizon model predictive control (MPC) is fast but myopic. ZipMPC compensates by learning a context-dependent correction of the short-horizon cost that imitates a long-horizon expert."},{"dimension":"date","status":"pass","explanation":"originalPublished 2026-11-04 matches the v1 submission date. The later v2 revision on 5 Nov does not change the first publication date.","excerpt":"Submitted on 4 Nov 2026 (v1), last revised 5 Nov 2026 (this version, v2)"},{"dimension":"support","status":"pass","explanation":"The crash rates (0.74%, 3.4%, 2.1%, 0.76%, 8.7% vs 13.2%), the four-versus-eight candidate finding, critic exploitation and the preliminary-simulation caveat all match the abstract. The question follows from the stated scope without implying an answer.","excerpt":"ZipDrift with eight candidates crashes in 0.74% of episodes, compared with 3.4% for an idealised ZipMPC-style regressor and 2.1% for critic-ranked random candidates with the same budget."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct arXiv abstract page for this paper, which is the most direct access to the source.","excerpt":null}],"createdAt":"2026-11-10T17:18:36.150Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}