{"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/llama-eval","entry":"llama_eval","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":6,"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":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":"2606.04980","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-04980","title":"AlphaQ: Calibration-Free Bit Allocation for Mixture-of-Experts Quantization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Superone77/AlphaQ","path":"eval_ppl_utils.py","file_url":"https://github.com/Superone77/AlphaQ/blob/HEAD/eval_ppl_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, Superone77/AlphaQ when it was checked","code_sha256":"834211043551ca7f","code_sha256_prefix":"834211043551ca7f","mcp_get_code":{"code_sha256":"834211043551ca7f"}},{"arxiv_id":"2605.15491","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15491","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Nota-NetsPresso/shortened-llm","path":"src/eval_ppl.py","file_url":"https://github.com/Nota-NetsPresso/shortened-llm/blob/HEAD/src/eval_ppl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Nota-NetsPresso/shortened-llm when it was checked","code_sha256":"9012ddbbaf4ee64f","code_sha256_prefix":"9012ddbbaf4ee64f","mcp_get_code":{"code_sha256":"9012ddbbaf4ee64f"}},{"arxiv_id":"2510.03267","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03267","title":"PT$^2$-LLM: Post-Training Ternarization for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"XIANGLONGYAN/PT2-LLM","path":"pt2_llm/eval_ppl.py","file_url":"https://github.com/XIANGLONGYAN/PT2-LLM/blob/HEAD/pt2_llm/eval_ppl.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":"7823347a3a40550c","code_sha256_prefix":"7823347a3a40550c","mcp_get_code":{"code_sha256":"7823347a3a40550c"}},{"arxiv_id":"2403.06082","arxiv_id_is_arxiv":true,"paper":"/paper/framequant-flexible-low-bit-quantization-for","title":"FrameQuant: Flexible Low-Bit Quantization for Transformers","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vsingh-group/framequant","path":"utils/eval_utils.py","file_url":"https://github.com/vsingh-group/framequant/blob/HEAD/utils/eval_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, vsingh-group/framequant when it was checked","code_sha256":"0f5810ef333bc3dc","code_sha256_prefix":"0f5810ef333bc3dc","mcp_get_code":{"code_sha256":"0f5810ef333bc3dc"}},{"arxiv_id":"2402.02834","arxiv_id_is_arxiv":true,"paper":"/paper/shortened-llama-a-simple-depth-pruning-for","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nota-netspresso/shortened-llm","path":"src/eval_ppl.py","file_url":"https://github.com/nota-netspresso/shortened-llm/blob/HEAD/src/eval_ppl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, nota-netspresso/shortened-llm when it was checked","code_sha256":"9012ddbbaf4ee64f","code_sha256_prefix":"9012ddbbaf4ee64f","mcp_get_code":{"code_sha256":"9012ddbbaf4ee64f"}},{"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/llama.py","file_url":"https://github.com/ist-daslab/quik/blob/HEAD/experiments/llama.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":"340f10d2f7201ee7","code_sha256_prefix":"340f10d2f7201ee7","mcp_get_code":{"code_sha256":"340f10d2f7201ee7"}}],"record_sha256":"ff687694c6453089c5b80b63ffcd9e5d486ab447282d4c493d95976beea875da","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}