{"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/move-to","entry":"move_to","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":8,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":15,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":6,"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":"2606.30680","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-30680","title":"Locker-based Truck-Drone Routing with Integrated Considerations of Pickups, Deliveries, and No-Fly Zones","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wouterkool/attention-learn-to-route","path":"utils/functions.py","file_url":"https://github.com/wouterkool/attention-learn-to-route/blob/HEAD/utils/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zhangzizhen/ml-dam, and GitHub detected no licence in that repository when it was checked","code_sha256":"107d6628712f1a21","code_sha256_prefix":"107d6628712f1a21","mcp_get_code":{"code_sha256":"107d6628712f1a21"}},{"arxiv_id":"2604.14602","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14602","title":"CausalDetox: Causal Head Selection and Intervention for Language Model Detoxification","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"unitaryai/detoxify","path":"src/utils.py","file_url":"https://github.com/unitaryai/detoxify/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f1ef1b0e36849908","code_sha256_prefix":"f1ef1b0e36849908","mcp_get_code":{"code_sha256":"f1ef1b0e36849908"}},{"arxiv_id":"2505.02604","arxiv_id_is_arxiv":true,"paper":"/paper/low-loss-space-in-neural-networks-is","title":"Low-Loss Space in Neural Networks is Continuous and Fully Connected","date":"2025-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdraxler/PyTorch-AutoNEB","path":"torch_autoneb/helpers.py","file_url":"https://github.com/fdraxler/PyTorch-AutoNEB/blob/HEAD/torch_autoneb/helpers.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":"cb7d54d7bc7e17f4","code_sha256_prefix":"cb7d54d7bc7e17f4","mcp_get_code":{"code_sha256":"cb7d54d7bc7e17f4"}},{"arxiv_id":"2407.07086","arxiv_id_is_arxiv":true,"paper":"/paper/hypothetical-minds-scaffolding-theory-of-mind","title":"Hypothetical Minds: Scaffolding Theory of Mind for Multi-Agent Tasks with Large Language Models","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locross93/hypothetical-minds","path":"llm_plan/agent/action_funcs.py","file_url":"https://github.com/locross93/hypothetical-minds/blob/HEAD/llm_plan/agent/action_funcs.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":"039a1ae74573e452","code_sha256_prefix":"039a1ae74573e452","mcp_get_code":{"code_sha256":"039a1ae74573e452"}},{"arxiv_id":"2406.19300","arxiv_id_is_arxiv":true,"paper":"/paper/sctree-discovering-cellular-hierarchies-in","title":"scTree: Discovering Cellular Hierarchies in the Presence of Batch Effects in scRNA-seq Data","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvandenhi/sctree-public","path":"src/sctree/utils/training_utils.py","file_url":"https://github.com/mvandenhi/sctree-public/blob/HEAD/src/sctree/utils/training_utils.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":"a046b50a34886842","code_sha256_prefix":"a046b50a34886842","mcp_get_code":{"code_sha256":"a046b50a34886842"}},{"arxiv_id":"2403.13501","arxiv_id_is_arxiv":true,"paper":"/paper/vstar-generative-temporal-nursing-for-longer","title":"VSTAR: Generative Temporal Nursing for Longer Dynamic Video Synthesis","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/VSTAR","path":"utils/attention_utils.py","file_url":"https://github.com/boschresearch/VSTAR/blob/HEAD/utils/attention_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/VSTAR, is not in the permissive set Syntology serves inline","code_sha256":"630566ccfdfd6468","code_sha256_prefix":"630566ccfdfd6468","mcp_get_code":{"code_sha256":"630566ccfdfd6468"}},{"arxiv_id":"2307.10864","arxiv_id_is_arxiv":true,"paper":"/paper/divide-bind-your-attention-for-improved","title":"Divide & Bind Your Attention for Improved Generative Semantic Nursing","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/Divide-and-Bind","path":"utils/ptp_utils.py","file_url":"https://github.com/boschresearch/Divide-and-Bind/blob/HEAD/utils/ptp_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/Divide-and-Bind, is not in the permissive set Syntology serves inline","code_sha256":"630566ccfdfd6468","code_sha256_prefix":"630566ccfdfd6468","mcp_get_code":{"code_sha256":"630566ccfdfd6468"}},{"arxiv_id":"2210.07228","arxiv_id_is_arxiv":true,"paper":"/paper/language-model-decoding-as-likelihood-utility","title":"Language Model Decoding as Likelihood-Utility Alignment","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfl-dlab/understanding-decoding","path":"detoxify/src/utils.py","file_url":"https://github.com/epfl-dlab/understanding-decoding/blob/HEAD/detoxify/src/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":"f1ef1b0e36849908","code_sha256_prefix":"f1ef1b0e36849908","mcp_get_code":{"code_sha256":"f1ef1b0e36849908"}},{"arxiv_id":"2205.13225","arxiv_id_is_arxiv":true,"paper":"/paper/collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/devformer","path":"src/utils/functions.py","file_url":"https://github.com/kaist-silab/devformer/blob/HEAD/src/utils/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zhangzizhen/ml-dam, and GitHub detected no licence in that repository when it was checked","code_sha256":"107d6628712f1a21","code_sha256_prefix":"107d6628712f1a21","mcp_get_code":{"code_sha256":"107d6628712f1a21"}},{"arxiv_id":"2105.02741","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-based-deep-reinforcement","title":"Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangzizhen/ml-dam","path":"utils/functions.py","file_url":"https://github.com/zhangzizhen/ml-dam/blob/HEAD/utils/functions.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, zhangzizhen/ml-dam when it was checked","code_sha256":"107d6628712f1a21","code_sha256_prefix":"107d6628712f1a21","mcp_get_code":{"code_sha256":"107d6628712f1a21"}},{"arxiv_id":"2007.09548","arxiv_id_is_arxiv":true,"paper":"/paper/kinematic-3d-object-detection-in-monocular","title":"Kinematic 3D Object Detection in Monocular Video","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nicholasli1995/EgoNet","path":"libs/common/transformation.py","file_url":"https://github.com/Nicholasli1995/EgoNet/blob/HEAD/libs/common/transformation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4367e9e28855609c","code_sha256_prefix":"4367e9e28855609c","mcp_get_code":{"code_sha256":"4367e9e28855609c"}},{"arxiv_id":"1905.03711","arxiv_id_is_arxiv":true,"paper":"/paper/190503711","title":"Processing Megapixel Images with Deep Attention-Sampling Models","date":"2019-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sara-nl/attention-sampling-pytorch","path":"utils.py","file_url":"https://github.com/sara-nl/attention-sampling-pytorch/blob/HEAD/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":"326f2acb728d830c","code_sha256_prefix":"326f2acb728d830c","mcp_get_code":{"code_sha256":"326f2acb728d830c"}},{"arxiv_id":"1803.08475","arxiv_id_is_arxiv":true,"paper":"/paper/attention-learn-to-solve-routing-problems","title":"Attention, Learn to Solve Routing Problems!","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theresearchai/vehicle_routing_rl_2","path":"utils/functions.py","file_url":"https://github.com/theresearchai/vehicle_routing_rl_2/blob/HEAD/utils/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zhangzizhen/ml-dam, and GitHub detected no licence in that repository when it was checked","code_sha256":"107d6628712f1a21","code_sha256_prefix":"107d6628712f1a21","mcp_get_code":{"code_sha256":"107d6628712f1a21"}},{"arxiv_id":"1511.06422","arxiv_id_is_arxiv":true,"paper":"/paper/all-you-need-is-a-good-init","title":"All you need is a good init","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ducha-aiki/lsuv","path":"lsuv/lsuvinit.py","file_url":"https://github.com/ducha-aiki/lsuv/blob/HEAD/lsuv/lsuvinit.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":"1de0deb674c678ec","code_sha256_prefix":"1de0deb674c678ec","mcp_get_code":{"code_sha256":"1de0deb674c678ec"}},{"arxiv_id":"aaai_25418","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25418","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Shinetism/VStates","path":"utils/trn_utils.py","file_url":"https://github.com/Shinetism/VStates/blob/HEAD/utils/trn_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":"e5edd11f7a6cabce","code_sha256_prefix":"e5edd11f7a6cabce","mcp_get_code":{"code_sha256":"e5edd11f7a6cabce"}}],"record_sha256":"1af97fffc097eff03533eae053ebb335b85c7e050e1830672cc1538f08d2d27b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}