{"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-unnatural-instructions-data","entry":"extract_unnatural_instructions_data","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":8,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"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":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":"2405.15179","arxiv_id_is_arxiv":true,"paper":"/paper/vb-lora-extreme-parameter-efficient-fine","title":"VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Banks","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leo-yangli/VB-LoRA","path":"instruction_tuning/qlora.py","file_url":"https://github.com/leo-yangli/VB-LoRA/blob/HEAD/instruction_tuning/qlora.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, leo-yangli/VB-LoRA when it was checked","code_sha256":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}},{"arxiv_id":"2402.05445","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-lora-finetuning-quantization-of-llms","title":"Accurate LoRA-Finetuning Quantization of LLMs via Information Retention","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"htqin/ir-qlora","path":"irlora.py","file_url":"https://github.com/htqin/ir-qlora/blob/HEAD/irlora.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, htqin/ir-qlora when it was checked","code_sha256":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}},{"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":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}},{"arxiv_id":"2311.13171","arxiv_id_is_arxiv":true,"paper":"/paper/compeft-compression-for-communicating","title":"ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantization","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prateeky2806/compeft","path":"src/qlora/utils.py","file_url":"https://github.com/prateeky2806/compeft/blob/HEAD/src/qlora/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}},{"arxiv_id":"2310.07676","arxiv_id_is_arxiv":true,"paper":"/paper/composite-backdoor-attacks-against-large","title":"Composite Backdoor Attacks Against Large Language Models","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miraclehh/cba","path":"nlp/backdoor_train.py","file_url":"https://github.com/miraclehh/cba/blob/HEAD/nlp/backdoor_train.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, miraclehh/cba when it was checked","code_sha256":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}},{"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":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}},{"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":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}},{"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":"f82430123a91cf21","code_sha256_prefix":"f82430123a91cf21","mcp_get_code":{"code_sha256":"f82430123a91cf21"}}],"record_sha256":"2a81837750928bc0a2d7e82460fe3750776eaac9d3acf202dafca76aaf4f1c9a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}