{"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/extract-alpaca-dataset","entry":"extract_alpaca_dataset","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":10,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"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":2,"ran_fixture":0,"ran":0,"unverified":0},"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":"2602.01027","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01027","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Nkniexin/SFMP","path":"EfficientQAT/datautils_e2e.py","file_url":"https://github.com/Nkniexin/SFMP/blob/HEAD/EfficientQAT/datautils_e2e.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Nkniexin/SFMP when it was checked","code_sha256":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2506.18879","arxiv_id_is_arxiv":true,"paper":"/paper/commvq-commutative-vector-quantization-for-kv","title":"CommVQ: Commutative Vector Quantization for KV Cache Compression","date":"2025-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umass-embodied-agi/commvq","path":"training/collect_kv.py","file_url":"https://github.com/umass-embodied-agi/commvq/blob/HEAD/training/collect_kv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, umass-embodied-agi/commvq when it was checked","code_sha256":"d5b4e9532556f45d","code_sha256_prefix":"d5b4e9532556f45d","mcp_get_code":{"code_sha256":"d5b4e9532556f45d"}},{"arxiv_id":"2412.01129","arxiv_id_is_arxiv":true,"paper":"/paper/rilq-rank-insensitive-lora-based-quantization","title":"RILQ: Rank-Insensitive LoRA-based Quantization Error Compensation for Boosting 2-bit Large Language Model Accuracy","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiha-lab/rilq","path":"rilq_utils/calib_data_loader.py","file_url":"https://github.com/aiha-lab/rilq/blob/HEAD/rilq_utils/calib_data_loader.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":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2407.11062","arxiv_id_is_arxiv":true,"paper":"/paper/efficientqat-efficient-quantization-aware","title":"EfficientQAT: Efficient Quantization-Aware Training for Large Language Models","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/efficientqat","path":"datautils_e2e.py","file_url":"https://github.com/opengvlab/efficientqat/blob/HEAD/datautils_e2e.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":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2401.02385","arxiv_id_is_arxiv":true,"paper":"/paper/tinyllama-an-open-source-small-language-model","title":"TinyLlama: An Open-Source Small Language Model","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzhang38/tinyllama","path":"sft/finetune.py","file_url":"https://github.com/jzhang38/tinyllama/blob/HEAD/sft/finetune.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":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2308.07269","arxiv_id_is_arxiv":true,"paper":"/paper/easyedit-an-easy-to-use-knowledge-editing","title":"EasyEdit: An Easy-to-use Knowledge Editing Framework for Large Language Models","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/knowlm","path":"finetune/qlora/dataset.py","file_url":"https://github.com/zjunlp/knowlm/blob/HEAD/finetune/qlora/dataset.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":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2307.09288","arxiv_id_is_arxiv":true,"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Dromedary","path":"training/data_utils_sft.py","file_url":"https://github.com/IBM/Dromedary/blob/HEAD/training/data_utils_sft.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, IBM/Dromedary, is not in the permissive set Syntology serves inline","code_sha256":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2305.16300","arxiv_id_is_arxiv":true,"paper":"/paper/landmark-attention-random-access-infinite","title":"Landmark Attention: Random-Access Infinite Context Length for Transformers","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eugenepentland/landmark-attention-qlora","path":"llama/train_qlora.py","file_url":"https://github.com/eugenepentland/landmark-attention-qlora/blob/HEAD/llama/train_qlora.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":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2305.14314","arxiv_id_is_arxiv":true,"paper":"/paper/qlora-efficient-finetuning-of-quantized-llms","title":"QLoRA: Efficient Finetuning of Quantized LLMs","date":"2023-05-23","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":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}},{"arxiv_id":"2025.acl-long.498","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.498","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"OpenGVLab/EfficientQAT","path":"datautils_e2e.py","file_url":"https://github.com/OpenGVLab/EfficientQAT/blob/HEAD/datautils_e2e.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":"b5445674ab17410f","code_sha256_prefix":"b5445674ab17410f","mcp_get_code":{"code_sha256":"b5445674ab17410f"}}],"record_sha256":"475ecf82c4b940486ce45dca8bc856db062cb8803fee025b6807ee8576a3d4b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}