{"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/check-args-torchrun-main","entry":"check_args_torchrun_main","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":5,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"n_places_pointer_only_link_open":3,"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":2,"ran_fixture":0,"ran":0,"unverified":3},"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":"2512.07112","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-07112","title":"FOAM: Blocked State Folding for Memory-Efficient LLM Training","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"zqOuO/FOAM","path":"peft_pretraining/args_utils.py","file_url":"https://github.com/zqOuO/FOAM/blob/HEAD/peft_pretraining/args_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, zqOuO/FOAM when it was checked","code_sha256":"c233d4777fc58003","code_sha256_prefix":"c233d4777fc58003","mcp_get_code":{"code_sha256":"c233d4777fc58003"}},{"arxiv_id":"2412.05270","arxiv_id_is_arxiv":true,"paper":"/paper/apollo-sgd-like-memory-adamw-level","title":"APOLLO: SGD-like Memory, AdamW-level Performance","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuhanqing/APOLLO","path":"utils/argparse.py","file_url":"https://github.com/zhuhanqing/APOLLO/blob/HEAD/utils/argparse.py","status":"unverified","verification_level":0,"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, zhuhanqing/APOLLO (NOASSERTION)","code_sha256":"2cdd377d5ff74882","code_sha256_prefix":"2cdd377d5ff74882","mcp_get_code":{"code_sha256":"2cdd377d5ff74882"}},{"arxiv_id":"2411.07837","arxiv_id_is_arxiv":true,"paper":"/paper/frugal-memory-efficient-optimization-by","title":"FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Training","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fzmushko/frugal","path":"utils/args_utils.py","file_url":"https://github.com/fzmushko/frugal/blob/HEAD/utils/args_utils.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":"be7fc68fbf7d7bd7","code_sha256_prefix":"be7fc68fbf7d7bd7","mcp_get_code":{"code_sha256":"be7fc68fbf7d7bd7"}},{"arxiv_id":"2408.12857","arxiv_id_is_arxiv":true,"paper":"/paper/memory-efficient-llm-training-with-online","title":"Memory-Efficient LLM Training with Online Subspace Descent","date":"2024-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyleliang919/online-subspace-descent","path":"peft_pretraining/args_utils.py","file_url":"https://github.com/kyleliang919/online-subspace-descent/blob/HEAD/peft_pretraining/args_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zqOuO/FOAM, and GitHub detected no licence in that repository when it was checked","code_sha256":"c233d4777fc58003","code_sha256_prefix":"c233d4777fc58003","mcp_get_code":{"code_sha256":"c233d4777fc58003"}},{"arxiv_id":"2407.08296","arxiv_id_is_arxiv":true,"paper":"/paper/q-galore-quantized-galore-with-int4","title":"Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradients","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaweizzhao/galore","path":"peft_pretraining/args_utils.py","file_url":"https://github.com/jiaweizzhao/galore/blob/HEAD/peft_pretraining/args_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zqOuO/FOAM, and GitHub detected no licence in that repository when it was checked","code_sha256":"c233d4777fc58003","code_sha256_prefix":"c233d4777fc58003","mcp_get_code":{"code_sha256":"c233d4777fc58003"}},{"arxiv_id":"2407.08296","arxiv_id_is_arxiv":true,"paper":"/paper/q-galore-quantized-galore-with-int4","title":"Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradients","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/Q-GaLore","path":"peft_pretraining/args_utils.py","file_url":"https://github.com/VITA-Group/Q-GaLore/blob/HEAD/peft_pretraining/args_utils.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":"8a11e25793ae28fa","code_sha256_prefix":"8a11e25793ae28fa","mcp_get_code":{"code_sha256":"8a11e25793ae28fa"}},{"arxiv_id":"2406.02214","arxiv_id_is_arxiv":true,"paper":"/paper/sltrain-a-sparse-plus-low-rank-approach-for","title":"SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretraining","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyjm3/SLTrain","path":"peft_pretraining/args_utils.py","file_url":"https://github.com/andyjm3/SLTrain/blob/HEAD/peft_pretraining/args_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zqOuO/FOAM, and GitHub detected no licence in that repository when it was checked","code_sha256":"c233d4777fc58003","code_sha256_prefix":"c233d4777fc58003","mcp_get_code":{"code_sha256":"c233d4777fc58003"}},{"arxiv_id":"2307.05695","arxiv_id_is_arxiv":true,"paper":"/paper/stack-more-layers-differently-high-rank","title":"ReLoRA: High-Rank Training Through Low-Rank Updates","date":"2023-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guitaricet/peft_pretraining","path":"peft_pretraining/args_utils.py","file_url":"https://github.com/guitaricet/peft_pretraining/blob/HEAD/peft_pretraining/args_utils.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":"986b5739285a8cbf","code_sha256_prefix":"986b5739285a8cbf","mcp_get_code":{"code_sha256":"986b5739285a8cbf"}}],"record_sha256":"0f5f3952ae11be36f2de1827fe94bd5bf9cdbc036e3c2366b4d3df66f7c4e720","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}