{"id":"67e8d16d38d29a0454ee192ac24072e8ecfe2382ba5ebb1fdbdfb567794cccc5","title":"Milios and Pal propose a small-model “scout” for routing queries","argument":"In their paper, Aristides Milios and Christopher Pal propose using the prefill activations of a small, frozen language model—the “scout”—to predict both whether candidate models will succeed and how many output tokens they will use. A router can then choose a model per query using estimated success and cost, rather than pricing every query as though it had the same output length. The authors argue that this distinction matters especially for reasoning models, whose output lengths vary widely. In their experiments, predicted costs reduced spending by 9–33% at matched accuracy on eight of nine datasets, compared with pricing based on median output length. The reported savings reached up to 69% of the savings possible with perfect per-query cost knowledge. The abstract says output length tracks problem difficulty on most math and code datasets, but not on knowledge and mixed-format datasets; there, predicting success alone estimated cost less well than a probe trained on length. The authors also report that a length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks. Savings stopped growing at about a 2B scout; above 4B, the authors say, the larger scout cost more than it added. These are reported benchmark results, not evidence in the abstract about performance in deployed routing systems.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The supplied source text gives the abstract but not the paper's detailed experimental setup or the identities of the nine datasets. The abstract reports benchmark savings; it does not report performance in a deployed routing system.","speaker":{"name":"Milios, Aristides, Pal, Christopher","roleAtSource":"Article author"},"source":{"title":"Scout Before You Route: Predicting Task Success and Token Count from a Small LLM Prefill","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.09028","publishedAt":"2026-11-06","dateBasis":"Date basis not provided."},"evidence":[{"text":"Milios and Pal propose predicting candidate-model success probability and output length from the prefill activations of one small, frozen LLM.","excerpt":"We predict both the success probability and the output length of candidate models from the prefill activations of a single small frozen LLM, the scout.","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"On eight of nine datasets, the authors report that predicted costs reduced spending by 9–33% at matched accuracy compared with median-length pricing.","excerpt":"On those eight datasets, our predicted costs save 9-33% at matched accuracy relative to median-length pricing","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"The authors report that output length tracks problem difficulty on most math and code datasets, while predicted success estimates cost less effectively on knowledge and mixed-format datasets.","excerpt":"On most math and code datasets, harder problems are longer, so predicted success alone prices cost nearly as well. On knowledge and mixed-format datasets they are not","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"The abstract reports that the length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks.","excerpt":"The probe keeps most of its saving with 20 labelled problems and transfers without labels to four of seven new benchmarks.","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"The authors report that savings stop growing at about a 2B scout, and that above 4B a larger scout costs more than it adds.","excerpt":"Savings stop growing at about a 2B scout, so above 4B a larger scout costs more than it adds.","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.09028","checkedAt":"2026-11-13T15:08:09.068Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How would the reported cost savings change when the scout and candidate models route queries in a deployed system?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Milios and Pal propose a small-model “scout” for routing queries","summary":"In their paper, Aristides Milios and Christopher Pal propose using the prefill activations of a small, frozen language model—the “scout”—to predict both whether candidate models will succeed and how many output tokens they will use. A router can then choose a model per query using estimated success and cost, rather than pricing every query as though it had the same output length. The authors argue that this distinction matters especially for reasoning models, whose output lengths vary widely. In their experiments, predicted costs reduced spending by 9–33% at matched accuracy on eight of nine datasets, compared with pricing based on median output length. The reported savings reached up to 69% of the savings possible with perfect per-query cost knowledge. The abstract says output length tracks problem difficulty on most math and code datasets, but not on knowledge and mixed-format datasets; there, predicting success alone estimated cost less well than a probe trained on length. The authors also report that a length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks. Savings stopped growing at about a 2B scout; above 4B, the authors say, the larger scout cost more than it added. These are reported benchmark results, not evidence in the abstract about performance in deployed routing systems.","question":"How would the reported cost savings change when the scout and candidate models route queries in a deployed system?","claims":[{"text":"Milios and Pal propose predicting candidate-model success probability and output length from the prefill activations of one small, frozen LLM.","excerpt":"We predict both the success probability and the output length of candidate models from the prefill activations of a single small frozen LLM, the scout.","support":"source-stated"},{"text":"On eight of nine datasets, the authors report that predicted costs reduced spending by 9–33% at matched accuracy compared with median-length pricing.","excerpt":"On those eight datasets, our predicted costs save 9-33% at matched accuracy relative to median-length pricing","support":"source-stated"},{"text":"The authors report that output length tracks problem difficulty on most math and code datasets, while predicted success estimates cost less effectively on knowledge and mixed-format datasets.","excerpt":"On most math and code datasets, harder problems are longer, so predicted success alone prices cost nearly as well. On knowledge and mixed-format datasets they are not","support":"source-stated"},{"text":"The abstract reports that the length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks.","excerpt":"The probe keeps most of its saving with 20 labelled problems and transfers without labels to four of seven new benchmarks.","support":"source-stated"},{"text":"The authors report that savings stop growing at about a 2B scout, and that above 4B a larger scout costs more than it adds.","excerpt":"Savings stop growing at about a 2B scout, so above 4B a larger scout costs more than it adds.","support":"source-stated"}],"limitations":["The supplied source text gives the abstract but not the paper's detailed experimental setup or the identities of the nine datasets.","The abstract reports benchmark savings; it does not report performance in a deployed routing system."],"mediaId":"9a35445199f8ce95fa2b4ae77cc26c3ca7ecf75ae763e48e6851efb72f48c10d","correctionReason":null,"id":"67e8d16d38d29a0454ee192ac24072e8ecfe2382ba5ebb1fdbdfb567794cccc5","publicationId":"61a9a780-5be5-494c-8ae0-5a9db68a6552","version":1,"sourceUrl":"https://arxiv.org/abs/2611.09028","sourceTitle":"Scout Before You Route: Predicting Task Success and Token Count from a Small LLM Prefill","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-06","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-09T05:07:02.544Z","createdAt":"2026-11-12T22:05:52.318Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"9a35445199f8ce95fa2b4ae77cc26c3ca7ecf75ae763e48e6851efb72f48c10d","kind":"article","url":"https://arxiv.org/abs/2611.09028","sourceUrl":"https://arxiv.org/abs/2611.09028","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-12T22:04:36.117Z","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.09028","checkedAt":"2026-11-13T15:08:09.068Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v6","mediaId":"9a35445199f8ce95fa2b4ae77cc26c3ca7ecf75ae763e48e6851efb72f48c10d","confidence":0.56,"provider":"typesafe","model":"jev-1.13.0","inputHash":"5b8f875833a9189ee8725d4ae3aa33d9c712e06fd8b9990a765bbf8b96bb1c36","decidedAt":"2026-11-12T22:04:39.105Z"},"provenance":{"textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observationId":"c388622665dd805d93aa843f5f531eb1bf0bd3d31248ff5b34ad038c9d0f68bb","retrievedAt":"2026-11-12T22:04:35.738Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"d1c3d1a4-eb61-4cea-8783-296aaeef3e7c"},"reviewer":{"model":"gpt-6-luna","runId":"22a26d1a-ba88-44bf-873b-23fefd8a2f8c"}},"audit":{"status":"passed","reviewedAt":"2026-11-12T22:05:52.318Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Milios, Aristides","url":null,"kind":"unknown"},{"name":"Pal, Christopher","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Milios, Aristides","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Milios, Aristides","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.09028","locator":"head/meta[name=author|citation_author]"},"assertionId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-13T15:08:09.068Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59","sourceUrl":"https://arxiv.org/abs/2611.09028","contentSha256":"9d1c8973e00b0d76b9b73f3782a5df3dc524c61cb0c93b86db043d9a8c5d1148","textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observedAt":"2026-11-13T15:08:09.068Z"}},{"actor":{"name":"Pal, Christopher","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Pal, Christopher","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.09028","locator":"head/meta[name=author|citation_author]"},"assertionId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-13T15:08:09.068Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59","sourceUrl":"https://arxiv.org/abs/2611.09028","contentSha256":"9d1c8973e00b0d76b9b73f3782a5df3dc524c61cb0c93b86db043d9a8c5d1148","textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observedAt":"2026-11-13T15:08:09.068Z"}}],"participationCoverage":{"total":2,"returned":2,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.09028","snapshotId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59","contentSha256":"9d1c8973e00b0d76b9b73f3782a5df3dc524c61cb0c93b86db043d9a8c5d1148","textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observedAt":"2026-11-13T15:08:09.068Z","basis":"publisher-page-metadata","sourceLinks":41,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/67e8d16d38d29a0454ee192ac24072e8ecfe2382ba5ebb1fdbdfb567794cccc5/source"}},"canonicalUrl":"https://escapemeridian.com/readings/milios-and-pal-propose-a-small-model-scout-for-routing-queries-67e8d16d","formats":{"html":"/readings/milios-and-pal-propose-a-small-model-scout-for-routing-queries-67e8d16d","markdown":"/readings/milios-and-pal-propose-a-small-model-scout-for-routing-queries-67e8d16d.md","json":"/readings/milios-and-pal-propose-a-small-model-scout-for-routing-queries-67e8d16d.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":[],"conditions":[],"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-tokens","name":"Model tokens","explanation":"Small chunks of text, often parts of words, that a language model reads and writes; usage and prices are often counted in tokens.","referenceUrl":"https://developers.google.com/machine-learning/glossary#token"},{"id":"term-reasoning-model","name":"Reasoning model","explanation":"A language model trained to work through a problem in written steps before it answers.","referenceUrl":"https://en.wikipedia.org/wiki/Reasoning_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":"67e8d16d38d29a0454ee192ac24072e8ecfe2382ba5ebb1fdbdfb567794cccc5","revision":"61a9a780-5be5-494c-8ae0-5a9db68a6552","revisionKind":"publication-id","title":"Milios and Pal propose a small-model “scout” for routing queries","url":"https://escapemeridian.com/readings/milios-and-pal-propose-a-small-model-scout-for-routing-queries-67e8d16d"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.09028","revision":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","revisionKind":"sha256-source-text","title":"Scout Before You Route: Predicting Task Success and Token Count from a Small LLM Prefill","url":"https://arxiv.org/abs/2611.09028"},"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":"67e8d16d38d29a0454ee192ac24072e8ecfe2382ba5ebb1fdbdfb567794cccc5","title":"Milios and Pal propose a small-model “scout” for routing queries","argument":"In their paper, Aristides Milios and Christopher Pal propose using the prefill activations of a small, frozen language model—the “scout”—to predict both whether candidate models will succeed and how many output tokens they will use. A router can then choose a model per query using estimated success and cost, rather than pricing every query as though it had the same output length. The authors argue that this distinction matters especially for reasoning models, whose output lengths vary widely. In their experiments, predicted costs reduced spending by 9–33% at matched accuracy on eight of nine datasets, compared with pricing based on median output length. The reported savings reached up to 69% of the savings possible with perfect per-query cost knowledge. The abstract says output length tracks problem difficulty on most math and code datasets, but not on knowledge and mixed-format datasets; there, predicting success alone estimated cost less well than a probe trained on length. The authors also report that a length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks. Savings stopped growing at about a 2B scout; above 4B, the authors say, the larger scout cost more than it added. These are reported benchmark results, not evidence in the abstract about performance in deployed routing systems.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The supplied source text gives the abstract but not the paper's detailed experimental setup or the identities of the nine datasets. The abstract reports benchmark savings; it does not report performance in a deployed routing system.","speaker":{"name":"Milios, Aristides, Pal, Christopher","roleAtSource":"Article author"},"source":{"title":"Scout Before You Route: Predicting Task Success and Token Count from a Small LLM Prefill","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.09028","publishedAt":"2026-11-06","dateBasis":"Date basis not provided."},"evidence":[{"text":"Milios and Pal propose predicting candidate-model success probability and output length from the prefill activations of one small, frozen LLM.","excerpt":"We predict both the success probability and the output length of candidate models from the prefill activations of a single small frozen LLM, the scout.","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"On eight of nine datasets, the authors report that predicted costs reduced spending by 9–33% at matched accuracy compared with median-length pricing.","excerpt":"On those eight datasets, our predicted costs save 9-33% at matched accuracy relative to median-length pricing","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"The authors report that output length tracks problem difficulty on most math and code datasets, while predicted success estimates cost less effectively on knowledge and mixed-format datasets.","excerpt":"On most math and code datasets, harder problems are longer, so predicted success alone prices cost nearly as well. On knowledge and mixed-format datasets they are not","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"The abstract reports that the length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks.","excerpt":"The probe keeps most of its saving with 20 labelled problems and transfers without labels to four of seven new benchmarks.","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"},{"text":"The authors report that savings stop growing at about a 2B scout, and that above 4B a larger scout costs more than it adds.","excerpt":"Savings stop growing at about a 2B scout, so above 4B a larger scout costs more than it adds.","url":"https://arxiv.org/abs/2611.09028","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.09028","checkedAt":"2026-11-13T15:08:09.068Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How would the reported cost savings change when the scout and candidate models route queries in a deployed system?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Milios and Pal propose a small-model “scout” for routing queries","summary":"In their paper, Aristides Milios and Christopher Pal propose using the prefill activations of a small, frozen language model—the “scout”—to predict both whether candidate models will succeed and how many output tokens they will use. A router can then choose a model per query using estimated success and cost, rather than pricing every query as though it had the same output length. The authors argue that this distinction matters especially for reasoning models, whose output lengths vary widely. In their experiments, predicted costs reduced spending by 9–33% at matched accuracy on eight of nine datasets, compared with pricing based on median output length. The reported savings reached up to 69% of the savings possible with perfect per-query cost knowledge. The abstract says output length tracks problem difficulty on most math and code datasets, but not on knowledge and mixed-format datasets; there, predicting success alone estimated cost less well than a probe trained on length. The authors also report that a length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks. Savings stopped growing at about a 2B scout; above 4B, the authors say, the larger scout cost more than it added. These are reported benchmark results, not evidence in the abstract about performance in deployed routing systems.","question":"How would the reported cost savings change when the scout and candidate models route queries in a deployed system?","claims":[{"text":"Milios and Pal propose predicting candidate-model success probability and output length from the prefill activations of one small, frozen LLM.","excerpt":"We predict both the success probability and the output length of candidate models from the prefill activations of a single small frozen LLM, the scout.","support":"source-stated"},{"text":"On eight of nine datasets, the authors report that predicted costs reduced spending by 9–33% at matched accuracy compared with median-length pricing.","excerpt":"On those eight datasets, our predicted costs save 9-33% at matched accuracy relative to median-length pricing","support":"source-stated"},{"text":"The authors report that output length tracks problem difficulty on most math and code datasets, while predicted success estimates cost less effectively on knowledge and mixed-format datasets.","excerpt":"On most math and code datasets, harder problems are longer, so predicted success alone prices cost nearly as well. On knowledge and mixed-format datasets they are not","support":"source-stated"},{"text":"The abstract reports that the length probe retained most of its savings with 20 labelled problems and transferred without labels to four of seven new benchmarks.","excerpt":"The probe keeps most of its saving with 20 labelled problems and transfers without labels to four of seven new benchmarks.","support":"source-stated"},{"text":"The authors report that savings stop growing at about a 2B scout, and that above 4B a larger scout costs more than it adds.","excerpt":"Savings stop growing at about a 2B scout, so above 4B a larger scout costs more than it adds.","support":"source-stated"}],"limitations":["The supplied source text gives the abstract but not the paper's detailed experimental setup or the identities of the nine datasets.","The abstract reports benchmark savings; it does not report performance in a deployed routing system."],"mediaId":"9a35445199f8ce95fa2b4ae77cc26c3ca7ecf75ae763e48e6851efb72f48c10d","correctionReason":null,"id":"67e8d16d38d29a0454ee192ac24072e8ecfe2382ba5ebb1fdbdfb567794cccc5","publicationId":"61a9a780-5be5-494c-8ae0-5a9db68a6552","version":1,"sourceUrl":"https://arxiv.org/abs/2611.09028","sourceTitle":"Scout Before You Route: Predicting Task Success and Token Count from a Small LLM Prefill","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-06","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-09T05:07:02.544Z","createdAt":"2026-11-12T22:05:52.318Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"9a35445199f8ce95fa2b4ae77cc26c3ca7ecf75ae763e48e6851efb72f48c10d","kind":"article","url":"https://arxiv.org/abs/2611.09028","sourceUrl":"https://arxiv.org/abs/2611.09028","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-12T22:04:36.117Z","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.09028","checkedAt":"2026-11-13T15:08:09.068Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v6","mediaId":"9a35445199f8ce95fa2b4ae77cc26c3ca7ecf75ae763e48e6851efb72f48c10d","confidence":0.56,"provider":"typesafe","model":"jev-1.13.0","inputHash":"5b8f875833a9189ee8725d4ae3aa33d9c712e06fd8b9990a765bbf8b96bb1c36","decidedAt":"2026-11-12T22:04:39.105Z"},"provenance":{"textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observationId":"c388622665dd805d93aa843f5f531eb1bf0bd3d31248ff5b34ad038c9d0f68bb","retrievedAt":"2026-11-12T22:04:35.738Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"d1c3d1a4-eb61-4cea-8783-296aaeef3e7c"},"reviewer":{"model":"gpt-6-luna","runId":"22a26d1a-ba88-44bf-873b-23fefd8a2f8c"}},"audit":{"status":"passed","reviewedAt":"2026-11-12T22:05:52.318Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Milios, Aristides","url":null,"kind":"unknown"},{"name":"Pal, Christopher","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Milios, Aristides","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Milios, Aristides","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.09028","locator":"head/meta[name=author|citation_author]"},"assertionId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-13T15:08:09.068Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59","sourceUrl":"https://arxiv.org/abs/2611.09028","contentSha256":"9d1c8973e00b0d76b9b73f3782a5df3dc524c61cb0c93b86db043d9a8c5d1148","textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observedAt":"2026-11-13T15:08:09.068Z"}},{"actor":{"name":"Pal, Christopher","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Pal, Christopher","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.09028","locator":"head/meta[name=author|citation_author]"},"assertionId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-13T15:08:09.068Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59","sourceUrl":"https://arxiv.org/abs/2611.09028","contentSha256":"9d1c8973e00b0d76b9b73f3782a5df3dc524c61cb0c93b86db043d9a8c5d1148","textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observedAt":"2026-11-13T15:08:09.068Z"}}],"participationCoverage":{"total":2,"returned":2,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.09028","snapshotId":"770e6bb356a75efd74d54ea72809311706b430eff42188912dab79df38568d59","contentSha256":"9d1c8973e00b0d76b9b73f3782a5df3dc524c61cb0c93b86db043d9a8c5d1148","textHash":"15662cde9e60be440ae9d423fbe4934f077cf960df1d78e42e33e7ad0da84f6a","observedAt":"2026-11-13T15:08:09.068Z","basis":"publisher-page-metadata","sourceLinks":41,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/67e8d16d38d29a0454ee192ac24072e8ecfe2382ba5ebb1fdbdfb567794cccc5/source"}}}],"audits":[{"publicationId":"61a9a780-5be5-494c-8ae0-5a9db68a6552","verdict":"passed","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading correctly attributes the paper and its proposals to Aristides Milios and Christopher Pal, the listed authors. Results are framed as the authors' reported findings, not as established facts.","excerpt":"Authors:Aristides Milios, Christopher Pal"},{"dimension":"summary","status":"pass","explanation":"The title, summary and question match the abstract: a small frozen scout LLM predicts success and output length, with reported savings, the difficulty–length pattern, label efficiency, transfer and scout-size limits. The router concept is explained in plain terms. Technical terms such as prefill activations, probe and 2B are kept exactly and suit tooltips. Two small repairs: 'less well' softens the source's 'well behind'; 'falls well behind' would restore its force. The 22% mixture result and the stronger-than-baselines comparison are omitted, but this does not distort the reading.","excerpt":"On knowledge and mixed-format datasets they are not, and predicted success falls well behind a probe trained on length."},{"dimension":"date","status":"pass","explanation":"The originalPublished date of 2026-11-06 matches the v1 submission date on arXiv. The later feed date of November 9 is not used.","excerpt":"[Submitted on 6 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"Each claim has a verbatim excerpt and is stated as reported by the source. The reading explicitly says these are benchmark results, not evidence about deployed systems, which keeps the gap between test results and real-world use. The question is an open issue that follows from the evidence rather than a leading claim. No benefits or costs are invented.","excerpt":"On those eight datasets, our predicted costs save 9-33% at matched accuracy relative to median-length pricing, up to 69% of what perfect knowledge would save."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct link to the original arXiv abstract page, which matches the source URL. It is the most direct way to reach the source.","excerpt":null}],"createdAt":"2026-11-12T22:05:52.318Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}