{"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/rollout","entry":"rollout","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":16,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":7,"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":17,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":19,"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":3,"ran_fixture":1,"ran":6,"unverified":7},"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.24547","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24547","title":"From Numerical Simulators of PDEs to Neural Emulators and Back","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Ceyron/exponax","path":"exponax/_utils.py","file_url":"https://github.com/Ceyron/exponax/blob/HEAD/exponax/_utils.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":"25aebcd4baee8be5","code_sha256_prefix":"25aebcd4baee8be5","mcp_get_code":{"code_sha256":"25aebcd4baee8be5"}},{"arxiv_id":"2608.13215","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-13215","title":"History-informed Lagrangian Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"yingtian22/History-informed-LNN","path":"src/models/hilnn.py","file_url":"https://github.com/yingtian22/History-informed-LNN/blob/HEAD/src/models/hilnn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"49cea354592c9d0a","code_sha256_prefix":"49cea354592c9d0a","mcp_get_code":{"code_sha256":"49cea354592c9d0a"}},{"arxiv_id":"2606.18514","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18514","title":"N(CO) 2 : Neural Combinatorial Optimization with Chance Constraints to Solve Stochastic Orienteering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"ucmercedrobotics/sop-heuristic-opt","path":"sop/train/reinforce.py","file_url":"https://github.com/ucmercedrobotics/sop-heuristic-opt/blob/HEAD/sop/train/reinforce.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, ucmercedrobotics/sop-heuristic-opt when it was checked","code_sha256":"99239c110ddbde08","code_sha256_prefix":"99239c110ddbde08","mcp_get_code":{"code_sha256":"99239c110ddbde08"}},{"arxiv_id":"2510.23111","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-23111","title":"Neural Emulator Superiority: When Machine Learning for PDEs Surpasses its Training Data","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"tum-pbs/emulator-superiority","path":"code/experiments/superape/picardax/picardax/_utils.py","file_url":"https://github.com/tum-pbs/emulator-superiority/blob/HEAD/code/experiments/superape/picardax/picardax/_utils.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, tum-pbs/emulator-superiority when it was checked","code_sha256":"ab18f29d9313c1d7","code_sha256_prefix":"ab18f29d9313c1d7","mcp_get_code":{"code_sha256":"ab18f29d9313c1d7"}},{"arxiv_id":"2505.02010","arxiv_id_is_arxiv":true,"paper":"/paper/meta-black-box-optimization-through-offline-q","title":"Meta-Black-Box-Optimization through Offline Q-function Learning","date":"2025-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"metaevo/q-mamba","path":"EE_data_ratio.py","file_url":"https://github.com/metaevo/q-mamba/blob/HEAD/EE_data_ratio.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":"25800a28407c2dab","code_sha256_prefix":"25800a28407c2dab","mcp_get_code":{"code_sha256":"25800a28407c2dab"}},{"arxiv_id":"2312.06853","arxiv_id_is_arxiv":true,"paper":"/paper/llf-bench-benchmark-for-interactive-learning","title":"LLF-Bench: Benchmark for Interactive Learning from Language Feedback","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/llf-bench","path":"llfbench/agents/utils.py","file_url":"https://github.com/microsoft/llf-bench/blob/HEAD/llfbench/agents/utils.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":"ad264f7ab70b06e1","code_sha256_prefix":"ad264f7ab70b06e1","mcp_get_code":{"code_sha256":"ad264f7ab70b06e1"}},{"arxiv_id":"2311.03351","arxiv_id_is_arxiv":true,"paper":"/paper/uni-o4-unifying-online-and-offline-deep","title":"Uni-O4: Unifying Online and Offline Deep Reinforcement Learning with Multi-Step On-Policy Optimization","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lei-Kun/Uni-O4","path":"dynamics_eval.py","file_url":"https://github.com/Lei-Kun/Uni-O4/blob/HEAD/dynamics_eval.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":"1c0b96eb357d508b","code_sha256_prefix":"1c0b96eb357d508b","mcp_get_code":{"code_sha256":"1c0b96eb357d508b"}},{"arxiv_id":"2308.14104","arxiv_id_is_arxiv":true,"paper":"/paper/towards-generalizable-neural-solvers-for","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaocrr/elg","path":"CVRP/utils.py","file_url":"https://github.com/gaocrr/elg/blob/HEAD/CVRP/utils.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":"b8a2463790245a04","code_sha256_prefix":"b8a2463790245a04","mcp_get_code":{"code_sha256":"b8a2463790245a04"}},{"arxiv_id":"2308.14104","arxiv_id_is_arxiv":true,"paper":"/paper/towards-generalizable-neural-solvers-for","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaocrr/elg","path":"TSP/utils.py","file_url":"https://github.com/gaocrr/elg/blob/HEAD/TSP/utils.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":"38a9f6e145336e55","code_sha256_prefix":"38a9f6e145336e55","mcp_get_code":{"code_sha256":"38a9f6e145336e55"}},{"arxiv_id":"2210.13846","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-behavior-cloning-regularization-for-1","title":"Adaptive Behavior Cloning Regularization for Stable Offline-to-Online Reinforcement Learning","date":"2022-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaoyi11/adaptive_bc","path":"utils.py","file_url":"https://github.com/zhaoyi11/adaptive_bc/blob/HEAD/utils.py","status":"ran","verification_level":1,"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":"5d060ee404dd83a1","code_sha256_prefix":"5d060ee404dd83a1","mcp_get_code":{"code_sha256":"5d060ee404dd83a1"}},{"arxiv_id":"2210.07686","arxiv_id_is_arxiv":true,"paper":"/paper/learning-generalizable-models-for-vehicle","title":"Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jieyibi/amdkd","path":"AMDKD-AM/knowledge_distillation.py","file_url":"https://github.com/jieyibi/amdkd/blob/HEAD/AMDKD-AM/knowledge_distillation.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":"d9dcc86b19b64227","code_sha256_prefix":"d9dcc86b19b64227","mcp_get_code":{"code_sha256":"d9dcc86b19b64227"}},{"arxiv_id":"2204.13250","arxiv_id_is_arxiv":true,"paper":"/paper/watts-infrastructure-for-open-ended-learning","title":"Watts: Infrastructure for Open-Ended Learning","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aadharna/watts","path":"watts/evaluators/rollout.py","file_url":"https://github.com/aadharna/watts/blob/HEAD/watts/evaluators/rollout.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":"4b31f77b3f7fa197","code_sha256_prefix":"4b31f77b3f7fa197","mcp_get_code":{"code_sha256":"4b31f77b3f7fa197"}},{"arxiv_id":"2108.09105","arxiv_id_is_arxiv":true,"paper":"/paper/airbert-in-domain-pretraining-for-vision-and","title":"Airbert: In-domain Pretraining for Vision-and-Language Navigation","date":"2021-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"airbert-vln/airbert","path":"train_speaker.py","file_url":"https://github.com/airbert-vln/airbert/blob/HEAD/train_speaker.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":"9e8292655b4f13cb","code_sha256_prefix":"9e8292655b4f13cb","mcp_get_code":{"code_sha256":"9e8292655b4f13cb"}},{"arxiv_id":"2005.00928","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-attention-flow-in-transformers","title":"Quantifying Attention Flow in Transformers","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobgil/vit-explain","path":"vit_rollout.py","file_url":"https://github.com/jacobgil/vit-explain/blob/HEAD/vit_rollout.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":"84871575d6e5f5d9","code_sha256_prefix":"84871575d6e5f5d9","mcp_get_code":{"code_sha256":"84871575d6e5f5d9"}},{"arxiv_id":"2005.00928","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-attention-flow-in-transformers","title":"Quantifying Attention Flow in Transformers","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leemsaebom/attention-guided-cam-visual-explanations-of-vision-transformer-guided-by-self-attention","path":"Methods/AttentionRollout/AttentionRollout.py","file_url":"https://github.com/leemsaebom/attention-guided-cam-visual-explanations-of-vision-transformer-guided-by-self-attention/blob/HEAD/Methods/AttentionRollout/AttentionRollout.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, leemsaebom/attention-guided-cam-visual-explanations-of-vision-transformer-guided-by-self-attention when it was checked","code_sha256":"f06c5e0a3af9b83c","code_sha256_prefix":"f06c5e0a3af9b83c","mcp_get_code":{"code_sha256":"f06c5e0a3af9b83c"}},{"arxiv_id":"2003.08165","arxiv_id_is_arxiv":true,"paper":"/paper/neuroevolution-of-self-interpretable-agents","title":"Neuroevolution of Self-Interpretable Agents","date":"2020-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kachayev/car-racing-attention-agent","path":"exp1-topK-lstm-cmaes.py","file_url":"https://github.com/kachayev/car-racing-attention-agent/blob/HEAD/exp1-topK-lstm-cmaes.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kachayev/car-racing-attention-agent when it was checked","code_sha256":"6fcf644f520ce409","code_sha256_prefix":"6fcf644f520ce409","mcp_get_code":{"code_sha256":"6fcf644f520ce409"}},{"arxiv_id":"2003.00671","arxiv_id_is_arxiv":true,"paper":"/paper/autophase-juggling-hls-phase-orderings-in","title":"AutoPhase: Juggling HLS Phase Orderings in Random Forests with Deep Reinforcement Learning","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucb-bar/autophase","path":"algos/rl/policies.py","file_url":"https://github.com/ucb-bar/autophase/blob/HEAD/algos/rl/policies.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":"0c166888d916644a","code_sha256_prefix":"0c166888d916644a","mcp_get_code":{"code_sha256":"0c166888d916644a"}},{"arxiv_id":"ijcai2024_0764","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0764","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lamda-bbo/ELG","path":"CVRP/utils.py","file_url":"https://github.com/lamda-bbo/ELG/blob/HEAD/CVRP/utils.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":"b8a2463790245a04","code_sha256_prefix":"b8a2463790245a04","mcp_get_code":{"code_sha256":"b8a2463790245a04"}},{"arxiv_id":"ijcai2024_0764","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0764","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lamda-bbo/ELG","path":"TSP/utils.py","file_url":"https://github.com/lamda-bbo/ELG/blob/HEAD/TSP/utils.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":"38a9f6e145336e55","code_sha256_prefix":"38a9f6e145336e55","mcp_get_code":{"code_sha256":"38a9f6e145336e55"}}],"record_sha256":"b4097b44a2c74f6ba199fae672861f51fa04fbc86184f72ea9cae82120c4b11f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}