None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2005.00789.json · badge: /api/ran/2005.00789.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| stonybrooknlp/dire | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| generate_probe_of_original_instance | Not yet run unverified (harvested, no recorded run) |
stonybrooknlp/dire/convert_datasets.py code served (permissive licence) · get_code("210075240b577d09") How it ranno invocation recorded. |
| generate_probe_of_transformed_instance | Not yet run unverified (harvested, no recorded run) |
stonybrooknlp/dire/convert_datasets.py code served (permissive licence) · get_code("670d1a114b2970d9") How it ranno invocation recorded. |
| generate_transformed_instance | Not yet run unverified (harvested, no recorded run) |
stonybrooknlp/dire/convert_datasets.py code served (permissive licence) · get_code("5b73e582edba7d4c") How it ranno invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Has there been real progress in multi-hop question-answering? Models often exploit dataset artifacts to produce correct answers, without connecting information across multiple supporting facts. This limits our ability to measure true progress and defeats the purpose of building multi-hop QA datasets. We make three contributions towards addressing this. First, we formalize such undesirable behavior as disconnected reasoning across subsets of supporting facts. This allows developing a model-agnostic probe for measuring how much any model can cheat via disconnected reasoning. Second, using a notion of \emph{contrastive support sufficiency}, we introduce an automatic transformation of existing datasets that reduces the amount of disconnected reasoning. Third, our experiments suggest that there hasn't been much progress in multi-hop QA in the reading comprehension setting. For a recent large-scale model (XLNet), we show that only 18 points out of its answer F1 score of 72 on HotpotQA are obtained through multifact reasoning, roughly the same as that of a simpler RNN baseline. Our transformation substantially reduces disconnected reasoning (19 points in answer F1). It is complementary to adversarial approaches, yielding further reductions in conjunction.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.00789")
get_code_for_paper("2005.00789")
have("2005.00789")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.00789.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.00789)
Connect an agent — have() is free.