{"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/transition","entry":"transition","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":16,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":12,"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":15,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":11,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":18,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":11,"ran_fixture":0,"ran":3,"unverified":1},"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":"2601.01677","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-01677","title":"Trustworthy Data-Driven Wildfire Risk Prediction and Understanding in Western Canada","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"SynUW/mmFire","path":"model_zoo/FiLM.py","file_url":"https://github.com/SynUW/mmFire/blob/HEAD/model_zoo/FiLM.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, SynUW/mmFire when it was checked","code_sha256":"c8733a0c39550140","code_sha256_prefix":"c8733a0c39550140","mcp_get_code":{"code_sha256":"c8733a0c39550140"}},{"arxiv_id":"2507.15774","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.15774","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"ARBrachet/PRO-DYN","path":"ts_benchmark/baselines/time_series_library/models/FiLM_DYN.py","file_url":"https://github.com/ARBrachet/PRO-DYN/blob/HEAD/ts_benchmark/baselines/time_series_library/models/FiLM_DYN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ARBrachet/PRO-DYN when it was checked","code_sha256":"c8733a0c39550140","code_sha256_prefix":"c8733a0c39550140","mcp_get_code":{"code_sha256":"c8733a0c39550140"}},{"arxiv_id":"2411.04165","arxiv_id_is_arxiv":true,"paper":"/paper/bio-xlstm-generative-modeling-representation","title":"Bio-xLSTM: Generative modeling, representation and in-context learning of biological and chemical sequences","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-jku/chem-xlstm","path":"chemxlstm/module_library/hippo.py","file_url":"https://github.com/ml-jku/chem-xlstm/blob/HEAD/chemxlstm/module_library/hippo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"34b2aa570368722c","code_sha256_prefix":"34b2aa570368722c","mcp_get_code":{"code_sha256":"34b2aa570368722c"}},{"arxiv_id":"2407.08751","arxiv_id_is_arxiv":true,"paper":"/paper/latent-diffusion-for-neural-spiking-data","title":"Latent Diffusion for Neural Spiking Data","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mackelab/LDNS","path":"ldns/networks/blocks.py","file_url":"https://github.com/mackelab/LDNS/blob/HEAD/ldns/networks/blocks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe900ba398d10d9d","code_sha256_prefix":"fe900ba398d10d9d","mcp_get_code":{"code_sha256":"fe900ba398d10d9d"}},{"arxiv_id":"2312.07335","arxiv_id_is_arxiv":true,"paper":"/paper/momentum-particle-maximum-likelihood","title":"Momentum Particle Maximum Likelihood","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jenninglim/mpgd","path":"src/algorithms/algorithms.py","file_url":"https://github.com/jenninglim/mpgd/blob/HEAD/src/algorithms/algorithms.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, jenninglim/mpgd when it was checked","code_sha256":"34ba0d7434ba4792","code_sha256_prefix":"34ba0d7434ba4792","mcp_get_code":{"code_sha256":"34ba0d7434ba4792"}},{"arxiv_id":"2307.07191","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarks-and-custom-package-for-electrical","title":"Benchmarks and Custom Package for Energy Forecasting","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leo-vk/proenfo","path":"models/FiLM.py","file_url":"https://github.com/leo-vk/proenfo/blob/HEAD/models/FiLM.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from ARBrachet/PRO-DYN, and GitHub detected no licence in that repository when it was checked","code_sha256":"c8733a0c39550140","code_sha256_prefix":"c8733a0c39550140","mcp_get_code":{"code_sha256":"c8733a0c39550140"}},{"arxiv_id":"2212.14052","arxiv_id_is_arxiv":true,"paper":"/paper/hungry-hungry-hippos-towards-language","title":"Hungry Hungry Hippos: Towards Language Modeling with State Space Models","date":"2022-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/safari","path":"src/models/sequence/h3.py","file_url":"https://github.com/hazyresearch/safari/blob/HEAD/src/models/sequence/h3.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93675235174e1ee4","code_sha256_prefix":"93675235174e1ee4","mcp_get_code":{"code_sha256":"93675235174e1ee4"}},{"arxiv_id":"2205.08897","arxiv_id_is_arxiv":true,"paper":"/paper/film-frequency-improved-legendre-memory-model","title":"FiLM: Frequency improved Legendre Memory Model for Long-term Time Series Forecasting","date":"2022-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-di-ml/neurips2022-film","path":"models/FiLM.py","file_url":"https://github.com/damo-di-ml/neurips2022-film/blob/HEAD/models/FiLM.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82ea253c64044e55","code_sha256_prefix":"82ea253c64044e55","mcp_get_code":{"code_sha256":"82ea253c64044e55"}},{"arxiv_id":"2204.01692","arxiv_id_is_arxiv":true,"paper":"/paper/long-movie-clip-classification-with-state","title":"Long Movie Clip Classification with State-Space Video Models","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"md-mohaiminul/ViS4mer","path":"models.py","file_url":"https://github.com/md-mohaiminul/ViS4mer/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"87ea80b70e1e70b9","code_sha256_prefix":"87ea80b70e1e70b9","mcp_get_code":{"code_sha256":"87ea80b70e1e70b9"}},{"arxiv_id":"2111.00396","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-modeling-long-sequences-with-1","title":"Efficiently Modeling Long Sequences with Structured State Spaces","date":"2021-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elgazzarr/fmri-s4","path":"src/models/sequence/ss/standalone/s4.py","file_url":"https://github.com/elgazzarr/fmri-s4/blob/HEAD/src/models/sequence/ss/standalone/s4.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81a948ed6d1a963f","code_sha256_prefix":"81a948ed6d1a963f","mcp_get_code":{"code_sha256":"81a948ed6d1a963f"}},{"arxiv_id":"2110.13985","arxiv_id_is_arxiv":true,"paper":"/paper/combining-recurrent-convolutional-and","title":"Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ag1988/dss","path":"src/models/sequence/ss/lssl.py","file_url":"https://github.com/ag1988/dss/blob/HEAD/src/models/sequence/ss/lssl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2cf5ff23ecfa3933","code_sha256_prefix":"2cf5ff23ecfa3933","mcp_get_code":{"code_sha256":"2cf5ff23ecfa3933"}},{"arxiv_id":"2110.13985","arxiv_id_is_arxiv":true,"paper":"/paper/combining-recurrent-convolutional-and","title":"Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/state-spaces","path":"src/models/sequence/modules/lssl.py","file_url":"https://github.com/hazyresearch/state-spaces/blob/HEAD/src/models/sequence/modules/lssl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed6e51bbefca2745","code_sha256_prefix":"ed6e51bbefca2745","mcp_get_code":{"code_sha256":"ed6e51bbefca2745"}},{"arxiv_id":"2110.11819","arxiv_id_is_arxiv":true,"paper":"/paper/break-your-bandit-routine-with-lsd-rewards-a","title":"A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giuliaclerici/lsd_bandits","path":"algo_tools.py","file_url":"https://github.com/giuliaclerici/lsd_bandits/blob/HEAD/algo_tools.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":"50446f0f16e7d61a","code_sha256_prefix":"50446f0f16e7d61a","mcp_get_code":{"code_sha256":"50446f0f16e7d61a"}},{"arxiv_id":"2009.09761","arxiv_id_is_arxiv":true,"paper":"/paper/diffwave-a-versatile-diffusion-model-for","title":"DiffWave: A Versatile Diffusion Model for Audio Synthesis","date":"2020-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertfgu/diffwave-sashimi","path":"models/sashimi.py","file_url":"https://github.com/albertfgu/diffwave-sashimi/blob/HEAD/models/sashimi.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3752f5434bff09e4","code_sha256_prefix":"3752f5434bff09e4","mcp_get_code":{"code_sha256":"3752f5434bff09e4"}},{"arxiv_id":"2008.07669","arxiv_id_is_arxiv":true,"paper":"/paper/hippo-recurrent-memory-with-optimal","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","date":"2020-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/hippo-code","path":"model/op.py","file_url":"https://github.com/HazyResearch/hippo-code/blob/HEAD/model/op.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82ea253c64044e55","code_sha256_prefix":"82ea253c64044e55","mcp_get_code":{"code_sha256":"82ea253c64044e55"}},{"arxiv_id":"2008.07669","arxiv_id_is_arxiv":true,"paper":"/paper/hippo-recurrent-memory-with-optimal","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","date":"2020-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/hippo-code","path":"tensorflow/hippo.py","file_url":"https://github.com/HazyResearch/hippo-code/blob/HEAD/tensorflow/hippo.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":"46b2822b9e5411e0","code_sha256_prefix":"46b2822b9e5411e0","mcp_get_code":{"code_sha256":"46b2822b9e5411e0"}},{"arxiv_id":"1805.00909","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-and-control-as","title":"Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review","date":"2018-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjoshi804/CS-267A-Final-Project","path":"agent_pyro.py","file_url":"https://github.com/sjoshi804/CS-267A-Final-Project/blob/HEAD/agent_pyro.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":"2bdf3e7607ea5496","code_sha256_prefix":"2bdf3e7607ea5496","mcp_get_code":{"code_sha256":"2bdf3e7607ea5496"}},{"arxiv_id":"1312.5602","arxiv_id_is_arxiv":true,"paper":"/paper/playing-atari-with-deep-reinforcement","title":"Playing Atari with Deep Reinforcement Learning","date":"2013-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"proroklab/popgym","path":"popgym/baselines/models/s4d.py","file_url":"https://github.com/proroklab/popgym/blob/HEAD/popgym/baselines/models/s4d.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d613b8ca99bc2295","code_sha256_prefix":"d613b8ca99bc2295","mcp_get_code":{"code_sha256":"d613b8ca99bc2295"}}],"record_sha256":"ae23df5065f310cbddb7b3dd47c67ebbaa681cc2201bc72a5c475cfe13fdf070","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}