Mohamad Danesh, Anurag Koul, Alan Fern, Saeed Khorram
None of the 1 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (1 no recorded run), measured 2026-11-22; 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/2006.03745.json · badge: /api/ran/2006.03745.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 |
|---|---|---|
| modanesh/differential_ig | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| mask_diff_ig | Not yet run unverified (harvested, no recorded run) |
modanesh/differential_ig/integrated_gradients.py pointer only (licence: NONE) · get_code("2507b0f4081f22b6") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, modanesh/differential_ig 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 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 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 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.
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.
We introduce an approach for understanding control policies represented as recurrent neural networks. Recent work has approached this problem by transforming such recurrent policy networks into finite-state machines (FSM) and then analyzing the equivalent minimized FSM. While this led to interesting insights, the minimization process can obscure a deeper understanding of a machine's operation by merging states that are semantically distinct. To address this issue, we introduce an analysis approach that starts with an unminimized FSM and applies more-interpretable reductions that preserve the key decision points of the policy. We also contribute an attention tool to attain a deeper understanding of the role of observations in the decisions. Our case studies on 7 Atari games and 3 control benchmarks demonstrate that the approach can reveal insights that have not been previously noticed.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.03745")
get_code_for_paper("2006.03745")
have("2006.03745")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.03745.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.03745)
Connect an agent — have() is free.