{"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/renormalize","entry":"renormalize","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":7,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":11,"n_places_pointer_only":5,"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":0,"ran_fixture":2,"ran":4,"unverified":0},"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":"2507.05394","arxiv_id_is_arxiv":true,"paper":"/paper/pfedmma-personalized-federated-fine-tuning","title":"pFedMMA: Personalized Federated Fine-Tuning with Multi-Modal Adapter for Vision-Language Models","date":"2025-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sajjad-ucsb/pfedmma","path":"datasplit.py","file_url":"https://github.com/sajjad-ucsb/pfedmma/blob/HEAD/datasplit.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, sajjad-ucsb/pfedmma when it was checked","code_sha256":"03564ffca35b29ce","code_sha256_prefix":"03564ffca35b29ce","mcp_get_code":{"code_sha256":"03564ffca35b29ce"}},{"arxiv_id":"2410.03119","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-aware-decision-making-with-ring","title":"Spatial-aware decision-making with ring attractors in reinforcement learning systems","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcosaura/RA_RL","path":"DL-RNN/EfficientZeroRA/core/model.py","file_url":"https://github.com/marcosaura/RA_RL/blob/HEAD/DL-RNN/EfficientZeroRA/core/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, marcosaura/RA_RL when it was checked","code_sha256":"fa63400bb2942968","code_sha256_prefix":"fa63400bb2942968","mcp_get_code":{"code_sha256":"fa63400bb2942968"}},{"arxiv_id":"2409.19610","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-from-vision-language","title":"Federated Learning from Vision-Language Foundation Models: Theoretical Analysis and Method","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PanBikang/PromptFolio","path":"datasplit.py","file_url":"https://github.com/PanBikang/PromptFolio/blob/HEAD/datasplit.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, PanBikang/PromptFolio when it was checked","code_sha256":"03564ffca35b29ce","code_sha256_prefix":"03564ffca35b29ce","mcp_get_code":{"code_sha256":"03564ffca35b29ce"}},{"arxiv_id":"2405.09771","arxiv_id_is_arxiv":true,"paper":"/paper/harmonizing-generalization-and","title":"Harmonizing Generalization and Personalization in Federated Prompt Learning","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyucuiovo/fedpgp","path":"datasplit.py","file_url":"https://github.com/tianyucuiovo/fedpgp/blob/HEAD/datasplit.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, tianyucuiovo/fedpgp when it was checked","code_sha256":"03564ffca35b29ce","code_sha256_prefix":"03564ffca35b29ce","mcp_get_code":{"code_sha256":"03564ffca35b29ce"}},{"arxiv_id":"2404.05440","arxiv_id_is_arxiv":true,"paper":"/paper/tree-search-based-policy-optimization-under","title":"Tree Search-Based Policy Optimization under Stochastic Execution Delay","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidva1/Delayed-EZ","path":"core/model.py","file_url":"https://github.com/davidva1/Delayed-EZ/blob/HEAD/core/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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, davidva1/Delayed-EZ, is not in the permissive set Syntology serves inline","code_sha256":"fa63400bb2942968","code_sha256_prefix":"fa63400bb2942968","mcp_get_code":{"code_sha256":"fa63400bb2942968"}},{"arxiv_id":"2304.13892","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-object-centric-generalized-value","title":"Discovering Object-Centric Generalized Value Functions From Pixels","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Somjit77/oc_gvfs","path":"slot_attention/sa_utils.py","file_url":"https://github.com/Somjit77/oc_gvfs/blob/HEAD/slot_attention/sa_utils.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":"58e7e6adb605babe","code_sha256_prefix":"58e7e6adb605babe","mcp_get_code":{"code_sha256":"58e7e6adb605babe"}},{"arxiv_id":"2304.10466","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-deep-reinforcement-learning","title":"Efficient Deep Reinforcement Learning Requires Regulating Overfitting","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evgenii-nikishin/rl_with_resets","path":"discrete_control/networks.py","file_url":"https://github.com/evgenii-nikishin/rl_with_resets/blob/HEAD/discrete_control/networks.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":"3692fa3a61b257cd","code_sha256_prefix":"3692fa3a61b257cd","mcp_get_code":{"code_sha256":"3692fa3a61b257cd"}},{"arxiv_id":"2210.10763","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-feasibility-of-cross-task-transfer","title":"On the Feasibility of Cross-Task Transfer with Model-Based Reinforcement Learning","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlpc-ucsd/xtra","path":"src/core/model.py","file_url":"https://github.com/mlpc-ucsd/xtra/blob/HEAD/src/core/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa63400bb2942968","code_sha256_prefix":"fa63400bb2942968","mcp_get_code":{"code_sha256":"fa63400bb2942968"}},{"arxiv_id":"2201.12096","arxiv_id_is_arxiv":true,"paper":"/paper/mask-based-latent-reconstruction-for","title":"Mask-based Latent Reconstruction for Reinforcement Learning","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Playvirtual","path":"Atari/src/models.py","file_url":"https://github.com/microsoft/Playvirtual/blob/HEAD/Atari/src/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa63400bb2942968","code_sha256_prefix":"fa63400bb2942968","mcp_get_code":{"code_sha256":"fa63400bb2942968"}},{"arxiv_id":"2009.09405","arxiv_id_is_arxiv":true,"paper":"/paper/scale-localized-abstract-reasoning","title":"Scale-Localized Abstract Reasoning","date":"2020-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanivbenny/MRNet","path":"src/trainer.py","file_url":"https://github.com/yanivbenny/MRNet/blob/HEAD/src/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00bd265c90d10459","code_sha256_prefix":"00bd265c90d10459","mcp_get_code":{"code_sha256":"00bd265c90d10459"}},{"arxiv_id":"1908.09453","arxiv_id_is_arxiv":true,"paper":"/paper/openspiel-a-framework-for-reinforcement","title":"OpenSpiel: A Framework for Reinforcement Learning in Games","date":"2019-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyz2368/open_spiel_egta","path":"open_spiel/python/algorithms/psro_variations/abstract_meta_trainer_egta.py","file_url":"https://github.com/wyz2368/open_spiel_egta/blob/HEAD/open_spiel/python/algorithms/psro_variations/abstract_meta_trainer_egta.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8469ed1452bc3dd0","code_sha256_prefix":"8469ed1452bc3dd0","mcp_get_code":{"code_sha256":"8469ed1452bc3dd0"}}],"record_sha256":"d19e7fd8117f751844758383a41be90f6d894ea5f58c608c3ba52c74b32e6ef2","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}