{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/post-process-gpt3-response","entry":"post_process_gpt3_response","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":12,"n_papers_ran":11,"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":4,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2609.01090","paper":"/paper/arxiv-2609-01090","title":"Modelpedia: A Catalog of Model Findings for the Meta-Science of AI","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"tatsu-lab/stanford_alpaca","path":"generate_instruction.py","file_url":"https://github.com/tatsu-lab/stanford_alpaca/blob/HEAD/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2605.17352","paper":"/paper/arxiv-2605-17352","title":"AMATA: Adaptive Multi-Agent Trajectory Alignment for Knowledge-Intensive Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"tatsu-lab/stanford_alpaca","path":"generate_instruction.py","file_url":"https://github.com/tatsu-lab/stanford_alpaca/blob/HEAD/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2410.24198","paper":"/paper/selfcodealign-self-alignment-for-code","title":"SelfCodeAlign: Self-Alignment for Code Generation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sahil280114/codealpaca","path":"generate_instruction.py","file_url":"https://github.com/sahil280114/codealpaca/blob/HEAD/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2404.02406","paper":"/paper/exploring-backdoor-vulnerabilities-of-chat","title":"Exploring Backdoor Vulnerabilities of Chat Models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hychaochao/chat-models-backdoor-attacking","path":"Instructional_Model_Backdoor/generate_instruction.py","file_url":"https://github.com/hychaochao/chat-models-backdoor-attacking/blob/HEAD/Instructional_Model_Backdoor/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2403.15042","paper":"/paper/llm2llm-boosting-llms-with-novel-iterative","title":"LLM2LLM: Boosting LLMs with Novel Iterative Data Enhancement","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squeezeailab/llm2llm","path":"GSM8K/generate_data.py","file_url":"https://github.com/squeezeailab/llm2llm/blob/HEAD/GSM8K/generate_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"119edfc3533dd7fc","mcp_get_code":{"code_sha256":"119edfc3533dd7fc"}},{"arxiv_id":"2402.11725","paper":"/paper/how-susceptible-are-large-language-models-to","title":"How Susceptible are Large Language Models to Ideological Manipulation?","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaichen23/llm_ideo_manipulate","path":"code/generate_instruction.py","file_url":"https://github.com/kaichen23/llm_ideo_manipulate/blob/HEAD/code/generate_instruction.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"66353411cccd30ba","mcp_get_code":{"code_sha256":"66353411cccd30ba"}},{"arxiv_id":"2312.11875","paper":"/paper/sparse-is-enough-in-fine-tuning-pre-trained","title":"Sparse is Enough in Fine-tuning Pre-trained Large Language Models","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"song-wx/SIFT","path":"exp/instruction_finetuning/generate_instruction.py","file_url":"https://github.com/song-wx/SIFT/blob/HEAD/exp/instruction_finetuning/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2308.04948","paper":"/paper/extrapolating-large-language-models-to-non","title":"Extrapolating Large Language Models to Non-English by Aligning Languages","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NJUNLP/x-LLM","path":"generate_instruction.py","file_url":"https://github.com/NJUNLP/x-LLM/blob/HEAD/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2305.14825","paper":"/paper/large-language-models-are-in-context-semantic","title":"Large Language Models are In-Context Semantic Reasoners rather than Symbolic Reasoners","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaojuantang/icsr","path":"finetune/generate_instruction.py","file_url":"https://github.com/xiaojuantang/icsr/blob/HEAD/finetune/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2305.12870","paper":"/paper/lion-adversarial-distillation-of-closed","title":"Lion: Adversarial Distillation of Proprietary Large Language Models","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjiangcm/lion","path":"src/generate_easy_instruction.py","file_url":"https://github.com/yjiangcm/lion/blob/HEAD/src/generate_easy_instruction.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a2aee0157546c3ef","mcp_get_code":{"code_sha256":"a2aee0157546c3ef"}},{"arxiv_id":"2302.13971","paper":"/paper/llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beomi/koalpaca","path":"generate_instruction.py","file_url":"https://github.com/beomi/koalpaca/blob/HEAD/generate_instruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5e4ad4e11cf2143","mcp_get_code":{"code_sha256":"a5e4ad4e11cf2143"}},{"arxiv_id":"2024.findings-acl.388","paper":null,"title":"arXiv:2024.findings-acl.388","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SqueezeAILab/LLM2LLM","path":"GSM8K/generate_data.py","file_url":"https://github.com/SqueezeAILab/LLM2LLM/blob/HEAD/GSM8K/generate_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"119edfc3533dd7fc","mcp_get_code":{"code_sha256":"119edfc3533dd7fc"}}]}