{"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/divide","entry":"divide","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":14,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":3,"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":10,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":7,"n_places":14,"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":2,"ran_violates":1,"ran_draft_wrong":2,"ran_fixture":1,"ran":2,"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.10335","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10335","title":"PowerStep: Memory-Efficient Adaptive Optimization via ℓ p -Norm Steepest Descent","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yaolubrain/PowerStep","path":"megatron/core/utils.py","file_url":"https://github.com/yaolubrain/PowerStep/blob/HEAD/megatron/core/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, yaolubrain/PowerStep when it was checked","code_sha256":"33de97c702d46371","code_sha256_prefix":"33de97c702d46371","mcp_get_code":{"code_sha256":"33de97c702d46371"}},{"arxiv_id":"2505.13211","arxiv_id_is_arxiv":true,"paper":"/paper/magi-1-autoregressive-video-generation-at","title":"MAGI-1: Autoregressive Video Generation at Scale","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sandai-org/magi-1","path":"inference/common/common_utils.py","file_url":"https://github.com/sandai-org/magi-1/blob/HEAD/inference/common/common_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54e6e277fc00c617","code_sha256_prefix":"54e6e277fc00c617","mcp_get_code":{"code_sha256":"54e6e277fc00c617"}},{"arxiv_id":"2411.07107","arxiv_id_is_arxiv":true,"paper":"/paper/training-neural-networks-as-recognizers-of","title":"Training Neural Networks as Recognizers of Formal Languages","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rycolab/neural-network-recognizers","path":"src/recognizers/analysis/plot_cross_entropy_vs_num_edits.py","file_url":"https://github.com/rycolab/neural-network-recognizers/blob/HEAD/src/recognizers/analysis/plot_cross_entropy_vs_num_edits.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab34813074cc49bf","code_sha256_prefix":"ab34813074cc49bf","mcp_get_code":{"code_sha256":"ab34813074cc49bf"}},{"arxiv_id":"2410.06634","arxiv_id_is_arxiv":true,"paper":"/paper/tree-of-problems-improving-structured-problem","title":"Tree of Problems: Improving structured problem solving with compositionality","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ArmelRandy/tree-of-problems","path":"top/divide.py","file_url":"https://github.com/ArmelRandy/tree-of-problems/blob/HEAD/top/divide.py","status":"unverified","verification_level":0,"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":"d945e94523780ec5","code_sha256_prefix":"d945e94523780ec5","mcp_get_code":{"code_sha256":"d945e94523780ec5"}},{"arxiv_id":"2406.11257","arxiv_id_is_arxiv":true,"paper":"/paper/excp-extreme-llm-checkpoint-compression-via","title":"ExCP: Extreme LLM Checkpoint Compression via Weight-Momentum Joint Shrinking","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaffey/excp","path":"LMtrainer/mpu/utils.py","file_url":"https://github.com/gaffey/excp/blob/HEAD/LMtrainer/mpu/utils.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":"33de97c702d46371","code_sha256_prefix":"33de97c702d46371","mcp_get_code":{"code_sha256":"33de97c702d46371"}},{"arxiv_id":"2406.10209","arxiv_id_is_arxiv":true,"paper":"/paper/be-like-a-goldfish-don-t-memorize-mitigating","title":"Be like a Goldfish, Don't Memorize! Mitigating Memorization in Generative LLMs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahans30/goldfish-loss","path":"axonn_fabric/fabric.py","file_url":"https://github.com/ahans30/goldfish-loss/blob/HEAD/axonn_fabric/fabric.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":"b38ee8cd162d2d61","code_sha256_prefix":"b38ee8cd162d2d61","mcp_get_code":{"code_sha256":"b38ee8cd162d2d61"}},{"arxiv_id":"2404.03608","arxiv_id_is_arxiv":true,"paper":"/paper/sailor-open-language-models-for-south-east","title":"Sailor: Open Language Models for South-East Asia","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfllm/megatron-llm","path":"megatron/core/utils.py","file_url":"https://github.com/epfllm/megatron-llm/blob/HEAD/megatron/core/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, epfllm/megatron-llm when it was checked","code_sha256":"33de97c702d46371","code_sha256_prefix":"33de97c702d46371","mcp_get_code":{"code_sha256":"33de97c702d46371"}},{"arxiv_id":"2402.13144","arxiv_id_is_arxiv":true,"paper":"/paper/neural-network-diffusion","title":"Neural Network Diffusion","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nus-hpc-ai-lab/neural-network-diffusion","path":"workspace/ensemble.py","file_url":"https://github.com/nus-hpc-ai-lab/neural-network-diffusion/blob/HEAD/workspace/ensemble.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, nus-hpc-ai-lab/neural-network-diffusion when it was checked","code_sha256":"e71aa8dc6a57287b","code_sha256_prefix":"e71aa8dc6a57287b","mcp_get_code":{"code_sha256":"e71aa8dc6a57287b"}},{"arxiv_id":"2209.02970","arxiv_id_is_arxiv":true,"paper":"/paper/fengshenbang-1-0-being-the-foundation-of","title":"Fengshenbang 1.0: Being the Foundation of Chinese Cognitive Intelligence","date":"2022-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-ccnl/fengshenbang-lm","path":"fengshen/models/DAVAE/GPT2ModelForLatent.py","file_url":"https://github.com/idea-ccnl/fengshenbang-lm/blob/HEAD/fengshen/models/DAVAE/GPT2ModelForLatent.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":"33de97c702d46371","code_sha256_prefix":"33de97c702d46371","mcp_get_code":{"code_sha256":"33de97c702d46371"}},{"arxiv_id":"2206.04496","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-modality-collapse-in-multimodal","title":"Mitigating Modality Collapse in Multimodal VAEs via Impartial Optimization","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adrianjav/impartial-vaes","path":"heterogeneous/torchmoo/mtl.py","file_url":"https://github.com/adrianjav/impartial-vaes/blob/HEAD/heterogeneous/torchmoo/mtl.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":"d68a00f830d4ed18","code_sha256_prefix":"d68a00f830d4ed18","mcp_get_code":{"code_sha256":"d68a00f830d4ed18"}},{"arxiv_id":"2203.15827","arxiv_id_is_arxiv":true,"paper":"/paper/linkbert-pretraining-language-models-with","title":"LinkBERT: Pretraining Language Models with Document Links","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michiyasunaga/LinkBERT","path":"src/seqcls/utils_hoc.py","file_url":"https://github.com/michiyasunaga/LinkBERT/blob/HEAD/src/seqcls/utils_hoc.py","status":"unverified","verification_level":0,"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":"c2cd56888edff13a","code_sha256_prefix":"c2cd56888edff13a","mcp_get_code":{"code_sha256":"c2cd56888edff13a"}},{"arxiv_id":"2106.11927","arxiv_id_is_arxiv":true,"paper":"/paper/any-equation-is-a-forest-symbolic-genetic","title":"Any equation is a forest: Symbolic genetic algorithm for discovering open-form partial differential equations (SGA-PDE)","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuntianChen/SGA-PDE","path":"codes/configure.py","file_url":"https://github.com/YuntianChen/SGA-PDE/blob/HEAD/codes/configure.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6fbd09210e67c4a","code_sha256_prefix":"c6fbd09210e67c4a","mcp_get_code":{"code_sha256":"c6fbd09210e67c4a"}},{"arxiv_id":"2103.02631","arxiv_id_is_arxiv":true,"paper":"/paper/rotograd-dynamic-gradient-homogenization-for-1","title":"RotoGrad: Gradient Homogenization in Multitask Learning","date":"2021-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adrianjav/rotograd","path":"rotograd/rotograd.py","file_url":"https://github.com/adrianjav/rotograd/blob/HEAD/rotograd/rotograd.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, adrianjav/rotograd when it was checked","code_sha256":"3f26bd1327c42c88","code_sha256_prefix":"3f26bd1327c42c88","mcp_get_code":{"code_sha256":"3f26bd1327c42c88"}},{"arxiv_id":"1909.08053","arxiv_id_is_arxiv":true,"paper":"/paper/megatron-lm-training-multi-billion-parameter","title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","date":"2019-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qhduan/CPM-LM-TF2","path":"CPM-Generate/mpu/transformer.py","file_url":"https://github.com/qhduan/CPM-LM-TF2/blob/HEAD/CPM-Generate/mpu/transformer.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":"33de97c702d46371","code_sha256_prefix":"33de97c702d46371","mcp_get_code":{"code_sha256":"33de97c702d46371"}}],"record_sha256":"6a497ff763c7d5f156d2729952da8debe467c990ce8db9fca264d4a2223a8bc8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}