{"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/film","entry":"FiLM","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":8,"n_papers_ran_no_instrument_failure":8,"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":14,"n_samples_ran":10,"n_samples_constructed":4,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":7,"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":0,"ran":10,"unverified":4},"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.17127","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-17127","title":"Agentic Discovery of Non-Canonical Antimicrobial Peptides with AMPGAN v3","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"marszzibros/AMPGANv3","path":"training/models/lighting_module.py","file_url":"https://github.com/marszzibros/AMPGANv3/blob/HEAD/training/models/lighting_module.py","status":"ran","verification_level":1,"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, marszzibros/AMPGANv3 when it was checked","code_sha256":"f90ee9d288f6f968","code_sha256_prefix":"f90ee9d288f6f968","mcp_get_code":{"code_sha256":"f90ee9d288f6f968"}},{"arxiv_id":"2604.28102","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-28102","title":"FiLMMeD: Feature-wise Linear Modulation for Cross-Problem Multi-Depot Vehicle Routing","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"AJ-Correa/FiLMMeD","path":"CaDA/model.py","file_url":"https://github.com/AJ-Correa/FiLMMeD/blob/HEAD/CaDA/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24a8a3bcfe06b605","code_sha256_prefix":"24a8a3bcfe06b605","mcp_get_code":{"code_sha256":"24a8a3bcfe06b605"}},{"arxiv_id":"2603.04430","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04430","title":"Flowers: A Warp Drive for Neural PDE Solvers","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"t-muser/flowers","path":"flowers/models/flower.py","file_url":"https://github.com/t-muser/flowers/blob/HEAD/flowers/models/flower.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, t-muser/flowers (NOASSERTION)","code_sha256":"58124cf77de2534b","code_sha256_prefix":"58124cf77de2534b","mcp_get_code":{"code_sha256":"58124cf77de2534b"}},{"arxiv_id":"2603.00037","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00037","title":"StaTS: Spectral Trajectory Schedule Learning for Adaptive Time Series Forecasting with Frequency Guided Denoiser","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"zjt-gpu/StaTS","path":"src/models/StaTS.py","file_url":"https://github.com/zjt-gpu/StaTS/blob/HEAD/src/models/StaTS.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, zjt-gpu/StaTS when it was checked","code_sha256":"9b4f8d37863cd64c","code_sha256_prefix":"9b4f8d37863cd64c","mcp_get_code":{"code_sha256":"9b4f8d37863cd64c"}},{"arxiv_id":"2602.04307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-04307","title":"Universal Robust Speech Adaptation for Cross-Domain Speech Recognition and Enhancement","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"JethroWangSir/URSA-GAN","path":"UNA-GAN/models/networks.py","file_url":"https://github.com/JethroWangSir/URSA-GAN/blob/HEAD/UNA-GAN/models/networks.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, JethroWangSir/URSA-GAN when it was checked","code_sha256":"d901f27bc695ee7a","code_sha256_prefix":"d901f27bc695ee7a","mcp_get_code":{"code_sha256":"d901f27bc695ee7a"}},{"arxiv_id":"2301.13616","arxiv_id_is_arxiv":true,"paper":"/paper/anti-exploration-by-random-network","title":"Anti-Exploration by Random Network Distillation","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzmtsvv/sac_rnd","path":"rnd_modules.py","file_url":"https://github.com/zzmtsvv/sac_rnd/blob/HEAD/rnd_modules.py","status":"ran","verification_level":1,"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, zzmtsvv/sac_rnd when it was checked","code_sha256":"ceefac1ae561a6c3","code_sha256_prefix":"ceefac1ae561a6c3","mcp_get_code":{"code_sha256":"ceefac1ae561a6c3"}},{"arxiv_id":"2203.15332","arxiv_id_is_arxiv":true,"paper":"/paper/balanced-multimodal-learning-via-on-the-fly","title":"Balanced Multimodal Learning via On-the-fly Gradient Modulation","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeWu-Lab/OGM-GE_CVPR2022","path":"models/basic_model.py","file_url":"https://github.com/GeWu-Lab/OGM-GE_CVPR2022/blob/HEAD/models/basic_model.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":"713cd9da0b658745","code_sha256_prefix":"713cd9da0b658745","mcp_get_code":{"code_sha256":"713cd9da0b658745"}},{"arxiv_id":"2010.04237","arxiv_id_is_arxiv":true,"paper":"/paper/randomized-overdrive-neural-networks","title":"Randomized Overdrive Neural Networks","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csteinmetz1/ronn","path":"dev/ronn/condition.py","file_url":"https://github.com/csteinmetz1/ronn/blob/HEAD/dev/ronn/condition.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":"e8a61d0fde7b7205","code_sha256_prefix":"e8a61d0fde7b7205","mcp_get_code":{"code_sha256":"e8a61d0fde7b7205"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmnt-com/wavegrad","path":"src/wavegrad/model.py","file_url":"https://github.com/lmnt-com/wavegrad/blob/HEAD/src/wavegrad/model.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":"ebb0bb469802a389","code_sha256_prefix":"ebb0bb469802a389","mcp_get_code":{"code_sha256":"ebb0bb469802a389"}},{"arxiv_id":"1709.07871","arxiv_id_is_arxiv":true,"paper":"/paper/film-visual-reasoning-with-a-general","title":"FiLM: Visual Reasoning with a General Conditioning Layer","date":"2017-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keonlee9420/Daft-Exprt","path":"model/blocks.py","file_url":"https://github.com/keonlee9420/Daft-Exprt/blob/HEAD/model/blocks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bc5a2b1350c91ae2","code_sha256_prefix":"bc5a2b1350c91ae2","mcp_get_code":{"code_sha256":"bc5a2b1350c91ae2"}},{"arxiv_id":"1709.07871","arxiv_id_is_arxiv":true,"paper":"/paper/film-visual-reasoning-with-a-general","title":"FiLM: Visual Reasoning with a General Conditioning Layer","date":"2017-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CPJKU/audio_conditioned_unet","path":"audio_conditioned_unet/network.py","file_url":"https://github.com/CPJKU/audio_conditioned_unet/blob/HEAD/audio_conditioned_unet/network.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":"bd2e6b10e2f47993","code_sha256_prefix":"bd2e6b10e2f47993","mcp_get_code":{"code_sha256":"bd2e6b10e2f47993"}},{"arxiv_id":"1709.07871","arxiv_id_is_arxiv":true,"paper":"/paper/film-visual-reasoning-with-a-general","title":"FiLM: Visual Reasoning with a General Conditioning Layer","date":"2017-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanjperez/film","path":"vr/models/filmed_net.py","file_url":"https://github.com/ethanjperez/film/blob/HEAD/vr/models/filmed_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ethanjperez/film (NOASSERTION)","code_sha256":"b8723266db5e5556","code_sha256_prefix":"b8723266db5e5556","mcp_get_code":{"code_sha256":"b8723266db5e5556"}},{"arxiv_id":"1709.07871","arxiv_id_is_arxiv":true,"paper":"/paper/film-visual-reasoning-with-a-general","title":"FiLM: Visual Reasoning with a General Conditioning Layer","date":"2017-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caffeinism/film-pytorch","path":"networks.py","file_url":"https://github.com/caffeinism/film-pytorch/blob/HEAD/networks.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, caffeinism/film-pytorch when it was checked","code_sha256":"6d21918b730bc046","code_sha256_prefix":"6d21918b730bc046","mcp_get_code":{"code_sha256":"6d21918b730bc046"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b03e68ac41174cf","code_sha256_prefix":"4b03e68ac41174cf","mcp_get_code":{"code_sha256":"4b03e68ac41174cf"}}],"record_sha256":"6415801e3b68fccb5e31ee0c9b1f50c6d440f878b0c6c92611d6aa2353846dab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}