mlsanityData to 14 Oct 2026

When Evidence Changes the Subject: Subject-Typed Claim Licensing for Learned Routing

arXiv 2609.33505 ↗First posted 27 Sep 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Modern learned systems increasingly combine learned components with search, repair, or external solvers. Benchmarks often measure the resulting end-to-end system, while scientific claims may concern only one component, creating an attribution problem: evidence can fail to support the requested component-level claim while still supporting a positive conclusion about the larger system. Existing evidence-to-claim methods primarily calibrate claim strength. We argue that composite systems require a second dimension: scientific subject. We address this problem with subject-typed claim licensing, which separates weaker conclusions about the requested subject from positive but non-substitutive credit about another subject. We instantiate this idea in SCOPE-Routing for preference-conditioned multigraph routing. Non-authors reproducibly apply the declared semantics; held-out review yields fewer reference-relative upward deviations than unstructured review, while the difference from a strong evidence checklist remains unresolved; and a controlled routing study shows that score-optimal and claim-eligible methods can differ while valid hybrid-system credit is preserved. These results motivate treating claim strength and scientific subject as distinct dimensions of evidence-based evaluation.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 48 references that are in the map. First posted on arXiv 27 Sep 2026.

Builds on

37 of 48 references.

References · 37

  1. 2018Datasheets for Datasetscited by 1,386
  2. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
  3. 2018Model Cards for Model Reportingcited by 1,080
  4. 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 1,006
  5. 2018Attention, Learn to Solve Routing Problems!cited by 656
  6. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
  7. 2021Dynabench: Rethinking Benchmarking in NLPcited by 459
  8. 2017Smart "Predict, then Optimize"cited by 339
  9. 2020Improving Reproducibility in Machine Learning Research (A Report from the NeurIPS 2019 Reproducibility Program)cited by 322
  10. 2024MiniCheck: Efficient Fact-Checking of LLMs on Grounding Documentscited by 257
  11. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 227
  12. 2019Show Your Work: Improved Reporting of Experimental Resultscited by 169
25 more
  1. 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 130
  2. 2025Measuring what Matters: Construct Validity in Large Language Model Benchmarkscited by 119
  3. 2024BetterBench: Assessing AI Benchmarks, Uncovering Issues, and Establishing Best Practicescited by 114
  4. 2021Learning to Delegate for Large-scale Vehicle Routingcited by 109
  5. 2021Implicit MLE: Backpropagating Through Discrete Exponential Family Distributionscited by 98
  6. 2024Croissant: A Metadata Format for ML-Ready Datasetscited by 81
  7. 2025Measurement to Meaning: A Validity-Centered Framework for AI Evaluationcited by 57
  8. 2024FinTextQA: A Dataset for Long-form Financial Question Answeringcited by 54
  9. 2025CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimizationcited by 29
  10. 2025Destroy and Repair Using Hyper Graphs for Routingcited by 14
  11. 2025The Benchmarking Epistemology: Validity Theory for Evaluating Machine Learning Modelscited by 13
  12. 2025FrontierCO: Real-World and Large-Scale Evaluation of Machine Learning Solvers for Combinatorial Optimizationcited by 11
  13. 2024BenchmarkCards: Standardized Documentation for Large Language Model Benchmarkscited by 10
  14. 2025Matter-of-Fact: A Benchmark for Verifying the Feasibility of Literature-Supported Claims in Materials Sciencecited by 9
  15. 2025Multi-Task Vehicle Routing Solver via Mixture of Specialized Experts under State-Decomposable MDPcited by 7
  16. 2024DataSP: A Differential All-to-All Shortest Path Algorithm for Learning Costs and Predicting Paths with Contextcited by 6
  17. 2025Compliance-to-Code: Enhancing Financial Compliance Checking via Code Generationcited by 4
  18. 2026RIGOURATE: Quantifying Scientific Exaggeration with Evidence-Aligned Claim Evaluationcited by 3
  19. 2026The Calibration Turn in AI-Assisted Research: A Conceptual and Methodological Framework for Evidence-Licensed Claimscited by 3
  20. 2024Newton Losses: Using Curvature Information for Learning with Differentiable Algorithmscited by 2
  21. 2025SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problemcited by 2
  22. 2025Beyond Simple Graphs: Neural Multi-Objective Routing on Multigraphscited by 2
  23. 2026FactReview: Evidence-Grounded Peer Review with Execution-Based Claim Verificationcited by 2
  24. 2025DeKeyNLU: Enhancing Natural Language to SQL Generation through Task Decomposition and Keyword Extractioncited by 1
  25. 2026From Statute to Control Flow: Span-Grounded Deontic Trees for Defeasible Scope Parsingcited by 1

Built on by

Not cited yet.