{"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/sampler-2","entry":"sampler","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":7,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":7,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":4},"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":"2607.01525","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-01525","title":"Mean Field Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"mlauriere/mfrl-tutorial-code","path":"src/mfrl_tutorial/cybersecurity_qlearning_core.py","file_url":"https://github.com/mlauriere/mfrl-tutorial-code/blob/HEAD/src/mfrl_tutorial/cybersecurity_qlearning_core.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dee65c4a2a811d5e","code_sha256_prefix":"dee65c4a2a811d5e","mcp_get_code":{"code_sha256":"dee65c4a2a811d5e"}},{"arxiv_id":"2604.02889","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-02889","title":"Rethinking Forward Processes for Score-Based Nonlinear Data Assimilation in High Dimensions","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"tcnllab-oss/masf","path":"methods/nonlinear_ours.py","file_url":"https://github.com/tcnllab-oss/masf/blob/HEAD/methods/nonlinear_ours.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, tcnllab-oss/masf when it was checked","code_sha256":"8c070d2f0cb828b4","code_sha256_prefix":"8c070d2f0cb828b4","mcp_get_code":{"code_sha256":"8c070d2f0cb828b4"}},{"arxiv_id":"2305.14267","arxiv_id_is_arxiv":true,"paper":"/paper/seeds-exponential-sde-solvers-for-fast-high-1","title":"SEEDS: Exponential SDE Solvers for Fast High-Quality Sampling from Diffusion Models","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nfsrules/seeds","path":"generate.py","file_url":"https://github.com/nfsrules/seeds/blob/HEAD/generate.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, nfsrules/seeds when it was checked","code_sha256":"2f8e508ca46e108e","code_sha256_prefix":"2f8e508ca46e108e","mcp_get_code":{"code_sha256":"2f8e508ca46e108e"}},{"arxiv_id":"2202.05621","arxiv_id_is_arxiv":true,"paper":"/paper/long-time-convergence-and-propagation-of","title":"Nonlinear MCMC for Bayesian Machine Learning","date":"2022-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamesvuc/jax-bayes","path":"jax_bayes/mcmc/sampler.py","file_url":"https://github.com/jamesvuc/jax-bayes/blob/HEAD/jax_bayes/mcmc/sampler.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":"604a74bdfc9c0ab6","code_sha256_prefix":"604a74bdfc9c0ab6","mcp_get_code":{"code_sha256":"604a74bdfc9c0ab6"}},{"arxiv_id":"2004.05718","arxiv_id_is_arxiv":true,"paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changminwu/expandergnn","path":"layers/pna_layer.py","file_url":"https://github.com/changminwu/expandergnn/blob/HEAD/layers/pna_layer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, changminwu/expandergnn when it was checked","code_sha256":"ea989e2ffeb38bb6","code_sha256_prefix":"ea989e2ffeb38bb6","mcp_get_code":{"code_sha256":"ea989e2ffeb38bb6"}},{"arxiv_id":"1912.03263","arxiv_id_is_arxiv":true,"paper":"/paper/your-classifier-is-secretly-an-energy-based-1","title":"Your Classifier is Secretly an Energy Based Model and You Should Treat it Like One","date":"2019-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tohmae/pytorch-jem","path":"jem.py","file_url":"https://github.com/tohmae/pytorch-jem/blob/HEAD/jem.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, tohmae/pytorch-jem when it was checked","code_sha256":"d9c152564c59b4f6","code_sha256_prefix":"d9c152564c59b4f6","mcp_get_code":{"code_sha256":"d9c152564c59b4f6"}},{"arxiv_id":"Lemmer_Ground-Truth_or_DAER_Selective_Re-Query_of_Secondary_Information_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lemmer_Ground-Truth_or_DAER_Selective_Re-Query_of_Secondary_Information_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lemmersj/ground-truth-or-daer","path":"kcve/generate_score_csvs.py","file_url":"https://github.com/lemmersj/ground-truth-or-daer/blob/HEAD/kcve/generate_score_csvs.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":"293506a46ae14de5","code_sha256_prefix":"293506a46ae14de5","mcp_get_code":{"code_sha256":"293506a46ae14de5"}}],"record_sha256":"b83c4590d906add6ead53f6a7c26bdf2902996c80a2deda9fd2684cb5348fde0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}