1 of 3 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; 1 failure 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/2104.08647.json · badge: /api/ran/2104.08647.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 |
|---|---|---|
| matanhasson/qdecomp_with_dependency_graphs | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| compare_performances | Ran ran; our contract draft was wrong, not the code |
matanhasson/qdecomp_with_dependency_graphs/evaluation/normal_form/normalized_graph_matcher.py pointer only (licence: NONE) · get_code("b01af934729434d1") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, matanhasson/qdecomp_with_dependency_graphs 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. |
| best | Not yet run unverified (harvested, no recorded run) |
matanhasson/qdecomp_with_dependency_graphs/scripts/train/run_experiments.py pointer only (licence: NONE) · get_code("9ef92999cca12e69") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, matanhasson/qdecomp_with_dependency_graphs 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. |
| eval | Not yet run unverified (harvested, no recorded run) |
matanhasson/qdecomp_with_dependency_graphs/scripts/train/run_experiments.py pointer only (licence: NONE) · get_code("646fd88886b2f30d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, matanhasson/qdecomp_with_dependency_graphs 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. |
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.
QDMR is a meaning representation for complex questions, which decomposes questions into a sequence of atomic steps. While state-of-the-art QDMR parsers use the common sequence-to-sequence (seq2seq) approach, a QDMR structure fundamentally describes labeled relations between spans in the input question, and thus dependency-based approaches seem appropriate for this task. In this work, we present a QDMR parser that is based on dependency graphs (DGs), where nodes in the graph are words and edges describe logical relations that correspond to the different computation steps. We propose (a) a non-autoregressive graph parser, where all graph edges are computed simultaneously, and (b) a seq2seq parser that uses gold graph as auxiliary supervision. We find that a graph parser leads to a moderate reduction in performance (0.47 to 0.44), but to a 16x speed-up in inference time due to the non-autoregressive nature of the parser, and to improved sample complexity compared to a seq2seq model. Second, a seq2seq model trained with auxiliary graph supervision has better generalization to new domains compared to a seq2seq model, and also performs better on questions with long sequences of computation steps.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.08647")
get_code_for_paper("2104.08647")
have("2104.08647")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.08647.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.08647)
Connect an agent — have() is free.