{"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/ensemble-2","entry":"Ensemble","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":5,"n_samples_constructed":5,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":4,"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":0,"ran_fixture":0,"ran":5,"unverified":1},"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":"2507.23771","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.23771","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"justinkay/coda","path":"coda/coda.py","file_url":"https://github.com/justinkay/coda/blob/HEAD/coda/coda.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, justinkay/coda when it was checked","code_sha256":"072f6cd34ba1890f","code_sha256_prefix":"072f6cd34ba1890f","mcp_get_code":{"code_sha256":"072f6cd34ba1890f"}},{"arxiv_id":"2502.02538","arxiv_id_is_arxiv":true,"paper":"/paper/flow-q-learning","title":"Flow Q-Learning","date":"2025-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MohammadrezaNakhaei/FQL","path":"fql.py","file_url":"https://github.com/MohammadrezaNakhaei/FQL/blob/HEAD/fql.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, MohammadrezaNakhaei/FQL when it was checked","code_sha256":"b3e1ba477f66ccd1","code_sha256_prefix":"b3e1ba477f66ccd1","mcp_get_code":{"code_sha256":"b3e1ba477f66ccd1"}},{"arxiv_id":"2104.00671","arxiv_id_is_arxiv":true,"paper":"/paper/trs-transferability-reduced-ensemble-via","title":"TRS: Transferability Reduced Ensemble via Encouraging Gradient Diversity and Model Smoothness","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-secure/Transferability-Reduced-Smooth-Ensemble","path":"train/Empirical/trainer.py","file_url":"https://github.com/AI-secure/Transferability-Reduced-Smooth-Ensemble/blob/HEAD/train/Empirical/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AI-secure/Transferability-Reduced-Smooth-Ensemble when it was checked","code_sha256":"26fd974a366fee7c","code_sha256_prefix":"26fd974a366fee7c","mcp_get_code":{"code_sha256":"26fd974a366fee7c"}},{"arxiv_id":"2010.08830","arxiv_id_is_arxiv":true,"paper":"/paper/mesa-boost-ensemble-imbalanced-learning-with","title":"MESA: Boost Ensemble Imbalanced Learning with MEta-SAmpler","date":"2020-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurIPS2020AnonymousSubmission/mesa","path":"mesa.py","file_url":"https://github.com/NeurIPS2020AnonymousSubmission/mesa/blob/HEAD/mesa.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":"c1ebf5a998d2091f","code_sha256_prefix":"c1ebf5a998d2091f","mcp_get_code":{"code_sha256":"c1ebf5a998d2091f"}},{"arxiv_id":"1805.12114","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-in-a-handful-of","title":"Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ByMic/PETS","path":"utils/ensemble.py","file_url":"https://github.com/ByMic/PETS/blob/HEAD/utils/ensemble.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ByMic/PETS when it was checked","code_sha256":"1c0e747272c22445","code_sha256_prefix":"1c0e747272c22445","mcp_get_code":{"code_sha256":"1c0e747272c22445"}},{"arxiv_id":"1612.01474","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-scalable-predictive-uncertainty","title":"Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles","date":"2016-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StanfordASL/SCOD","path":"nn_ood/posteriors/ensemble.py","file_url":"https://github.com/StanfordASL/SCOD/blob/HEAD/nn_ood/posteriors/ensemble.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cfe90024d387377b","code_sha256_prefix":"cfe90024d387377b","mcp_get_code":{"code_sha256":"cfe90024d387377b"}}],"record_sha256":"74a8a88bb49921ebfe21ba651bc7e5b85bb466758a038c22bd7c57dc57d450d2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}