{"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/info","entry":"info","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":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":8,"n_samples_fingerprinted":2,"n_places":11,"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":1,"ran_fixture":0,"ran":2,"unverified":8},"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":"2605.22898","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c7c17652fbae0a3","code_sha256_prefix":"7c7c17652fbae0a3","mcp_get_code":{"code_sha256":"7c7c17652fbae0a3"}},{"arxiv_id":"2603.00099","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Analytics-Everywhere-Lab/neural-architecture-search when it was checked","code_sha256":"81c37f314aea5da1","code_sha256_prefix":"81c37f314aea5da1","mcp_get_code":{"code_sha256":"81c37f314aea5da1"}},{"arxiv_id":"2507.02843","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89a20dc71d860adc","code_sha256_prefix":"89a20dc71d860adc","mcp_get_code":{"code_sha256":"89a20dc71d860adc"}},{"arxiv_id":"2405.06312","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhiyuan-ning/GenerativeFL when it was checked","code_sha256":"0f0a1731b084356f","code_sha256_prefix":"0f0a1731b084356f","mcp_get_code":{"code_sha256":"0f0a1731b084356f"}},{"arxiv_id":"2307.14008","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NWPU-Li/AFFNet when it was checked","code_sha256":"cfe97b03566da974","code_sha256_prefix":"cfe97b03566da974","mcp_get_code":{"code_sha256":"cfe97b03566da974"}},{"arxiv_id":"2305.09235","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bvanbreugel/deep_generative_ensemble when it was checked","code_sha256":"3150dee7f480c2a8","code_sha256_prefix":"3150dee7f480c2a8","mcp_get_code":{"code_sha256":"3150dee7f480c2a8"}},{"arxiv_id":"2302.02662","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a01836a09eb71d45","code_sha256_prefix":"a01836a09eb71d45","mcp_get_code":{"code_sha256":"a01836a09eb71d45"}},{"arxiv_id":"2101.08152","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5664e29a5753d3d","code_sha256_prefix":"b5664e29a5753d3d","mcp_get_code":{"code_sha256":"b5664e29a5753d3d"}},{"arxiv_id":"1611.02779","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6665938be4c3f60c","code_sha256_prefix":"6665938be4c3f60c","mcp_get_code":{"code_sha256":"6665938be4c3f60c"}},{"arxiv_id":"ijcai2025_0949","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id 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":"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":"13662ebc85ff2b0d","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","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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":"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":"b5674105537be8aa","code_sha256_prefix":"b5674105537be8aa","mcp_get_code":{"code_sha256":"b5674105537be8aa"}}],"record_sha256":"047968aea67e72ba8f1f5440dd3f3bfaaf12d99925da0704b07c5e2ce8616b5b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}