{"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/llm-response","entry":"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":5,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":5,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"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":0,"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":"2506.22508","arxiv_id_is_arxiv":true,"paper":"/paper/agentstealth-reinforcing-large-language-model","title":"AgentStealth: Reinforcing Large Language Model for Anonymizing User-generated Text","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/AgentStealth","path":"llama_re.py","file_url":"https://github.com/tsinghua-fib-lab/AgentStealth/blob/HEAD/llama_re.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":"dcb1343416f768e8","code_sha256_prefix":"dcb1343416f768e8","mcp_get_code":{"code_sha256":"dcb1343416f768e8"}},{"arxiv_id":"2502.18754","arxiv_id_is_arxiv":true,"paper":"/paper/agentsociety-challenge-designing-llm-agents","title":"AgentSociety Challenge: Designing LLM Agents for User Modeling and Recommendation on Web Platforms","date":"2025-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/agentsocietychallenge","path":"GTsimulation/RecGTAgent.py","file_url":"https://github.com/tsinghua-fib-lab/agentsocietychallenge/blob/HEAD/GTsimulation/RecGTAgent.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":"685037a23906602e","code_sha256_prefix":"685037a23906602e","mcp_get_code":{"code_sha256":"685037a23906602e"}},{"arxiv_id":"2406.15951","arxiv_id_is_arxiv":true,"paper":"/paper/modular-pluralism-pluralistic-alignment-via","title":"Modular Pluralism: Pluralistic Alignment via Multi-LLM Collaboration","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BunsenFeng/modular_pluralism","path":"lm_utils.py","file_url":"https://github.com/BunsenFeng/modular_pluralism/blob/HEAD/lm_utils.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, BunsenFeng/modular_pluralism when it was checked","code_sha256":"9031a52cf93997ae","code_sha256_prefix":"9031a52cf93997ae","mcp_get_code":{"code_sha256":"9031a52cf93997ae"}},{"arxiv_id":"2402.00367","arxiv_id_is_arxiv":true,"paper":"/paper/don-t-hallucinate-abstain-identifying-llm","title":"Don't Hallucinate, Abstain: Identifying LLM Knowledge Gaps via Multi-LLM Collaboration","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bunsenfeng/abstainqa","path":"lm_utils.py","file_url":"https://github.com/bunsenfeng/abstainqa/blob/HEAD/lm_utils.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, bunsenfeng/abstainqa when it was checked","code_sha256":"2b1ebf7b94c18a64","code_sha256_prefix":"2b1ebf7b94c18a64","mcp_get_code":{"code_sha256":"2b1ebf7b94c18a64"}},{"arxiv_id":"2305.09955","arxiv_id_is_arxiv":true,"paper":"/paper/cook-empowering-general-purpose-language","title":"Knowledge Card: Filling LLMs' Knowledge Gaps with Plug-in Specialized Language Models","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bunsenfeng/knowledge_card","path":"lm_utils.py","file_url":"https://github.com/bunsenfeng/knowledge_card/blob/HEAD/lm_utils.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":"71f1d0c03fccca6b","code_sha256_prefix":"71f1d0c03fccca6b","mcp_get_code":{"code_sha256":"71f1d0c03fccca6b"}}],"record_sha256":"c0491eae19f8854a2a90e2ee3b226bfeb68ea18c56a0e0f14756c0d61b8ca191","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}