{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/load-runs","entry":"load_runs","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":10,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2608.12489","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-12489","title":"When Can You Trust Offline Evaluation of Equal-Cost Top-k Allocation? A Controlled, Reproducible Benchmark and Practitioner's Guide","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"binshuangli/allocation-ope-bench","path":"src/allocation_ope_bench/analysis/misspec.py","file_url":"https://github.com/binshuangli/allocation-ope-bench/blob/HEAD/src/allocation_ope_bench/analysis/misspec.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22f69fd6c8d729de","code_sha256_prefix":"22f69fd6c8d729de","mcp_get_code":{"code_sha256":"22f69fd6c8d729de"}},{"arxiv_id":"2601.11499","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11499","title":"On the Probability of First Success in Differential Evolution: Hazard Identities and Tail Bounds","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"snenovgmailcom/lshade_hazard_project","path":"analysis/plot_quasi_morse.py","file_url":"https://github.com/snenovgmailcom/lshade_hazard_project/blob/HEAD/analysis/plot_quasi_morse.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9db344bcccc8706","code_sha256_prefix":"a9db344bcccc8706","mcp_get_code":{"code_sha256":"a9db344bcccc8706"}},{"arxiv_id":"2408.04667","arxiv_id_is_arxiv":true,"paper":"/paper/llm-stability-a-detailed-analysis-with-some","title":"Non-Determinism of \"Deterministic\" LLM Settings","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Comcast/llm-stability","path":"evaluate.py","file_url":"https://github.com/Comcast/llm-stability/blob/HEAD/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"151e9739708eb70c","code_sha256_prefix":"151e9739708eb70c","mcp_get_code":{"code_sha256":"151e9739708eb70c"}},{"arxiv_id":"2408.04667","arxiv_id_is_arxiv":true,"paper":"/paper/llm-stability-a-detailed-analysis-with-some","title":"Non-Determinism of \"Deterministic\" LLM Settings","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"breckbaldwin/llm-stability","path":"evaluate.py","file_url":"https://github.com/breckbaldwin/llm-stability/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2aa869fcf2a593c3","code_sha256_prefix":"2aa869fcf2a593c3","mcp_get_code":{"code_sha256":"2aa869fcf2a593c3"}},{"arxiv_id":"2210.11698","arxiv_id_is_arxiv":true,"paper":"/paper/learning-robust-dynamics-through-variational","title":"Learning Robust Dynamics through Variational Sparse Gating","date":"2022-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnavkj1995/vsg","path":"plotting.py","file_url":"https://github.com/arnavkj1995/vsg/blob/HEAD/plotting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"151b79dfa34b9b00","code_sha256_prefix":"151b79dfa34b9b00","mcp_get_code":{"code_sha256":"151b79dfa34b9b00"}},{"arxiv_id":"2202.09481","arxiv_id_is_arxiv":true,"paper":"/paper/transdreamer-reinforcement-learning-with-1","title":"TransDreamer: Reinforcement Learning with Transformer World Models","date":"2022-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danijar/crafter","path":"analysis/common.py","file_url":"https://github.com/danijar/crafter/blob/HEAD/analysis/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"75a8133b273fb929","code_sha256_prefix":"75a8133b273fb929","mcp_get_code":{"code_sha256":"75a8133b273fb929"}},{"arxiv_id":"2110.14565","arxiv_id_is_arxiv":true,"paper":"/paper/dreamerpro-reconstruction-free-model-based-1","title":"DreamerPro: Reconstruction-Free Model-Based Reinforcement Learning with Prototypical Representations","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdeng18/dreamer-pro","path":"Dreamer/common/plot.py","file_url":"https://github.com/fdeng18/dreamer-pro/blob/HEAD/Dreamer/common/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4878c13e37288f19","code_sha256_prefix":"4878c13e37288f19","mcp_get_code":{"code_sha256":"4878c13e37288f19"}},{"arxiv_id":"2108.08787","arxiv_id_is_arxiv":true,"paper":"/paper/mr-tydi-a-multi-lingual-benchmark-for-dense","title":"Mr. TyDi: A Multi-lingual Benchmark for Dense Retrieval","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"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","code_sha256":"8735894f4e3d26ec","code_sha256_prefix":"8735894f4e3d26ec","mcp_get_code":{"code_sha256":"8735894f4e3d26ec"}},{"arxiv_id":"2106.07156","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-predictive-coding-for-model-based","title":"Temporal Predictive Coding For Model-Based Planning In Latent Space","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/TPC-tensorflow","path":"plotting.py","file_url":"https://github.com/VinAIResearch/TPC-tensorflow/blob/HEAD/plotting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e6df7a3762e59661","code_sha256_prefix":"e6df7a3762e59661","mcp_get_code":{"code_sha256":"e6df7a3762e59661"}},{"arxiv_id":"2010.02193","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-atari-with-discrete-world-models-1","title":"Mastering Atari with Discrete World Models","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iglu-contest/iglu-builder-baseline-dreamer","path":"common/plot.py","file_url":"https://github.com/iglu-contest/iglu-builder-baseline-dreamer/blob/HEAD/common/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4878c13e37288f19","code_sha256_prefix":"4878c13e37288f19","mcp_get_code":{"code_sha256":"4878c13e37288f19"}},{"arxiv_id":"2003.05002","arxiv_id_is_arxiv":true,"paper":"/paper/tydi-qa-a-benchmark-for-information-seeking","title":"TyDi QA: A Benchmark for Information-Seeking Question Answering in Typologically Diverse Languages","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/mr.tydi","path":"scripts/hybrid.py","file_url":"https://github.com/castorini/mr.tydi/blob/HEAD/scripts/hybrid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8735894f4e3d26ec","code_sha256_prefix":"8735894f4e3d26ec","mcp_get_code":{"code_sha256":"8735894f4e3d26ec"}},{"arxiv_id":"1912.01603","arxiv_id_is_arxiv":true,"paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danijar/dreamer","path":"plotting.py","file_url":"https://github.com/danijar/dreamer/blob/HEAD/plotting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6dd3eb82ea8db085","code_sha256_prefix":"6dd3eb82ea8db085","mcp_get_code":{"code_sha256":"6dd3eb82ea8db085"}}],"record_sha256":"fe43a293a2bbff4bfec40c71c2de736caba2aea439f444ef6aaf78ca56f75867","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}