{"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/ema-2","entry":"ema","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":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":12,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":7,"n_places":15,"n_places_pointer_only":3,"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":4,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":2},"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.08840","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08840","title":"ReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal Smoothing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"an-yongqi/rest-kv","path":"restkv/llama_model.py","file_url":"https://github.com/an-yongqi/rest-kv/blob/HEAD/restkv/llama_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88375ce705173d0e","code_sha256_prefix":"88375ce705173d0e","mcp_get_code":{"code_sha256":"88375ce705173d0e"}},{"arxiv_id":"2605.04507","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-04507","title":"Distilling Bayesian Belief States into Language Models for Auditable Negotiation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"kaneis1/CaSiNo_negotiation-agent","path":"src/casino_belief/evaluation/metrics.py","file_url":"https://github.com/kaneis1/CaSiNo_negotiation-agent/blob/HEAD/src/casino_belief/evaluation/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, kaneis1/CaSiNo_negotiation-agent (NOASSERTION)","code_sha256":"093bd02fd4d1be7c","code_sha256_prefix":"093bd02fd4d1be7c","mcp_get_code":{"code_sha256":"093bd02fd4d1be7c"}},{"arxiv_id":"2311.01489","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-causal-imitation-learning-for-1","title":"Invariant Causal Imitation Learning for Generalizable Policies","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ioanabica/invariant-causal-imitation-learning","path":"network/mine_network.py","file_url":"https://github.com/ioanabica/invariant-causal-imitation-learning/blob/HEAD/network/mine_network.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1073d8f05df7b5a","code_sha256_prefix":"a1073d8f05df7b5a","mcp_get_code":{"code_sha256":"a1073d8f05df7b5a"}},{"arxiv_id":"2310.16828","arxiv_id_is_arxiv":true,"paper":"/paper/td-mpc2-scalable-robust-world-models-for","title":"TD-MPC2: Scalable, Robust World Models for Continuous Control","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicklashansen/tdmpc","path":"src/algorithm/tdmpc.py","file_url":"https://github.com/nicklashansen/tdmpc/blob/HEAD/src/algorithm/tdmpc.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":"e39520f04bf0598d","code_sha256_prefix":"e39520f04bf0598d","mcp_get_code":{"code_sha256":"e39520f04bf0598d"}},{"arxiv_id":"2211.09760","arxiv_id_is_arxiv":true,"paper":"/paper/velo-training-versatile-learned-optimizers-by","title":"VeLO: Training Versatile Learned Optimizers by Scaling Up","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/learned_optimization","path":"learned_optimization/notebook_utils.py","file_url":"https://github.com/google/learned_optimization/blob/HEAD/learned_optimization/notebook_utils.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":"e6c862d84c69f94c","code_sha256_prefix":"e6c862d84c69f94c","mcp_get_code":{"code_sha256":"e6c862d84c69f94c"}},{"arxiv_id":"2108.12630","arxiv_id_is_arxiv":true,"paper":"/paper/groupformer-group-activity-recognition-with","title":"GroupFormer: Group Activity Recognition with Clustered Spatial-Temporal Transformer","date":"2021-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xueyee/GroupFormer","path":"group/models/cluster_transformer.py","file_url":"https://github.com/xueyee/GroupFormer/blob/HEAD/group/models/cluster_transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f70774c0916069a5","code_sha256_prefix":"f70774c0916069a5","mcp_get_code":{"code_sha256":"f70774c0916069a5"}},{"arxiv_id":"2105.14850","arxiv_id_is_arxiv":true,"paper":"/paper/cascaded-head-colliding-attention","title":"Cascaded Head-colliding Attention","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/fairseq","path":"fairseq/modules/kmeans_attention.py","file_url":"https://github.com/pytorch/fairseq/blob/HEAD/fairseq/modules/kmeans_attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"62b973828672478f","code_sha256_prefix":"62b973828672478f","mcp_get_code":{"code_sha256":"62b973828672478f"}},{"arxiv_id":"2010.14860","arxiv_id_is_arxiv":true,"paper":"/paper/the-evidence-lower-bound-of-variational","title":"The ELBO of Variational Autoencoders Converges to a Sum of Three Entropies","date":"2020-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learning-with-entropies/elbo-entropies-aistats23","path":"utils.py","file_url":"https://github.com/learning-with-entropies/elbo-entropies-aistats23/blob/HEAD/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":"419e916c07567d5b","code_sha256_prefix":"419e916c07567d5b","mcp_get_code":{"code_sha256":"419e916c07567d5b"}},{"arxiv_id":"2009.04416","arxiv_id_is_arxiv":true,"paper":"/paper/phasic-policy-gradient","title":"Phasic Policy Gradient","date":"2020-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/phasic-policy-gradient","path":"phasic_policy_gradient/graph_util.py","file_url":"https://github.com/openai/phasic-policy-gradient/blob/HEAD/phasic_policy_gradient/graph_util.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":"a362c435a091c0f4","code_sha256_prefix":"a362c435a091c0f4","mcp_get_code":{"code_sha256":"a362c435a091c0f4"}},{"arxiv_id":"1912.01588","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-procedural-generation-to-benchmark","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/train-procgen","path":"train_procgen/graph_util.py","file_url":"https://github.com/openai/train-procgen/blob/HEAD/train_procgen/graph_util.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":"a362c435a091c0f4","code_sha256_prefix":"a362c435a091c0f4","mcp_get_code":{"code_sha256":"a362c435a091c0f4"}},{"arxiv_id":"1801.04062","arxiv_id_is_arxiv":true,"paper":"/paper/mine-mutual-information-neural-estimation","title":"MINE: Mutual Information Neural Estimation","date":"2018-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a1073d8f05df7b5a","code_sha256_prefix":"a1073d8f05df7b5a","mcp_get_code":{"code_sha256":"a1073d8f05df7b5a"}},{"arxiv_id":"1703.04200","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-through-synaptic","title":"Continual Learning Through Synaptic Intelligence","date":"2017-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ganguli-lab/pathint","path":"pathint/utils.py","file_url":"https://github.com/ganguli-lab/pathint/blob/HEAD/pathint/utils.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":"8908090914518af0","code_sha256_prefix":"8908090914518af0","mcp_get_code":{"code_sha256":"8908090914518af0"}},{"arxiv_id":"1703.00810","arxiv_id_is_arxiv":true,"paper":"/paper/opening-the-black-box-of-deep-neural-networks","title":"Opening the Black Box of Deep Neural Networks via Information","date":"2017-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a1073d8f05df7b5a","code_sha256_prefix":"a1073d8f05df7b5a","mcp_get_code":{"code_sha256":"a1073d8f05df7b5a"}},{"arxiv_id":"1610.02242","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-ensembling-for-semi-supervised","title":"Temporal Ensembling for Semi-Supervised Learning","date":"2016-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"notha99y/mean_teacher_domain_adapt","path":"src/model.py","file_url":"https://github.com/notha99y/mean_teacher_domain_adapt/blob/HEAD/src/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":"88874fb38feaf13a","code_sha256_prefix":"88874fb38feaf13a","mcp_get_code":{"code_sha256":"88874fb38feaf13a"}},{"arxiv_id":"1606.03657","arxiv_id_is_arxiv":true,"paper":"/paper/infogan-interpretable-representation-learning","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","date":"2016-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtegner/mine-pytorch","path":"mine/models/mine.py","file_url":"https://github.com/gtegner/mine-pytorch/blob/HEAD/mine/models/mine.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1073d8f05df7b5a","code_sha256_prefix":"a1073d8f05df7b5a","mcp_get_code":{"code_sha256":"a1073d8f05df7b5a"}}],"record_sha256":"078f82c60c59c386863cf91e3a1095d62d58d29a0c3791251fe65b68251347cc","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}