2 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 2 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/2102.08633.json · badge: /api/ran/2102.08633.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 |
|---|---|---|
| kevinsrr/unicmr | reimplementation (classifier label) classifier basis: classifier_2025 |
1 ran · 1 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_mapping | Ran ran; our contract draft was wrong, not the code |
kevinsrr/unicmr/discourse_seg/open_sharc_discourse_segmentation.py pointer only (licence: NONE) · get_code("2ab4f2c4b3d885cd") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, kevinsrr/unicmr when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| load_passages | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from luyug/GC-DPR pointer only; the stored copy get_code serves, from luyug/GC-DPR, is pointer only (licence: NOASSERTION) · get_code("3e65fdbefb42a546") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| fetch_text | Not yet run unverified (harvested, no recorded run) |
kevinsrr/unicmr/retriever/build_tfidf.py pointer only (licence: NONE) · get_code("33c6fb2a636e2a0b") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, kevinsrr/unicmr when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| tokenize | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from yairf11/MUPPET pointer only; the stored copy get_code serves, from yairf11/MUPPET, is pointer only (licence: NOASSERTION) · get_code("77535ec3fc559506") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 later) and 1 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| load_passages | 4 other papers 1 dated earlier, 3 later |
2101.06983 (2021-01) Scaling Deep Contrastive Learning Batch Size under Memory Limited Setup |
2023.findings-emnlp.957 (2023 (year only)) An Empirical Investigation of Implicit and Explicit Knowledge-Enhanced Methods for Ad Hoc Dataset Retrieval 2024.findings-acl.708 (2024 (year only)) Analyze, Generate and Refine: Query Expansion with LLMs for Zero-Shot Open-Domain QA and 1 more not named here |
| tokenize | 4 other papers 2 dated earlier, 1 later, 1 same year, order not determinable |
1906.06606 (2019-06) Multi-Hop Paragraph Retrieval for Open-Domain Question Answering |
1911.02896 (2019-11) Contextualized Sparse Representations for Real-Time Open-Domain Question Answering 2021.acl-long.164 (2021 (year only)) BERTAC: Enhancing Transformer-based Language Models with Adversarially Pretrained Convolutional Neural Networks and 1 more not named here |
| fetch_text | 3 other papers 1 dated earlier, 2 later |
2010.10439 (2020-10) Open Question Answering over Tables and Text |
2310.09754 (2023-10) EX-FEVER: A Dataset for Multi-hop Explainable Fact Verification 2311.03734 (2023-11) Leveraging Structured Information for Explainable Multi-hop Question Answering and Reasoning |
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.
In conversational machine reading, systems need to interpret natural language rules, answer high-level questions such as "May I qualify for VA health care benefits?", and ask follow-up clarification questions whose answer is necessary to answer the original question. However, existing works assume the rule text is provided for each user question, which neglects the essential retrieval step in real scenarios. In this work, we propose and investigate an open-retrieval setting of conversational machine reading. In the open-retrieval setting, the relevant rule texts are unknown so that a system needs to retrieve question-relevant evidence from a collection of rule texts, and answer users' high-level questions according to multiple retrieved rule texts in a conversational manner. We propose MUDERN, a Multi-passage Discourse-aware Entailment Reasoning Network which extracts conditions in the rule texts through discourse segmentation, conducts multi-passage entailment reasoning to answer user questions directly, or asks clarification follow-up questions to inquiry more information. On our created OR-ShARC dataset, MUDERN achieves the state-of-the-art performance, outperforming existing single-passage conversational machine reading models as well as a new multi-passage conversational machine reading baseline by a large margin. In addition, we conduct in-depth analyses to provide new insights into this new setting and our model.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.08633")
get_code_for_paper("2102.08633")
have("2102.08633")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.08633.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.08633)
Connect an agent — have() is free.