{"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","entry":"move","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":3,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":2},"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":"2410.21795","arxiv_id_is_arxiv":true,"paper":"/paper/robot-policy-learning-with-temporal-optimal","title":"Robot Policy Learning with Temporal Optimal Transport Reward","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuyw/TemporalOT","path":"metaworld/policies/policy.py","file_url":"https://github.com/fuyw/TemporalOT/blob/HEAD/metaworld/policies/policy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fuyw/TemporalOT when it was checked","code_sha256":"b7e33fd81e3aa380","code_sha256_prefix":"b7e33fd81e3aa380","mcp_get_code":{"code_sha256":"b7e33fd81e3aa380"}},{"arxiv_id":"2407.14044","arxiv_id_is_arxiv":true,"paper":"/paper/ecco-can-we-improve-model-generated-code","title":"ECCO: Can We Improve Model-Generated Code Efficiency Without Sacrificing Functional Correctness?","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/DeepSpeed","path":"deepspeed/module_inject/auto_tp.py","file_url":"https://github.com/microsoft/DeepSpeed/blob/HEAD/deepspeed/module_inject/auto_tp.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":"7a2e41bee4f05c5a","code_sha256_prefix":"7a2e41bee4f05c5a","mcp_get_code":{"code_sha256":"7a2e41bee4f05c5a"}},{"arxiv_id":"2405.17477","arxiv_id_is_arxiv":true,"paper":"/paper/ollie-imitation-learning-from-offline","title":"OLLIE: Imitation Learning from Offline Pretraining to Online Finetuning","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"secury/optidice","path":"example_fourrooms.py","file_url":"https://github.com/secury/optidice/blob/HEAD/example_fourrooms.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, secury/optidice when it was checked","code_sha256":"4a2bd7bd68b877ce","code_sha256_prefix":"4a2bd7bd68b877ce","mcp_get_code":{"code_sha256":"4a2bd7bd68b877ce"}},{"arxiv_id":"2401.04429","arxiv_id_is_arxiv":true,"paper":"/paper/i-rebalance-personalized-vehicle","title":"i-Rebalance: Personalized Vehicle Repositioning for Supply Demand Balance","date":"2024-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Haoyang-Chen/i-Rebalance","path":"simulator/Experiments/RANDOM.py","file_url":"https://github.com/Haoyang-Chen/i-Rebalance/blob/HEAD/simulator/Experiments/RANDOM.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":"e7929a1429e9922d","code_sha256_prefix":"e7929a1429e9922d","mcp_get_code":{"code_sha256":"e7929a1429e9922d"}},{"arxiv_id":"2308.10467","arxiv_id_is_arxiv":true,"paper":"/paper/single-user-injection-for-invisible-shilling","title":"Single-User Injection for Invisible Shilling Attack against Recommender Systems","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdegroup/sui-attack","path":"utils.py","file_url":"https://github.com/kdegroup/sui-attack/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":"02e0131402c87afa","code_sha256_prefix":"02e0131402c87afa","mcp_get_code":{"code_sha256":"02e0131402c87afa"}},{"arxiv_id":"2106.09422","arxiv_id_is_arxiv":true,"paper":"/paper/cril-continual-robot-imitation-learning-via","title":"CRIL: Continual Robot Imitation Learning via Generative and Prediction Model","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HeegerGao/CRIL","path":"utils.py","file_url":"https://github.com/HeegerGao/CRIL/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":"5d1f899594df6882","code_sha256_prefix":"5d1f899594df6882","mcp_get_code":{"code_sha256":"5d1f899594df6882"}},{"arxiv_id":"1910.10897","arxiv_id_is_arxiv":true,"paper":"/paper/meta-world-a-benchmark-and-evaluation-for","title":"Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learning","date":"2019-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiwc/robotics-world","path":"metaworld/policies/policy.py","file_url":"https://github.com/yiwc/robotics-world/blob/HEAD/metaworld/policies/policy.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":"12487fb8bcdf3af8","code_sha256_prefix":"12487fb8bcdf3af8","mcp_get_code":{"code_sha256":"12487fb8bcdf3af8"}},{"arxiv_id":"1805.07470","arxiv_id_is_arxiv":true,"paper":"/paper/solving-the-rubiks-cube-without-human","title":"Solving the Rubik's Cube Without Human Knowledge","date":"2018-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkovalski/cs4995_cube","path":"adi.py","file_url":"https://github.com/mkovalski/cs4995_cube/blob/HEAD/adi.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, mkovalski/cs4995_cube when it was checked","code_sha256":"dd10cc6cef9c45ec","code_sha256_prefix":"dd10cc6cef9c45ec","mcp_get_code":{"code_sha256":"dd10cc6cef9c45ec"}}],"record_sha256":"23dfd2763254a779cf3adbbb2cbef75058d30e32f57344367f31ff174d9a4a74","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}