{"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/dispatch-openai-chat-requesets","entry":"dispatch_openai_chat_requesets","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":7,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":4,"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":"2505.07437","arxiv_id_is_arxiv":true,"paper":"/paper/lead-iterative-data-selection-for-efficient","title":"LEAD: Iterative Data Selection for Efficient LLM Instruction Tuning","date":"2025-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUSTDial/LEAD","path":"src/eval/dispatch_openai_requests.py","file_url":"https://github.com/HKUSTDial/LEAD/blob/HEAD/src/eval/dispatch_openai_requests.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"64d6138fb03f75c7","code_sha256_prefix":"64d6138fb03f75c7","mcp_get_code":{"code_sha256":"64d6138fb03f75c7"}},{"arxiv_id":"2410.24175","arxiv_id_is_arxiv":true,"paper":"/paper/constraint-back-translation-improves-complex","title":"Constraint Back-translation Improves Complex Instruction Following of Large Language Models","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-keg/crab","path":"eval/dispatch_openai_requests.py","file_url":"https://github.com/thu-keg/crab/blob/HEAD/eval/dispatch_openai_requests.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, thu-keg/crab when it was checked","code_sha256":"dcad9ac62979ca49","code_sha256_prefix":"dcad9ac62979ca49","mcp_get_code":{"code_sha256":"dcad9ac62979ca49"}},{"arxiv_id":"2410.16208","arxiv_id_is_arxiv":true,"paper":"/paper/compute-constrained-data-selection","title":"Compute-Constrained Data Selection","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oseyosey/CCDS","path":"ccds/evaluation/eval/dispatch_openai_requests.py","file_url":"https://github.com/oseyosey/CCDS/blob/HEAD/ccds/evaluation/eval/dispatch_openai_requests.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":"dfe736d72f7fb77f","code_sha256_prefix":"dfe736d72f7fb77f","mcp_get_code":{"code_sha256":"dfe736d72f7fb77f"}},{"arxiv_id":"2407.08770","arxiv_id_is_arxiv":true,"paper":"/paper/model-surgery-modulating-llm-s-behavior-via","title":"Model Surgery: Modulating LLM's Behavior Via Simple Parameter Editing","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucywang720/model-surgery","path":"eval/dispatch_openai_requests.py","file_url":"https://github.com/lucywang720/model-surgery/blob/HEAD/eval/dispatch_openai_requests.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, lucywang720/model-surgery when it was checked","code_sha256":"dcad9ac62979ca49","code_sha256_prefix":"dcad9ac62979ca49","mcp_get_code":{"code_sha256":"dcad9ac62979ca49"}},{"arxiv_id":"2406.14144","arxiv_id_is_arxiv":true,"paper":"/paper/finding-safety-neurons-in-large-language","title":"Finding Safety Neurons in Large Language Models","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/SafetyNeuron","path":"src/eval/dispatch_openai_requests.py","file_url":"https://github.com/THU-KEG/SafetyNeuron/blob/HEAD/src/eval/dispatch_openai_requests.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"233355240185dc1a","code_sha256_prefix":"233355240185dc1a","mcp_get_code":{"code_sha256":"233355240185dc1a"}},{"arxiv_id":"2405.05008","arxiv_id_is_arxiv":true,"paper":"/paper/adelie-aligning-large-language-models-on","title":"ADELIE: Aligning Large Language Models on Information Extraction","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/ADELIE","path":"train4llama/eval/dispatch_openai_requests.py","file_url":"https://github.com/THU-KEG/ADELIE/blob/HEAD/train4llama/eval/dispatch_openai_requests.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, THU-KEG/ADELIE when it was checked","code_sha256":"dcad9ac62979ca49","code_sha256_prefix":"dcad9ac62979ca49","mcp_get_code":{"code_sha256":"dcad9ac62979ca49"}},{"arxiv_id":"2402.16705","arxiv_id_is_arxiv":true,"paper":"/paper/selectit-selective-instruction-tuning-for","title":"SelectIT: Selective Instruction Tuning for LLMs via Uncertainty-Aware Self-Reflection","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Blue-Raincoat/SelectIT","path":"eval/eval/dispatch_openai_requests.py","file_url":"https://github.com/Blue-Raincoat/SelectIT/blob/HEAD/eval/eval/dispatch_openai_requests.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, Blue-Raincoat/SelectIT when it was checked","code_sha256":"dcad9ac62979ca49","code_sha256_prefix":"dcad9ac62979ca49","mcp_get_code":{"code_sha256":"dcad9ac62979ca49"}},{"arxiv_id":"2402.04333","arxiv_id_is_arxiv":true,"paper":"/paper/less-selecting-influential-data-for-targeted","title":"LESS: Selecting Influential Data for Targeted Instruction Tuning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/less","path":"evaluation/eval/dispatch_openai_requests.py","file_url":"https://github.com/princeton-nlp/less/blob/HEAD/evaluation/eval/dispatch_openai_requests.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dfe736d72f7fb77f","code_sha256_prefix":"dfe736d72f7fb77f","mcp_get_code":{"code_sha256":"dfe736d72f7fb77f"}},{"arxiv_id":"2401.16405","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-sparse-fine-tuning-to-large-language","title":"Scaling Sparse Fine-Tuning to Large Language Models","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ducdauge/sft-llm","path":"eval/dispatch_openai_requests.py","file_url":"https://github.com/ducdauge/sft-llm/blob/HEAD/eval/dispatch_openai_requests.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 thu-keg/crab, and GitHub detected no licence in that repository when it was checked","code_sha256":"dcad9ac62979ca49","code_sha256_prefix":"dcad9ac62979ca49","mcp_get_code":{"code_sha256":"dcad9ac62979ca49"}},{"arxiv_id":"2401.15006","arxiv_id_is_arxiv":true,"paper":"/paper/airavata-introducing-hindi-instruction-tuned","title":"Airavata: Introducing Hindi Instruction-tuned LLM","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4bharat/indicinstruct","path":"eval/dispatch_openai_requests.py","file_url":"https://github.com/ai4bharat/indicinstruct/blob/HEAD/eval/dispatch_openai_requests.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4967e8b8db0b2f2c","code_sha256_prefix":"4967e8b8db0b2f2c","mcp_get_code":{"code_sha256":"4967e8b8db0b2f2c"}},{"arxiv_id":"2401.10768","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-hallucinations-of-large-language","title":"Knowledge Verification to Nip Hallucination in the Bud","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/KCA","path":"examination/dispatch_openai_requests.py","file_url":"https://github.com/fanqiwan/KCA/blob/HEAD/examination/dispatch_openai_requests.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 thu-keg/crab, and GitHub detected no licence in that repository when it was checked","code_sha256":"dcad9ac62979ca49","code_sha256_prefix":"dcad9ac62979ca49","mcp_get_code":{"code_sha256":"dcad9ac62979ca49"}},{"arxiv_id":"2310.06830","arxiv_id_is_arxiv":true,"paper":"/paper/lemur-harmonizing-natural-language-and-code","title":"Lemur: Harmonizing Natural Language and Code for Language Agents","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenLemur/Lemur","path":"xchat/eval/dispatch_openai_requests.py","file_url":"https://github.com/OpenLemur/Lemur/blob/HEAD/xchat/eval/dispatch_openai_requests.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":"8140036b8f8671e0","code_sha256_prefix":"8140036b8f8671e0","mcp_get_code":{"code_sha256":"8140036b8f8671e0"}}],"record_sha256":"e45c145605db26d48004a9d86b2f823c23399f79328ebf2b7f877ba300165b77","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}