{"id":"bb3ce2d9eda96bb236ea52b9e27bf9ba589ea5adc236775b3e8dc62f26c4edf7","title":"FAME-QP: A GPU-Accelerated Solver for Real-Time Model Predictive Control","argument":"Authors Santosh Mohan Rajkumar, Debdipta Goswami and Stephanie Stockar present FAME-QP, a GPU-accelerated solver for dense quadratic programs used in linear model predictive control. Model predictive control repeatedly solves an optimization problem to choose actions; the authors focus on reducing the time needed for these calculations. FAME-QP uses constraint-dependent operator representations and fused iterations, replayed through CUDA graphs, and selects an execution configuration using device calibration and problem-specific timing. It also probes a cached operator bank to choose an initial penalty, then updates operators lazily when problem matrices change. The authors report that numerical benchmarks and simulated humanoid and quadrotor control experiments show reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance. The abstract does not give the size of the latency reductions, so the reported comparison does not establish how much faster the solver is or how its performance would carry over beyond the described experiments.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The abstract reports reduced latency but gives no numerical values for the reductions. The described control experiments are simulated humanoid and quadrotor experiments; the abstract does not report results from physical systems.","speaker":{"name":"Rajkumar, Santosh Mohan, Goswami, Debdipta, Stockar, Stephanie","roleAtSource":"Article author"},"source":{"title":"FAME-QP: A GPU-Accelerated Quadratic-Programming Solver for Real-Time Model Predictive Control","publisher":"arXiv eess.SY","format":"Article","url":"https://arxiv.org/abs/2611.13766","publishedAt":"2026-11-10","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors present FAME-QP as a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","excerpt":"We present FAME-QP, a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","url":"https://arxiv.org/abs/2611.13766","relationship":"Source-stated"},{"text":"FAME-QP selects its execution configuration using device calibration and problem-specific timing, and updates operators lazily when problem matrices change.","excerpt":"automatically selecting the execution configuration through device calibration and problem-specific timing. It probes a cached operator bank to select the initial penalty and updates operators lazily when problem matrices change.","url":"https://arxiv.org/abs/2611.13766","relationship":"Source-stated"},{"text":"The authors report reduced latency relative to competing GPU solvers, with solution accuracy and control performance maintained in numerical benchmarks and simulated humanoid and quadrotor control experiments.","excerpt":"Numerical benchmarks and simulated humanoid and quadrotor control experiments demonstrate reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance.","url":"https://arxiv.org/abs/2611.13766","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.13766","checkedAt":"2026-11-11T23:48:22.538Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How large were the latency reductions relative to the competing GPU solvers in the reported benchmarks and simulated control experiments?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"FAME-QP: A GPU-Accelerated Solver for Real-Time Model Predictive Control","summary":"Authors Santosh Mohan Rajkumar, Debdipta Goswami and Stephanie Stockar present FAME-QP, a GPU-accelerated solver for dense quadratic programs used in linear model predictive control. Model predictive control repeatedly solves an optimization problem to choose actions; the authors focus on reducing the time needed for these calculations. FAME-QP uses constraint-dependent operator representations and fused iterations, replayed through CUDA graphs, and selects an execution configuration using device calibration and problem-specific timing. It also probes a cached operator bank to choose an initial penalty, then updates operators lazily when problem matrices change. The authors report that numerical benchmarks and simulated humanoid and quadrotor control experiments show reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance. The abstract does not give the size of the latency reductions, so the reported comparison does not establish how much faster the solver is or how its performance would carry over beyond the described experiments.","question":"How large were the latency reductions relative to the competing GPU solvers in the reported benchmarks and simulated control experiments?","claims":[{"text":"The authors present FAME-QP as a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","excerpt":"We present FAME-QP, a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","support":"source-stated"},{"text":"FAME-QP selects its execution configuration using device calibration and problem-specific timing, and updates operators lazily when problem matrices change.","excerpt":"automatically selecting the execution configuration through device calibration and problem-specific timing. It probes a cached operator bank to select the initial penalty and updates operators lazily when problem matrices change.","support":"source-stated"},{"text":"The authors report reduced latency relative to competing GPU solvers, with solution accuracy and control performance maintained in numerical benchmarks and simulated humanoid and quadrotor control experiments.","excerpt":"Numerical benchmarks and simulated humanoid and quadrotor control experiments demonstrate reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance.","support":"source-stated"}],"limitations":["The abstract reports reduced latency but gives no numerical values for the reductions.","The described control experiments are simulated humanoid and quadrotor experiments; the abstract does not report results from physical systems."],"mediaId":"5d356e0df1ec728e6f6f8b1f8fca26f283f333fd2d1fccbc1724d02cdc17a39e","correctionReason":null,"id":"bb3ce2d9eda96bb236ea52b9e27bf9ba589ea5adc236775b3e8dc62f26c4edf7","publicationId":"c705e502-4059-40d7-87e1-a32c22f3b006","version":1,"sourceUrl":"https://arxiv.org/abs/2611.13766","sourceTitle":"FAME-QP: A GPU-Accelerated Quadratic-Programming Solver for Real-Time Model Predictive Control","publisher":"arXiv eess.SY","publishedAt":null,"originalPublished":{"value":"2026-11-10","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-11T05:03:50.603Z","createdAt":"2026-11-11T23:17:11.124Z","historical":false,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"5d356e0df1ec728e6f6f8b1f8fca26f283f333fd2d1fccbc1724d02cdc17a39e","kind":"article","url":"https://arxiv.org/abs/2611.13766","sourceUrl":"https://arxiv.org/abs/2611.13766","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-11T23:16:35.342Z","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.13766","checkedAt":"2026-11-11T23:48:22.538Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"5d356e0df1ec728e6f6f8b1f8fca26f283f333fd2d1fccbc1724d02cdc17a39e","confidence":0.75,"provider":"typesafe","model":"jev-1.13.0","inputHash":"1bf9989cfe63fb65f9c9e7dc7ba5b6e5a8f84f9d42b7a18884c2957523a806d8","decidedAt":"2026-11-11T23:16:36.340Z"},"provenance":{"textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observationId":"3dce58b94e6155b7a5cfcb220a391c668256f231115714e9cc755e65035eafc7","retrievedAt":"2026-11-11T23:16:35.230Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"45abfdf5-51f3-4c0a-8844-dfccca680d36"},"reviewer":{"model":"gpt-6-luna","runId":"6730675a-3f12-4158-8e03-7818c6607cd4"}},"audit":{"status":"passed","reviewedAt":"2026-11-11T23:17:11.124Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Rajkumar, Santosh Mohan","url":null,"kind":"unknown"},{"name":"Goswami, Debdipta","url":null,"kind":"unknown"},{"name":"Stockar, Stephanie","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Rajkumar, Santosh Mohan","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Rajkumar, Santosh Mohan","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.13766","locator":"head/meta[name=author|citation_author]"},"assertionId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T23:48:22.538Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","sourceUrl":"https://arxiv.org/abs/2611.13766","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z"}},{"actor":{"name":"Goswami, Debdipta","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Goswami, Debdipta","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.13766","locator":"head/meta[name=author|citation_author]"},"assertionId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T23:48:22.538Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","sourceUrl":"https://arxiv.org/abs/2611.13766","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z"}},{"actor":{"name":"Stockar, Stephanie","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Stockar, Stephanie","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.13766","locator":"head/meta[name=author|citation_author]"},"assertionId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T23:48:22.538Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","sourceUrl":"https://arxiv.org/abs/2611.13766","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z"}}],"participationCoverage":{"total":3,"returned":3,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.13766","snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z","basis":"publisher-page-metadata","sourceLinks":45,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/bb3ce2d9eda96bb236ea52b9e27bf9ba589ea5adc236775b3e8dc62f26c4edf7/source"}},"canonicalUrl":"https://escapemeridian.com/readings/fame-qp-a-gpu-accelerated-solver-for-real-time-model-predictive-bb3ce2d9","formats":{"html":"/readings/fame-qp-a-gpu-accelerated-solver-for-real-time-model-predictive-bb3ce2d9","markdown":"/readings/fame-qp-a-gpu-accelerated-solver-for-real-time-model-predictive-bb3ce2d9.md","json":"/readings/fame-qp-a-gpu-accelerated-solver-for-real-time-model-predictive-bb3ce2d9.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-gpu","name":"Graphics processing unit","explanation":"A chip that performs many calculations at once; the main hardware used to train and run AI models.","referenceUrl":"https://en.wikipedia.org/wiki/Graphics_processing_unit"},{"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"},{"id":"term-latency","name":"Latency","explanation":"The delay between sending a request and receiving the result.","referenceUrl":"https://developers.google.com/machine-learning/glossary#latency"}],"entities":[{"id":"time","name":"TIME","kind":"organization","context":"TIME is a news magazine publishing reporting on world affairs, business, technology and the workers behind digital services.","referenceUrls":["https://time.com/"],"path":"/entities/time","json":"/entities/time.json","markdown":"/entities/time.md"},{"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":"bb3ce2d9eda96bb236ea52b9e27bf9ba589ea5adc236775b3e8dc62f26c4edf7","revision":"c705e502-4059-40d7-87e1-a32c22f3b006","revisionKind":"publication-id","title":"FAME-QP: A GPU-Accelerated Solver for Real-Time Model Predictive Control","url":"https://escapemeridian.com/readings/fame-qp-a-gpu-accelerated-solver-for-real-time-model-predictive-bb3ce2d9"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.13766","revision":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","revisionKind":"sha256-source-text","title":"FAME-QP: A GPU-Accelerated Quadratic-Programming Solver for Real-Time Model Predictive Control","url":"https://arxiv.org/abs/2611.13766"},"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":"bb3ce2d9eda96bb236ea52b9e27bf9ba589ea5adc236775b3e8dc62f26c4edf7","title":"FAME-QP: A GPU-Accelerated Solver for Real-Time Model Predictive Control","argument":"Authors Santosh Mohan Rajkumar, Debdipta Goswami and Stephanie Stockar present FAME-QP, a GPU-accelerated solver for dense quadratic programs used in linear model predictive control. Model predictive control repeatedly solves an optimization problem to choose actions; the authors focus on reducing the time needed for these calculations. FAME-QP uses constraint-dependent operator representations and fused iterations, replayed through CUDA graphs, and selects an execution configuration using device calibration and problem-specific timing. It also probes a cached operator bank to choose an initial penalty, then updates operators lazily when problem matrices change. The authors report that numerical benchmarks and simulated humanoid and quadrotor control experiments show reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance. The abstract does not give the size of the latency reductions, so the reported comparison does not establish how much faster the solver is or how its performance would carry over beyond the described experiments.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The abstract reports reduced latency but gives no numerical values for the reductions. The described control experiments are simulated humanoid and quadrotor experiments; the abstract does not report results from physical systems.","speaker":{"name":"Rajkumar, Santosh Mohan, Goswami, Debdipta, Stockar, Stephanie","roleAtSource":"Article author"},"source":{"title":"FAME-QP: A GPU-Accelerated Quadratic-Programming Solver for Real-Time Model Predictive Control","publisher":"arXiv eess.SY","format":"Article","url":"https://arxiv.org/abs/2611.13766","publishedAt":"2026-11-10","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors present FAME-QP as a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","excerpt":"We present FAME-QP, a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","url":"https://arxiv.org/abs/2611.13766","relationship":"Source-stated"},{"text":"FAME-QP selects its execution configuration using device calibration and problem-specific timing, and updates operators lazily when problem matrices change.","excerpt":"automatically selecting the execution configuration through device calibration and problem-specific timing. It probes a cached operator bank to select the initial penalty and updates operators lazily when problem matrices change.","url":"https://arxiv.org/abs/2611.13766","relationship":"Source-stated"},{"text":"The authors report reduced latency relative to competing GPU solvers, with solution accuracy and control performance maintained in numerical benchmarks and simulated humanoid and quadrotor control experiments.","excerpt":"Numerical benchmarks and simulated humanoid and quadrotor control experiments demonstrate reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance.","url":"https://arxiv.org/abs/2611.13766","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.13766","checkedAt":"2026-11-11T23:48:22.538Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How large were the latency reductions relative to the competing GPU solvers in the reported benchmarks and simulated control experiments?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"FAME-QP: A GPU-Accelerated Solver for Real-Time Model Predictive Control","summary":"Authors Santosh Mohan Rajkumar, Debdipta Goswami and Stephanie Stockar present FAME-QP, a GPU-accelerated solver for dense quadratic programs used in linear model predictive control. Model predictive control repeatedly solves an optimization problem to choose actions; the authors focus on reducing the time needed for these calculations. FAME-QP uses constraint-dependent operator representations and fused iterations, replayed through CUDA graphs, and selects an execution configuration using device calibration and problem-specific timing. It also probes a cached operator bank to choose an initial penalty, then updates operators lazily when problem matrices change. The authors report that numerical benchmarks and simulated humanoid and quadrotor control experiments show reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance. The abstract does not give the size of the latency reductions, so the reported comparison does not establish how much faster the solver is or how its performance would carry over beyond the described experiments.","question":"How large were the latency reductions relative to the competing GPU solvers in the reported benchmarks and simulated control experiments?","claims":[{"text":"The authors present FAME-QP as a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","excerpt":"We present FAME-QP, a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control.","support":"source-stated"},{"text":"FAME-QP selects its execution configuration using device calibration and problem-specific timing, and updates operators lazily when problem matrices change.","excerpt":"automatically selecting the execution configuration through device calibration and problem-specific timing. It probes a cached operator bank to select the initial penalty and updates operators lazily when problem matrices change.","support":"source-stated"},{"text":"The authors report reduced latency relative to competing GPU solvers, with solution accuracy and control performance maintained in numerical benchmarks and simulated humanoid and quadrotor control experiments.","excerpt":"Numerical benchmarks and simulated humanoid and quadrotor control experiments demonstrate reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance.","support":"source-stated"}],"limitations":["The abstract reports reduced latency but gives no numerical values for the reductions.","The described control experiments are simulated humanoid and quadrotor experiments; the abstract does not report results from physical systems."],"mediaId":"5d356e0df1ec728e6f6f8b1f8fca26f283f333fd2d1fccbc1724d02cdc17a39e","correctionReason":null,"id":"bb3ce2d9eda96bb236ea52b9e27bf9ba589ea5adc236775b3e8dc62f26c4edf7","publicationId":"c705e502-4059-40d7-87e1-a32c22f3b006","version":1,"sourceUrl":"https://arxiv.org/abs/2611.13766","sourceTitle":"FAME-QP: A GPU-Accelerated Quadratic-Programming Solver for Real-Time Model Predictive Control","publisher":"arXiv eess.SY","publishedAt":null,"originalPublished":{"value":"2026-11-10","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-11T05:03:50.603Z","createdAt":"2026-11-11T23:17:11.124Z","historical":false,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"5d356e0df1ec728e6f6f8b1f8fca26f283f333fd2d1fccbc1724d02cdc17a39e","kind":"article","url":"https://arxiv.org/abs/2611.13766","sourceUrl":"https://arxiv.org/abs/2611.13766","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-11T23:16:35.342Z","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.13766","checkedAt":"2026-11-11T23:48:22.538Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"5d356e0df1ec728e6f6f8b1f8fca26f283f333fd2d1fccbc1724d02cdc17a39e","confidence":0.75,"provider":"typesafe","model":"jev-1.13.0","inputHash":"1bf9989cfe63fb65f9c9e7dc7ba5b6e5a8f84f9d42b7a18884c2957523a806d8","decidedAt":"2026-11-11T23:16:36.340Z"},"provenance":{"textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observationId":"3dce58b94e6155b7a5cfcb220a391c668256f231115714e9cc755e65035eafc7","retrievedAt":"2026-11-11T23:16:35.230Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"45abfdf5-51f3-4c0a-8844-dfccca680d36"},"reviewer":{"model":"gpt-6-luna","runId":"6730675a-3f12-4158-8e03-7818c6607cd4"}},"audit":{"status":"passed","reviewedAt":"2026-11-11T23:17:11.124Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Rajkumar, Santosh Mohan","url":null,"kind":"unknown"},{"name":"Goswami, Debdipta","url":null,"kind":"unknown"},{"name":"Stockar, Stephanie","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Rajkumar, Santosh Mohan","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Rajkumar, Santosh Mohan","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.13766","locator":"head/meta[name=author|citation_author]"},"assertionId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T23:48:22.538Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","sourceUrl":"https://arxiv.org/abs/2611.13766","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z"}},{"actor":{"name":"Goswami, Debdipta","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Goswami, Debdipta","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.13766","locator":"head/meta[name=author|citation_author]"},"assertionId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T23:48:22.538Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","sourceUrl":"https://arxiv.org/abs/2611.13766","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z"}},{"actor":{"name":"Stockar, Stephanie","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Stockar, Stephanie","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.13766","locator":"head/meta[name=author|citation_author]"},"assertionId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T23:48:22.538Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","sourceUrl":"https://arxiv.org/abs/2611.13766","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z"}}],"participationCoverage":{"total":3,"returned":3,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.13766","snapshotId":"f82072bbd3254a670f0bb2951cf76f6423748856535ec1c26ddaac1717bd559e","contentSha256":"72addd2f33e6d141a33574f522768cf3c90129d61165f40b4e3a3a66c921b1f3","textHash":"b9fbcdbc9b455443023e8f03b3484e970cc4581fef116d591165609ea597ca40","observedAt":"2026-11-11T23:48:22.538Z","basis":"publisher-page-metadata","sourceLinks":45,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/bb3ce2d9eda96bb236ea52b9e27bf9ba589ea5adc236775b3e8dc62f26c4edf7/source"}}}],"audits":[{"publicationId":"c705e502-4059-40d7-87e1-a32c22f3b006","verdict":"passed","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading names the three listed authors and keeps the solver description and benchmark results attributed to them ('present', 'The authors report') rather than stating them as established fact.","excerpt":"Authors:Santosh Mohan Rajkumar, Debdipta Goswami, Stephanie Stockar"},{"dimension":"summary","status":"pass","explanation":"The reading leads with the actor and the development. It briefly explains model predictive control and why calculation time matters for real-time control, so a general reader can follow the core point: a faster GPU solver for robot control calculations. Implementation terms such as CUDA graphs and operator bank are kept exactly. They are secondary details and could use term-library tooltips. The title condenses the source title faithfully, and the question addresses a real gap in the abstract.","excerpt":"We present FAME-QP, a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control."},{"dimension":"date","status":"pass","explanation":"The originalPublished date, 2026-11-10, matches the v1 submission date on the arXiv page. The later feed timestamp of 2026-11-11 was correctly not used.","excerpt":"[Submitted on 10 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"Every claim in the reading is supported by the abstract. The limitations are accurate and do not overreach: the abstract gives no latency figures, and the experiments are described as simulated. The reading also does not turn the benchmark results into a claim about real-world reliability.","excerpt":"Numerical benchmarks and simulated humanoid and quadrotor control experiments demonstrate reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified arXiv abstract page for this paper, which is the direct original source. No other source media was found.","excerpt":null}],"createdAt":"2026-11-11T23:17:11.124Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}