{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/info","entry":"info","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":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":11,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":10},"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":"2605.22898","paper":"/paper/arxiv-2605-22898","title":"FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hedjrachid/FIRMA","path":"fibfl/fibfl.py","file_url":"https://github.com/Hedjrachid/FIRMA/blob/HEAD/fibfl/fibfl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c7c17652fbae0a3","mcp_get_code":{"code_sha256":"7c7c17652fbae0a3"}},{"arxiv_id":"2603.00099","paper":"/paper/arxiv-2603-00099","title":"SEval-NAS: A Search-Agnostic Evaluation for Neural Architecture Search","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Analytics-Everywhere-Lab/neural-architecture-search","path":"Comparisons/FreeREA/nas_utils_modified.py","file_url":"https://github.com/Analytics-Everywhere-Lab/neural-architecture-search/blob/HEAD/Comparisons/FreeREA/nas_utils_modified.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"81c37f314aea5da1","mcp_get_code":{"code_sha256":"81c37f314aea5da1"}},{"arxiv_id":"2507.02843","paper":null,"title":"arXiv:2507.02843","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"AliciaCurth/CATENets","path":"catenets/models/jax/disentangled_nets.py","file_url":"https://github.com/AliciaCurth/CATENets/blob/HEAD/catenets/models/jax/disentangled_nets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"89a20dc71d860adc","mcp_get_code":{"code_sha256":"89a20dc71d860adc"}},{"arxiv_id":"2405.06312","paper":"/paper/fedgcs-a-generative-framework-for-efficient","title":"FedGCS: A Generative Framework for Efficient Client Selection in Federated Learning via Gradient-based Optimization","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiyuan-ning/GenerativeFL","path":"autos/model.py","file_url":"https://github.com/zhiyuan-ning/GenerativeFL/blob/HEAD/autos/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0f0a1731b084356f","mcp_get_code":{"code_sha256":"0f0a1731b084356f"}},{"arxiv_id":"2307.14008","paper":"/paper/adaptive-frequency-filters-as-efficient","title":"Adaptive Frequency Filters As Efficient Global Token Mixers","date":"2023-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NWPU-Li/AFFNet","path":"aff_block_LL.py","file_url":"https://github.com/NWPU-Li/AFFNet/blob/HEAD/aff_block_LL.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cfe97b03566da974","mcp_get_code":{"code_sha256":"cfe97b03566da974"}},{"arxiv_id":"2305.09235","paper":"/paper/synthetic-data-real-errors-how-not-to-publish","title":"Synthetic data, real errors: how (not) to publish and use synthetic data","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bvanbreugel/deep_generative_ensemble","path":"DGE_utils.py","file_url":"https://github.com/bvanbreugel/deep_generative_ensemble/blob/HEAD/DGE_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3150dee7f480c2a8","mcp_get_code":{"code_sha256":"3150dee7f480c2a8"}},{"arxiv_id":"2302.02662","paper":"/paper/grounding-large-language-models-in","title":"Grounding Large Language Models in Interactive Environments with Online Reinforcement Learning","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flowersteam/grounding_llms_with_online_rl","path":"experiments/agents/ppo/llm_ppo_agent.py","file_url":"https://github.com/flowersteam/grounding_llms_with_online_rl/blob/HEAD/experiments/agents/ppo/llm_ppo_agent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a01836a09eb71d45","mcp_get_code":{"code_sha256":"a01836a09eb71d45"}},{"arxiv_id":"2101.08152","paper":"/paper/rank-the-episodes-a-simple-approach-for-1","title":"Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated Environments","date":"2021-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aklein1995/exploration_sil_im","path":"rapid/rapid_agent.py","file_url":"https://github.com/aklein1995/exploration_sil_im/blob/HEAD/rapid/rapid_agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5664e29a5753d3d","mcp_get_code":{"code_sha256":"b5664e29a5753d3d"}},{"arxiv_id":"1611.02779","paper":"/paper/rl2-fast-reinforcement-learning-via-slow","title":"RL$^2$: Fast Reinforcement Learning via Slow Reinforcement Learning","date":"2016-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aliengirlliv/teachable","path":"algos/ppo.py","file_url":"https://github.com/aliengirlliv/teachable/blob/HEAD/algos/ppo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6665938be4c3f60c","mcp_get_code":{"code_sha256":"6665938be4c3f60c"}},{"arxiv_id":"ijcai2025_0949","paper":null,"title":"arXiv:ijcai2025_0949","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RDLLab/pomdp-py-porpp","path":"pomdp_py/utils/typ.py","file_url":"https://github.com/RDLLab/pomdp-py-porpp/blob/HEAD/pomdp_py/utils/typ.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"13662ebc85ff2b0d","mcp_get_code":{"code_sha256":"13662ebc85ff2b0d"}},{"arxiv_id":"Fu_SACoD_Sensor_Algorithm_Co-Design_Towards_Efficient_CNN-Powered_Intelligent_PhlatCam_ICCV_2021_paper","paper":null,"title":"arXiv:Fu_SACoD_Sensor_Algorithm_Co-Design_Towards_Efficient_CNN-Powered_Intelligent_PhlatCam_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RICE-EIC/SACoD","path":"get_arch.py","file_url":"https://github.com/RICE-EIC/SACoD/blob/HEAD/get_arch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5674105537be8aa","mcp_get_code":{"code_sha256":"b5674105537be8aa"}}]}