Sign inGet started
Paper · arXiv

Recipe-Matching, Not Equivalence

MathNet-Retrieve asks a retriever to find, for a math problem, a document stating the same problem. An LLM under one fixed prompt writes each gold document and its near-miss distractors; LLM judges filter them. We call this procedure the "recipe", training on pairs built the same way "recipe-matching", and ask how much score it buys beyond the ability the benchmark claims to test. Two models from one base, matched in rows and settings, differ only in the training file: pairs written under the benchmark's published prompt by another vendor's LLM and judge, or computer-algebra-verified pairs with no LLM anywhere. The first leads by 45 R@1 points on the easy tier. By a non-LLM paraphrase con...

AuthorsAli Habibullah, Mohammad Alshiekh, Yazan Alshoibi et al.
Primary categorycs.IR
Published25 September 2026
Last updated at source25 September 2026
cs.IRcs.CLcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/5013b4ca-44e9-421e-9f44-ba9d3ca5c166" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 5 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Connected in the knowledge graph

Explore this entry in the graph

Models and datasets referencing this paper

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 21 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.