{"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/get-llm-response","entry":"get_llm_response","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":3,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":0,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran_fixture":0,"ran":3,"unverified":5},"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":"2606.21867","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, D3-Laboratory/ForEx when it was checked","code_sha256":"65b26a0acc1b2673","code_sha256_prefix":"65b26a0acc1b2673","mcp_get_code":{"code_sha256":"65b26a0acc1b2673"}},{"arxiv_id":"2604.05096","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"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, hbing-l/chronos when it was checked","code_sha256":"224e303e6f6b90bc","code_sha256_prefix":"224e303e6f6b90bc","mcp_get_code":{"code_sha256":"224e303e6f6b90bc"}},{"arxiv_id":"2512.14395","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, RodeWayne/MeG-for-Knowledge-Editing when it was checked","code_sha256":"db1b92e53aaafcee","code_sha256_prefix":"db1b92e53aaafcee","mcp_get_code":{"code_sha256":"db1b92e53aaafcee"}},{"arxiv_id":"2507.02592","arxiv_id_is_arxiv":true,"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":"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":"f78af907d3807fbc","code_sha256_prefix":"f78af907d3807fbc","mcp_get_code":{"code_sha256":"f78af907d3807fbc"}},{"arxiv_id":"2506.06404","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, meta-llama/llama-recipes, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e6104bf4c7a58936","code_sha256_prefix":"e6104bf4c7a58936","mcp_get_code":{"code_sha256":"e6104bf4c7a58936"}},{"arxiv_id":"2405.19119","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"636c719f3c82b366","code_sha256_prefix":"636c719f3c82b366","mcp_get_code":{"code_sha256":"636c719f3c82b366"}},{"arxiv_id":"2403.05307","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3373c6a0b725a712","code_sha256_prefix":"3373c6a0b725a712","mcp_get_code":{"code_sha256":"3373c6a0b725a712"}},{"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":"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0798e321dcc227ed","code_sha256_prefix":"0798e321dcc227ed","mcp_get_code":{"code_sha256":"0798e321dcc227ed"}}],"record_sha256":"95a5b3338939669a819bf210ad982ddb26596e14ed4b25f9ab4c2573e76be499","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}