U Berkeley, Sergey Levine, Mohammad Norouzi, Ziyu Wang, Alexander Novikov, Tom Le Paine, Cosmin Paduraru, Michael Zhang, Ofir Nachum, Aviral Kumar, Justin Fu, George Tucker, and 2 more
3 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; 3 failures of our instrument; 0 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/2103.16596.json · badge: /api/ran/2103.16596.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 |
|---|---|---|
| tedmoskovitz/DOPE | canonical (classifier label) classifier basis: census |
1 ran · 0 no recorded run |
| tedmoskovitz/TOP | reimplementation (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| calculate_huber_loss | Ran ran; our contract draft was wrong, not the code |
tedmoskovitz/TOP/dmc/top_curl_sac.py pointer only (licence: NONE) · get_code("5bb744e06e0b22f8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, tedmoskovitz/TOP 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. |
| calculate_quantile_huber_loss | Ran ran; our contract draft was wrong, not the code |
tedmoskovitz/TOP/dmc/top_curl_sac.py pointer only (licence: NONE) · get_code("c01f6250c42168bc") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, tedmoskovitz/TOP 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. |
| gaussian_logprob | Ran ran; our contract draft was wrong, not the code |
tedmoskovitz/DOPE/dmc/top_curl_sac.py pointer only (licence: NONE) · get_code("daa7b3a0355eb7c3") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, tedmoskovitz/DOPE 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. |
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, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 later) and 2 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 |
|---|---|---|---|
| gaussian_logprob | 15 other papers 8 dated earlier, 7 later · 3 only as an assembly brick |
1910.01741 (2019-10) Improving Sample Efficiency in Model-Free Reinforcement Learning from Images |
2004.04136 (2020-04) CURL: Contrastive Unsupervised Representations for Reinforcement Learning 2004.14990 (2020-04) Reinforcement Learning with Augmented Data and 12 more not named here |
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.
Off-policy evaluation (OPE) holds the promise of being able to leverage large, offline datasets for both evaluating and selecting complex policies for decision making. The ability to learn offline is particularly important in many real-world domains, such as in healthcare, recommender systems, or robotics, where online data collection is an expensive and potentially dangerous process. Being able to accurately evaluate and select high-performing policies without requiring online interaction could yield significant benefits in safety, time, and cost for these applications. While many OPE methods have been proposed in recent years, comparing results between papers is difficult because currently there is a lack of a comprehensive and unified benchmark, and measuring algorithmic progress has been challenging due to the lack of difficult evaluation tasks. In order to address this gap, we present a collection of policies that in conjunction with existing offline datasets can be used for benchmarking off-policy evaluation. Our tasks include a range of challenging high-dimensional continuous control problems, with wide selections of datasets and policies for performing policy selection. The goal of our benchmark is to provide a standardized measure of progress that is motivated from a set of principles designed to challenge and test the limits of existing OPE methods. We perform an evaluation of state-of-the-art algorithms and provide open-source access to our data and code to foster future research in this area † . * Equally major contributors. † Policies and evaluation code are available at https://github.com/google-research/deep_ ope. See Section 5 for links to modelling code.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2103.16596")
get_code_for_paper("2103.16596")
have("2103.16596")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2103.16596.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2103.16596)
Connect an agent — have() is free.