{"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/assign-layers-to-gpus","entry":"assign_layers_to_gpus","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":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":0,"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":4,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"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":0,"ran_fixture":0,"ran":1,"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":"2506.03781","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.03781","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"OpenGVLab/OmniQuant","path":"parallel_utils.py","file_url":"https://github.com/OpenGVLab/OmniQuant/blob/HEAD/parallel_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Aaronhuang-778/SliM-LLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"7e3ef1ed347af0f3","code_sha256_prefix":"7e3ef1ed347af0f3","mcp_get_code":{"code_sha256":"7e3ef1ed347af0f3"}},{"arxiv_id":"2408.05646","arxiv_id_is_arxiv":true,"paper":"/paper/eigen-attention-attention-in-low-rank-space","title":"Eigen Attention: Attention in Low-Rank Space for KV Cache Compression","date":"2024-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utkarshsaxena1/eigenattn","path":"parallel_utils.py","file_url":"https://github.com/utkarshsaxena1/eigenattn/blob/HEAD/parallel_utils.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, utkarshsaxena1/eigenattn when it was checked","code_sha256":"c29fea147a883771","code_sha256_prefix":"c29fea147a883771","mcp_get_code":{"code_sha256":"c29fea147a883771"}},{"arxiv_id":"2405.14917","arxiv_id_is_arxiv":true,"paper":"/paper/slim-llm-salience-driven-mixed-precision","title":"SliM-LLM: Salience-Driven Mixed-Precision Quantization for Large Language Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aaronhuang-778/SliM-LLM","path":"slim-llm-plus/parallel_utils.py","file_url":"https://github.com/Aaronhuang-778/SliM-LLM/blob/HEAD/slim-llm-plus/parallel_utils.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, Aaronhuang-778/SliM-LLM when it was checked","code_sha256":"7e3ef1ed347af0f3","code_sha256_prefix":"7e3ef1ed347af0f3","mcp_get_code":{"code_sha256":"7e3ef1ed347af0f3"}},{"arxiv_id":"2403.12544","arxiv_id_is_arxiv":true,"paper":"/paper/affinequant-affine-transformation","title":"AffineQuant: Affine Transformation Quantization for Large Language Models","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/affinequant","path":"parallel_utils.py","file_url":"https://github.com/bytedance/affinequant/blob/HEAD/parallel_utils.py","status":"unverified","verification_level":0,"contract_check":null,"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 Aaronhuang-778/SliM-LLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"7e3ef1ed347af0f3","code_sha256_prefix":"7e3ef1ed347af0f3","mcp_get_code":{"code_sha256":"7e3ef1ed347af0f3"}},{"arxiv_id":"2310.08041","arxiv_id_is_arxiv":true,"paper":"/paper/qllm-accurate-and-efficient-low-bitwidth","title":"QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"modeltc/qllm","path":"parallel_utils.py","file_url":"https://github.com/modeltc/qllm/blob/HEAD/parallel_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":"b4401e4eaf52f123","code_sha256_prefix":"b4401e4eaf52f123","mcp_get_code":{"code_sha256":"b4401e4eaf52f123"}},{"arxiv_id":"2308.13137","arxiv_id_is_arxiv":true,"paper":"/paper/omniquant-omnidirectionally-calibrated","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/omniquant","path":"parallel_utils.py","file_url":"https://github.com/opengvlab/omniquant/blob/HEAD/parallel_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Aaronhuang-778/SliM-LLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"7e3ef1ed347af0f3","code_sha256_prefix":"7e3ef1ed347af0f3","mcp_get_code":{"code_sha256":"7e3ef1ed347af0f3"}},{"arxiv_id":"2304.01089","arxiv_id_is_arxiv":true,"paper":"/paper/rptq-reorder-based-post-training-quantization","title":"RPTQ: Reorder-based Post-training Quantization for Large Language Models","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahnyuan/rptq4llm","path":"parallel_utils.py","file_url":"https://github.com/hahnyuan/rptq4llm/blob/HEAD/parallel_utils.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":"716c9b4e71ec3424","code_sha256_prefix":"716c9b4e71ec3424","mcp_get_code":{"code_sha256":"716c9b4e71ec3424"}}],"record_sha256":"c12b580e37d1c72deebaee66fe1d13a930cb2681f642828aac2d6a3d5cf9e4aa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}