{"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/get-opt","entry":"get_opt","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":11,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":1,"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":7,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":12,"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":1,"unverified":5},"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":"2411.05282","arxiv_id_is_arxiv":true,"paper":"/paper/microscopiq-accelerating-foundational-models","title":"MicroScopiQ: Accelerating Foundational Models through Outlier-Aware Microscaling Quantization","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgia-tech-synergy-lab/microscopiq-llm-quantization","path":"llm/opt.py","file_url":"https://github.com/georgia-tech-synergy-lab/microscopiq-llm-quantization/blob/HEAD/llm/opt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"887f43fe08a6472d","code_sha256_prefix":"887f43fe08a6472d","mcp_get_code":{"code_sha256":"887f43fe08a6472d"}},{"arxiv_id":"2406.05981","arxiv_id_is_arxiv":true,"paper":"/paper/shiftaddllm-accelerating-pretrained-llms-via","title":"ShiftAddLLM: Accelerating Pretrained LLMs via Post-Training Multiplication-Less Reparameterization","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gatech-eic/shiftaddllm","path":"model/opt.py","file_url":"https://github.com/gatech-eic/shiftaddllm/blob/HEAD/model/opt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"887f43fe08a6472d","code_sha256_prefix":"887f43fe08a6472d","mcp_get_code":{"code_sha256":"887f43fe08a6472d"}},{"arxiv_id":"2402.17946","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-free-adaptive-global-pruning-for-pre","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BaiTheBest/SparseLLM","path":"model_utils.py","file_url":"https://github.com/BaiTheBest/SparseLLM/blob/HEAD/model_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":"ca396f6562e13af3","code_sha256_prefix":"ca396f6562e13af3","mcp_get_code":{"code_sha256":"ca396f6562e13af3"}},{"arxiv_id":"2310.09499","arxiv_id_is_arxiv":true,"paper":"/paper/one-shot-sensitivity-aware-mixed-sparsity","title":"One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"talkking/MixGPT","path":"opt.py","file_url":"https://github.com/talkking/MixGPT/blob/HEAD/opt.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, talkking/MixGPT when it was checked","code_sha256":"a0f5f02456fb742d","code_sha256_prefix":"a0f5f02456fb742d","mcp_get_code":{"code_sha256":"a0f5f02456fb742d"}},{"arxiv_id":"2310.09259","arxiv_id_is_arxiv":true,"paper":"/paper/towards-end-to-end-4-bit-inference-on","title":"QUIK: Towards End-to-End 4-Bit Inference on Generative Large Language Models","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/quik","path":"experiments/modelutils.py","file_url":"https://github.com/ist-daslab/quik/blob/HEAD/experiments/modelutils.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":"afa2292fc283853b","code_sha256_prefix":"afa2292fc283853b","mcp_get_code":{"code_sha256":"afa2292fc283853b"}},{"arxiv_id":"2310.09259","arxiv_id_is_arxiv":true,"paper":"/paper/towards-end-to-end-4-bit-inference-on","title":"QUIK: Towards End-to-End 4-Bit Inference on Generative Large Language Models","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/quik","path":"experiments/fake_quant/modelutils.py","file_url":"https://github.com/ist-daslab/quik/blob/HEAD/experiments/fake_quant/modelutils.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":"afe299403d03afcb","code_sha256_prefix":"afe299403d03afcb","mcp_get_code":{"code_sha256":"afe299403d03afcb"}},{"arxiv_id":"2307.13304","arxiv_id_is_arxiv":true,"paper":"/paper/quip-2-bit-quantization-of-large-language","title":"QuIP: 2-Bit Quantization of Large Language Models With Guarantees","date":"2023-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"887f43fe08a6472d","code_sha256_prefix":"887f43fe08a6472d","mcp_get_code":{"code_sha256":"887f43fe08a6472d"}},{"arxiv_id":"2301.00774","arxiv_id_is_arxiv":true,"paper":"/paper/massive-language-models-can-be-accurately","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","date":"2023-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"887f43fe08a6472d","code_sha256_prefix":"887f43fe08a6472d","mcp_get_code":{"code_sha256":"887f43fe08a6472d"}},{"arxiv_id":"2210.17323","arxiv_id_is_arxiv":true,"paper":"/paper/gptq-accurate-post-training-quantization-for","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IST-DASLab/gptq","path":"opt.py","file_url":"https://github.com/IST-DASLab/gptq/blob/HEAD/opt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"887f43fe08a6472d","code_sha256_prefix":"887f43fe08a6472d","mcp_get_code":{"code_sha256":"887f43fe08a6472d"}},{"arxiv_id":"openreview_d3RFDLBw01","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_d3RFDLBw01","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AI2C-Lab/STLA","path":"model_utils.py","file_url":"https://github.com/AI2C-Lab/STLA/blob/HEAD/model_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":"a83d9505d0f4a7ae","code_sha256_prefix":"a83d9505d0f4a7ae","mcp_get_code":{"code_sha256":"a83d9505d0f4a7ae"}},{"arxiv_id":"2025.findings-emnlp.1054","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-emnlp.1054","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IST-DASLab/sparsegpt","path":"opt.py","file_url":"https://github.com/IST-DASLab/sparsegpt/blob/HEAD/opt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"887f43fe08a6472d","code_sha256_prefix":"887f43fe08a6472d","mcp_get_code":{"code_sha256":"887f43fe08a6472d"}},{"arxiv_id":"2023.emnlp-main.892","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-main.892","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamsungLabs/Z-Fold","path":"opt.py","file_url":"https://github.com/SamsungLabs/Z-Fold/blob/HEAD/opt.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":"6353af0994dc9501","code_sha256_prefix":"6353af0994dc9501","mcp_get_code":{"code_sha256":"6353af0994dc9501"}}],"record_sha256":"6f297a2207127b3c6c011c729f51a3322d9be031defad9eebf5ed299be7e0e4f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}