{"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/prepare-model-for-training","entry":"prepare_model_for_training","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":5,"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":0,"ran_violates":0,"ran_draft_wrong":1,"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":"2407.07093","arxiv_id_is_arxiv":true,"paper":"/paper/fbi-llm-scaling-up-fully-binarized-llms-from","title":"FBI-LLM: Scaling Up Fully Binarized LLMs from Scratch via Autoregressive Distillation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liqunma/fbi-llm","path":"utils.py","file_url":"https://github.com/liqunma/fbi-llm/blob/HEAD/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, liqunma/fbi-llm when it was checked","code_sha256":"dfbbf527543890a1","code_sha256_prefix":"dfbbf527543890a1","mcp_get_code":{"code_sha256":"dfbbf527543890a1"}},{"arxiv_id":"2407.01851","arxiv_id_is_arxiv":true,"paper":"/paper/meerkat-audio-visual-large-language-model-for","title":"Meerkat: Audio-Visual Large Language Model for Grounding in Space and Time","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"schowdhury671/meerkat","path":"run_clm_llms.py","file_url":"https://github.com/schowdhury671/meerkat/blob/HEAD/run_clm_llms.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":"41e656ac2d002178","code_sha256_prefix":"41e656ac2d002178","mcp_get_code":{"code_sha256":"41e656ac2d002178"}},{"arxiv_id":"2406.16536","arxiv_id_is_arxiv":true,"paper":"/paper/c-llm-learn-to-check-chinese-spelling-errors","title":"C-LLM: Learn to Check Chinese Spelling Errors Character by Character","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ktlKTL/C-LLM","path":"llm_train_util.py","file_url":"https://github.com/ktlKTL/C-LLM/blob/HEAD/llm_train_util.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, ktlKTL/C-LLM when it was checked","code_sha256":"eb0a4d4f61101c5a","code_sha256_prefix":"eb0a4d4f61101c5a","mcp_get_code":{"code_sha256":"eb0a4d4f61101c5a"}},{"arxiv_id":"2311.07468","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-falling-in-a-middle-intelligence-trap","title":"An Analysis and Mitigation of the Reversal Curse","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trestad/mitigating-reversal-curse","path":"run_mlm.py","file_url":"https://github.com/trestad/mitigating-reversal-curse/blob/HEAD/run_mlm.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, trestad/mitigating-reversal-curse when it was checked","code_sha256":"d30fdeea401b3cc5","code_sha256_prefix":"d30fdeea401b3cc5","mcp_get_code":{"code_sha256":"d30fdeea401b3cc5"}},{"arxiv_id":"2310.00034","arxiv_id_is_arxiv":true,"paper":"/paper/pb-llm-partially-binarized-large-language","title":"PB-LLM: Partially Binarized Large Language Models","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahnyuan/binaryllm","path":"utils.py","file_url":"https://github.com/hahnyuan/binaryllm/blob/HEAD/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":"9fa7ef614ee2fada","code_sha256_prefix":"9fa7ef614ee2fada","mcp_get_code":{"code_sha256":"9fa7ef614ee2fada"}}],"record_sha256":"e7290929a501a8e226e8c82900b7751d51afe8bf359e1c7aba48c1982e246db5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}