{"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/get-llm-response","entry":"get_llm_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":8,"n_papers_ran":1,"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":8,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":7},"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.21867","paper":"/paper/arxiv-2606-21867","title":"ForEx: A Formal Verification Framework for Explainable Reasoning in Logical Fallacy Detection and Annotation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"D3-Laboratory/ForEx","path":"src/experiment_processor.py","file_url":"https://github.com/D3-Laboratory/ForEx/blob/HEAD/src/experiment_processor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65b26a0acc1b2673","mcp_get_code":{"code_sha256":"65b26a0acc1b2673"}},{"arxiv_id":"2604.05096","paper":"/paper/arxiv-2604-05096","title":"RAG or Learning? Understanding the Limits of LLM Adaptation under Continuous Knowledge Drift in the Real World","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"hbing-l/chronos","path":"llm_api.py","file_url":"https://github.com/hbing-l/chronos/blob/HEAD/llm_api.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"224e303e6f6b90bc","mcp_get_code":{"code_sha256":"224e303e6f6b90bc"}},{"arxiv_id":"2512.14395","paper":"/paper/arxiv-2512-14395","title":"Massive Editing for Large Language Models Based on Dynamic Weight Generation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"RodeWayne/MeG-for-Knowledge-Editing","path":"get_edit_and_loc_data.py","file_url":"https://github.com/RodeWayne/MeG-for-Knowledge-Editing/blob/HEAD/get_edit_and_loc_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"db1b92e53aaafcee","mcp_get_code":{"code_sha256":"db1b92e53aaafcee"}},{"arxiv_id":"2507.02592","paper":"/paper/websailor-navigating-super-human-reasoning","title":"WebSailor: Navigating Super-human Reasoning for Web Agent","date":"2025-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba-nlp/webagent","path":"WebAgent/ParallelMuse/compressed_reasoning_aggregation.py","file_url":"https://github.com/alibaba-nlp/webagent/blob/HEAD/WebAgent/ParallelMuse/compressed_reasoning_aggregation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f78af907d3807fbc","mcp_get_code":{"code_sha256":"f78af907d3807fbc"}},{"arxiv_id":"2506.06404","paper":"/paper/unintended-harms-of-value-aligned-llms","title":"Unintended Harms of Value-Aligned LLMs: Psychological and Empirical Insights","date":"2025-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meta-llama/llama-recipes","path":"end-to-end-use-cases/whatsapp_llama_4_bot/ec2_services.py","file_url":"https://github.com/meta-llama/llama-recipes/blob/HEAD/end-to-end-use-cases/whatsapp_llama_4_bot/ec2_services.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"e6104bf4c7a58936","mcp_get_code":{"code_sha256":"e6104bf4c7a58936"}},{"arxiv_id":"2405.19119","paper":"/paper/can-graph-learning-improve-task-planning","title":"Can Graph Learning Improve Planning in LLM-based Agents?","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wxxshirley/gnn4taskplan","path":"trainfree/graphsearch.py","file_url":"https://github.com/wxxshirley/gnn4taskplan/blob/HEAD/trainfree/graphsearch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"636c719f3c82b366","mcp_get_code":{"code_sha256":"636c719f3c82b366"}},{"arxiv_id":"2403.05307","paper":"/paper/tapilot-crossing-benchmarking-and-evolving","title":"Tapilot-Crossing: Benchmarking and Evolving LLMs Towards Interactive Data Analysis Agents","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tapilot-crossing/tapilot_code","path":"methods/utils.py","file_url":"https://github.com/tapilot-crossing/tapilot_code/blob/HEAD/methods/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3373c6a0b725a712","mcp_get_code":{"code_sha256":"3373c6a0b725a712"}},{"arxiv_id":"2305.14314","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":"georgesung/llm_qlora","path":"inference.py","file_url":"https://github.com/georgesung/llm_qlora/blob/HEAD/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0798e321dcc227ed","mcp_get_code":{"code_sha256":"0798e321dcc227ed"}}]}