{"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/log-mean","entry":"log_mean","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":6,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":7,"n_places_pointer_only":2,"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":5,"ran_fixture":0,"ran":0,"unverified":0},"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.06615","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-06615","title":"When and Why SignSGD Outperforms SGD: A Theoretical Study Based on ℓ 1 -norm Lower Bounds","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"epfml/llm-optimizer-benchmark","path":"src/models/moe.py","file_url":"https://github.com/epfml/llm-optimizer-benchmark/blob/HEAD/src/models/moe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f520af81f2675ca","code_sha256_prefix":"2f520af81f2675ca","mcp_get_code":{"code_sha256":"2f520af81f2675ca"}},{"arxiv_id":"2602.07425","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07425","title":"Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise","date":"2026-02-07","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"Dingzhen230/Heavy-tailed-Noise-in-LLMs","path":"src/models/moe.py","file_url":"https://github.com/Dingzhen230/Heavy-tailed-Noise-in-LLMs/blob/HEAD/src/models/moe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Dingzhen230/Heavy-tailed-Noise-in-LLMs when it was checked","code_sha256":"2f520af81f2675ca","code_sha256_prefix":"2f520af81f2675ca","mcp_get_code":{"code_sha256":"2f520af81f2675ca"}},{"arxiv_id":"2507.09924","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.09924","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"LouisDo2108/MixLoRA-DSI","path":"t5_pretrainer/mixlora_varigrow.py","file_url":"https://github.com/LouisDo2108/MixLoRA-DSI/blob/HEAD/t5_pretrainer/mixlora_varigrow.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LouisDo2108/MixLoRA-DSI when it was checked","code_sha256":"21945b8322407983","code_sha256_prefix":"21945b8322407983","mcp_get_code":{"code_sha256":"21945b8322407983"}},{"arxiv_id":"2507.09846","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.09846","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"epfml/llm-baselines","path":"src/models/moe.py","file_url":"https://github.com/epfml/llm-baselines/blob/HEAD/src/models/moe.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":"2f520af81f2675ca","code_sha256_prefix":"2f520af81f2675ca","mcp_get_code":{"code_sha256":"2f520af81f2675ca"}},{"arxiv_id":"2405.16039","arxiv_id_is_arxiv":true,"paper":"/paper/moeut-mixture-of-experts-universal","title":"MoEUT: Mixture-of-Experts Universal Transformers","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobertCsordas/moeut","path":"moeut/moeut.py","file_url":"https://github.com/RobertCsordas/moeut/blob/HEAD/moeut/moeut.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c2e388041e7bc2a","code_sha256_prefix":"7c2e388041e7bc2a","mcp_get_code":{"code_sha256":"7c2e388041e7bc2a"}},{"arxiv_id":"2405.16039","arxiv_id_is_arxiv":true,"paper":"/paper/moeut-mixture-of-experts-universal","title":"MoEUT: Mixture-of-Experts Universal Transformers","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robertcsordas/moeut","path":"moeut/moeut.py","file_url":"https://github.com/robertcsordas/moeut/blob/HEAD/moeut/moeut.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":"fc01cf39e7777e3a","code_sha256_prefix":"fc01cf39e7777e3a","mcp_get_code":{"code_sha256":"fc01cf39e7777e3a"}},{"arxiv_id":"2310.10837","arxiv_id_is_arxiv":true,"paper":"/paper/approximating-two-layer-feedforward-networks","title":"Approximating Two-Layer Feedforward Networks for Efficient Transformers","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robertcsordas/moe_layer","path":"cuda_src/moe_layer/moe_layer_simple.py","file_url":"https://github.com/robertcsordas/moe_layer/blob/HEAD/cuda_src/moe_layer/moe_layer_simple.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c6f6a2ff952ad85","code_sha256_prefix":"0c6f6a2ff952ad85","mcp_get_code":{"code_sha256":"0c6f6a2ff952ad85"}}],"record_sha256":"a9728cb072af763030622c62874168f88697dcaf04949de510edc1ffb8d471e1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}