Home › Code › load_runs

load_runs

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

load_runs appears in the code Syntology harvested for 11 papers, as 10 distinct code bodies found in 12 places (a place is one code body under one paper). Of the 11 papers, 6 with a sample that ran: 2 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument. 1 of the code bodies carries a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named load_runs do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 10 distinct code bodies named load_runs: 5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
3ran · our draft was wrong
0ran; the contract check could not run
2ran
5unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 1 of the 12 places is pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

11 papers shown of 11, newest first; 12 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
When Can You Trust Offline Evaluation of Equal-Cost Top-k Allocation? A Controlled, Reproducible Benchmark and Practitioner's Guide added by Syntology 2026-08 (from id) binshuangli/allocation-ope-bench/src/allocation_ope_bench/analysis/misspec.py 22f69fd6c8d729de ran · our draft was wrong MIT (permissive)
On the Probability of First Success in Differential Evolution: Hazard Identities and Tail Bounds added by Syntology 2026-01 (from id) snenovgmailcom/lshade_hazard_project/analysis/plot_quasi_morse.py a9db344bcccc8706 ran MIT (permissive)
Non-Determinism of "Deterministic" LLM Settings 6 Aug 2024 Comcast/llm-stability/evaluate.py 151e9739708eb70c ran · our draft was wrong fingerprinted Apache-2.0 (permissive)
Non-Determinism of "Deterministic" LLM Settings 6 Aug 2024 breckbaldwin/llm-stability/evaluate.py 2aa869fcf2a593c3 unverified Apache-2.0 (permissive)
Learning Robust Dynamics through Variational Sparse Gating 21 Oct 2022 arnavkj1995/vsg/plotting.py 151b79dfa34b9b00 unverified MIT (permissive)
TransDreamer: Reinforcement Learning with Transformer World Models 19 Feb 2022 danijar/crafter/analysis/common.py 75a8133b273fb929 ran MIT (permissive)
DreamerPro: Reconstruction-Free Model-Based Reinforcement Learning with Prototypical Representations 27 Oct 2021 fdeng18/dreamer-pro/Dreamer/common/plot.py 4878c13e37288f19 unverified MIT (permissive)
Mr. TyDi: A Multi-lingual Benchmark for Dense Retrieval 19 Aug 2021 identical code first harvested elsewhere 8735894f4e3d26ec ran · our draft was wrong licence of this copy not recorded
Temporal Predictive Coding For Model-Based Planning In Latent Space 14 Jun 2021 VinAIResearch/TPC-tensorflow/plotting.py e6df7a3762e59661 unverified MIT (permissive)
Mastering Atari with Discrete World Models 5 Oct 2020 iglu-contest/iglu-builder-baseline-dreamer/common/plot.py 4878c13e37288f19 unverified MIT (permissive)
TyDi QA: A Benchmark for Information-Seeking Question Answering in Typologically Diverse Languages 10 Mar 2020 castorini/mr.tydi/scripts/hybrid.py 8735894f4e3d26ec ran · our draft was wrong Apache-2.0 (permissive)
Dream to Control: Learning Behaviors by Latent Imagination 3 Dec 2019 danijar/dreamer/plotting.py 6dd3eb82ea8db085 unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections