{"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/simulate","entry":"simulate","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":17,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"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":18,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":9,"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":7,"unverified":9},"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":"2609.00275","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00275","title":"The Irreversibility Budget: Fleet-Level Risk Accounting and Admission Control for Agent Operating Systems","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"mpi-dsg/irreversibility-budget","path":"sim/fleetsim.py","file_url":"https://github.com/mpi-dsg/irreversibility-budget/blob/HEAD/sim/fleetsim.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":"0fdbef246d1b248d","code_sha256_prefix":"0fdbef246d1b248d","mcp_get_code":{"code_sha256":"0fdbef246d1b248d"}},{"arxiv_id":"2606.12691","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12691","title":"Two-Layer Linear Auto-Regressive Models Estimate Latent States","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"sdean-group/linear-ar-kf","path":"exp/simulate.py","file_url":"https://github.com/sdean-group/linear-ar-kf/blob/HEAD/exp/simulate.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, sdean-group/linear-ar-kf when it was checked","code_sha256":"7bca755be1fb12fd","code_sha256_prefix":"7bca755be1fb12fd","mcp_get_code":{"code_sha256":"7bca755be1fb12fd"}},{"arxiv_id":"2605.17285","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17285","title":"UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models","date":"2026-05-17","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"hjkng/unrexplainer","path":"explainer/unrexplainer.py","file_url":"https://github.com/hjkng/unrexplainer/blob/HEAD/explainer/unrexplainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, hjkng/unrexplainer when it was checked","code_sha256":"509fdae86547cabe","code_sha256_prefix":"509fdae86547cabe","mcp_get_code":{"code_sha256":"509fdae86547cabe"}},{"arxiv_id":"2605.00940","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00940","title":"Interpretable experiential learning based on state history and global feedback","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"aigents/aigents-python","path":"aigents-python/reputation_calculation.py","file_url":"https://github.com/aigents/aigents-python/blob/HEAD/aigents-python/reputation_calculation.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":"de5d9e5bff8f2e20","code_sha256_prefix":"de5d9e5bff8f2e20","mcp_get_code":{"code_sha256":"de5d9e5bff8f2e20"}},{"arxiv_id":"2601.19336","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-19336","title":"From Observations to Events: Event-Aware World Model for Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"MarquisDarwin/EAWM","path":"EADream/tools.py","file_url":"https://github.com/MarquisDarwin/EAWM/blob/HEAD/EADream/tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, MarquisDarwin/EAWM, is not in the permissive set Syntology serves inline","code_sha256":"97697619e5f42da7","code_sha256_prefix":"97697619e5f42da7","mcp_get_code":{"code_sha256":"97697619e5f42da7"}},{"arxiv_id":"2506.17139","arxiv_id_is_arxiv":true,"paper":"/paper/consistent-sampling-and-simulation-molecular","title":"Consistent Sampling and Simulation: Molecular Dynamics with Energy-Based Diffusion Models","date":"2025-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noegroup/ScoreMD","path":"src/scoremd/simulation.py","file_url":"https://github.com/noegroup/ScoreMD/blob/HEAD/src/scoremd/simulation.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":"e3037c9358ad12bd","code_sha256_prefix":"e3037c9358ad12bd","mcp_get_code":{"code_sha256":"e3037c9358ad12bd"}},{"arxiv_id":"2505.18673","arxiv_id_is_arxiv":true,"paper":"/paper/cross-lingual-pitfalls-automatic-probing","title":"Cross-Lingual Pitfalls: Automatic Probing Cross-Lingual Weakness of Multilingual Large Language Models","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xzx34/Cross-Lingual-Pitfalls","path":"utils/answers.py","file_url":"https://github.com/xzx34/Cross-Lingual-Pitfalls/blob/HEAD/utils/answers.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":"6af661cb96adc80d","code_sha256_prefix":"6af661cb96adc80d","mcp_get_code":{"code_sha256":"6af661cb96adc80d"}},{"arxiv_id":"2503.05888","arxiv_id_is_arxiv":true,"paper":"/paper/qg-sms-enhancing-test-item-analysis-via","title":"QG-SMS: Enhancing Test Item Analysis via Student Modeling and Simulation","date":"2025-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bnguyen5/qg-sms","path":"qg-sms/evaluate.py","file_url":"https://github.com/bnguyen5/qg-sms/blob/HEAD/qg-sms/evaluate.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, bnguyen5/qg-sms when it was checked","code_sha256":"df5e032a7f9614a1","code_sha256_prefix":"df5e032a7f9614a1","mcp_get_code":{"code_sha256":"df5e032a7f9614a1"}},{"arxiv_id":"2402.13077","arxiv_id_is_arxiv":true,"paper":"/paper/mechanistic-neural-networks-for-scientific","title":"Mechanistic Neural Networks for Scientific Machine Learning","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alpz/mech-nn","path":"discovery/lorenz.py","file_url":"https://github.com/alpz/mech-nn/blob/HEAD/discovery/lorenz.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alpz/mech-nn when it was checked","code_sha256":"4d32099793229d4a","code_sha256_prefix":"4d32099793229d4a","mcp_get_code":{"code_sha256":"4d32099793229d4a"}},{"arxiv_id":"2401.17205","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-experiment-design-with-synthetic","title":"Adaptive Experiment Design with Synthetic Controls","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/syntax","path":"src/envs.py","file_url":"https://github.com/vanderschaarlab/syntax/blob/HEAD/src/envs.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, vanderschaarlab/syntax when it was checked","code_sha256":"f47c01c0feaa394f","code_sha256_prefix":"f47c01c0feaa394f","mcp_get_code":{"code_sha256":"f47c01c0feaa394f"}},{"arxiv_id":"2310.17786","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-when-dynamics-invariant-data","title":"Understanding when Dynamics-Invariant Data Augmentations Benefit Model-Free Reinforcement Learning Updates","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"badger-rl/understandingdataaugmentationforrl","path":"augment/simulate.py","file_url":"https://github.com/badger-rl/understandingdataaugmentationforrl/blob/HEAD/augment/simulate.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, badger-rl/understandingdataaugmentationforrl when it was checked","code_sha256":"834be0fa22de4614","code_sha256_prefix":"834be0fa22de4614","mcp_get_code":{"code_sha256":"834be0fa22de4614"}},{"arxiv_id":"2310.17786","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-when-dynamics-invariant-data","title":"Understanding when Dynamics-Invariant Data Augmentations Benefit Model-Free Reinforcement Learning Updates","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"badger-rl/understandingdataaugmentationforrl","path":"augment/rl/generate_demonstrations.py","file_url":"https://github.com/badger-rl/understandingdataaugmentationforrl/blob/HEAD/augment/rl/generate_demonstrations.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, badger-rl/understandingdataaugmentationforrl when it was checked","code_sha256":"142d0a932e09216a","code_sha256_prefix":"142d0a932e09216a","mcp_get_code":{"code_sha256":"142d0a932e09216a"}},{"arxiv_id":"2301.13755","arxiv_id_is_arxiv":true,"paper":"/paper/retrosynthetic-planning-with-dual-value","title":"Retrosynthetic Planning with Dual Value Networks","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DiXue98/PDVN","path":"retro_star/alg/online_mcts.py","file_url":"https://github.com/DiXue98/PDVN/blob/HEAD/retro_star/alg/online_mcts.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, DiXue98/PDVN when it was checked","code_sha256":"d9c6080c1c0cf43e","code_sha256_prefix":"d9c6080c1c0cf43e","mcp_get_code":{"code_sha256":"d9c6080c1c0cf43e"}},{"arxiv_id":"2205.13817","arxiv_id_is_arxiv":true,"paper":"/paper/isolating-and-leveraging-controllable-and","title":"Iso-Dream: Isolating and Leveraging Noncontrollable Visual Dynamics in World Models","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panmt/iso-dream","path":"dmc_carla_iso/tools.py","file_url":"https://github.com/panmt/iso-dream/blob/HEAD/dmc_carla_iso/tools.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":"7eabbccce1f460ec","code_sha256_prefix":"7eabbccce1f460ec","mcp_get_code":{"code_sha256":"7eabbccce1f460ec"}},{"arxiv_id":"2112.15311","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimization-of-function-networks-1","title":"Bayesian Optimization of Function Networks","date":"2021-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raulastudillo06/bofn","path":"experiments/si_epidemic_model_simulator.py","file_url":"https://github.com/raulastudillo06/bofn/blob/HEAD/experiments/si_epidemic_model_simulator.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":"13177652cf0bcb82","code_sha256_prefix":"13177652cf0bcb82","mcp_get_code":{"code_sha256":"13177652cf0bcb82"}},{"arxiv_id":"2010.12142","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-imagination-and-reality-for-model","title":"Bridging Imagination and Reality for Model-Based Deep Reinforcement Learning","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dreamer","path":"dreamer/control/simulate.py","file_url":"https://github.com/google-research/dreamer/blob/HEAD/dreamer/control/simulate.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":"7e9bd0dd61fa154e","code_sha256_prefix":"7e9bd0dd61fa154e","mcp_get_code":{"code_sha256":"7e9bd0dd61fa154e"}},{"arxiv_id":"1803.10122","arxiv_id_is_arxiv":true,"paper":"/paper/world-models","title":"World Models","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zacwellmer/worldmodels","path":"WorldModels/controller.py","file_url":"https://github.com/zacwellmer/worldmodels/blob/HEAD/WorldModels/controller.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":"bb98d1b55f68375e","code_sha256_prefix":"bb98d1b55f68375e","mcp_get_code":{"code_sha256":"bb98d1b55f68375e"}},{"arxiv_id":"1602.02964","arxiv_id_is_arxiv":true,"paper":"/paper/a-kernel-test-of-goodness-of-fit","title":"A Kernel Test of Goodness of Fit","date":"2016-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karlnapf/kernel_goodness_of_fit","path":"stat_test/ar.py","file_url":"https://github.com/karlnapf/kernel_goodness_of_fit/blob/HEAD/stat_test/ar.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1f7f79604d019ecc","code_sha256_prefix":"1f7f79604d019ecc","mcp_get_code":{"code_sha256":"1f7f79604d019ecc"}}],"record_sha256":"6fc79da194b49c6e981de954b80fda0da059058e89f9997886427c52cc18753e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}