{"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/generate-answer","entry":"generate_answer","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":4,"n_papers_ran_no_instrument_failure":4,"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":11,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":6,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":8},"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":"2607.00605","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-00605","title":"Auditing Forgetting in Limited Memory Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"raeesiarya/LMLMAudit","path":"src/lmlm-audit/run_audit.py","file_url":"https://github.com/raeesiarya/LMLMAudit/blob/HEAD/src/lmlm-audit/run_audit.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":"1908bdfde38728bb","code_sha256_prefix":"1908bdfde38728bb","mcp_get_code":{"code_sha256":"1908bdfde38728bb"}},{"arxiv_id":"2606.18986","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18986","title":"Beyond Tokenization: Direct Timestep Embedding and Contrastive Alignment for Time-Series Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YafengWu/CADE","path":"Time-MQA_Full_FT/merge.py","file_url":"https://github.com/YafengWu/CADE/blob/HEAD/Time-MQA_Full_FT/merge.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, YafengWu/CADE when it was checked","code_sha256":"74e845a6129041fd","code_sha256_prefix":"74e845a6129041fd","mcp_get_code":{"code_sha256":"74e845a6129041fd"}},{"arxiv_id":"2601.01552","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-01552","title":"HalluZig: Hallucination Detection using Zigzag Persistence","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"TDA-Jyamiti/halluzig","path":"label_generated_gpt4o.py","file_url":"https://github.com/TDA-Jyamiti/halluzig/blob/HEAD/label_generated_gpt4o.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, TDA-Jyamiti/halluzig when it was checked","code_sha256":"c55f41cc0b59f46f","code_sha256_prefix":"c55f41cc0b59f46f","mcp_get_code":{"code_sha256":"c55f41cc0b59f46f"}},{"arxiv_id":"2502.20082","arxiv_id_is_arxiv":true,"paper":"/paper/longrope2-near-lossless-llm-context-window","title":"LongRoPE2: Near-Lossless LLM Context Window Scaling","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/longrope","path":"evaluation/passkey.py","file_url":"https://github.com/microsoft/longrope/blob/HEAD/evaluation/passkey.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":"f2a976adb1d0806e","code_sha256_prefix":"f2a976adb1d0806e","mcp_get_code":{"code_sha256":"f2a976adb1d0806e"}},{"arxiv_id":"2412.19513","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-v-s-critique-a-decomposition-of","title":"Confidence v.s. Critique: A Decomposition of Self-Correction Capability for LLMs","date":"2024-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhe-Young/SelfCorrectDecompose","path":"eval_sampling.py","file_url":"https://github.com/Zhe-Young/SelfCorrectDecompose/blob/HEAD/eval_sampling.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, Zhe-Young/SelfCorrectDecompose when it was checked","code_sha256":"dd6378ce27ea29b1","code_sha256_prefix":"dd6378ce27ea29b1","mcp_get_code":{"code_sha256":"dd6378ce27ea29b1"}},{"arxiv_id":"2407.07791","arxiv_id_is_arxiv":true,"paper":"/paper/flooding-spread-of-manipulated-knowledge-in","title":"Flooding Spread of Manipulated Knowledge in LLM-Based Multi-Agent Communities","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jometeorie/KnowledgeSpread","path":"simulation/baseline_easyedit.py","file_url":"https://github.com/Jometeorie/KnowledgeSpread/blob/HEAD/simulation/baseline_easyedit.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, Jometeorie/KnowledgeSpread when it was checked","code_sha256":"41f7fbef0bb0cb0f","code_sha256_prefix":"41f7fbef0bb0cb0f","mcp_get_code":{"code_sha256":"41f7fbef0bb0cb0f"}},{"arxiv_id":"2407.00379","arxiv_id_is_arxiv":true,"paper":"/paper/grapharena-benchmarking-large-language-models","title":"GraphArena: Benchmarking Large Language Models on Graph Computational Problems","date":"2024-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squareRoot3/GraphArena","path":"benchmark_LLM_local.py","file_url":"https://github.com/squareRoot3/GraphArena/blob/HEAD/benchmark_LLM_local.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, squareRoot3/GraphArena when it was checked","code_sha256":"31b2e95470d367f8","code_sha256_prefix":"31b2e95470d367f8","mcp_get_code":{"code_sha256":"31b2e95470d367f8"}},{"arxiv_id":"2403.05065","arxiv_id_is_arxiv":true,"paper":"/paper/can-we-obtain-significant-success-in-rst","title":"Can we obtain significant success in RST discourse parsing by using Large Language Models?","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nttcslab-nlp/rstparser_eacl24","path":"src/parse/parse_utils.py","file_url":"https://github.com/nttcslab-nlp/rstparser_eacl24/blob/HEAD/src/parse/parse_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nttcslab-nlp/rstparser_eacl24 (NOASSERTION)","code_sha256":"01eb601638ec987f","code_sha256_prefix":"01eb601638ec987f","mcp_get_code":{"code_sha256":"01eb601638ec987f"}},{"arxiv_id":"2402.15018","arxiv_id_is_arxiv":true,"paper":"/paper/unintended-impacts-of-llm-alignment-on-global","title":"Unintended Impacts of LLM Alignment on Global Representation","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salt-nlp/unintended-impacts-of-alignment","path":"code/md3game.py","file_url":"https://github.com/salt-nlp/unintended-impacts-of-alignment/blob/HEAD/code/md3game.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":"ea124a9e59aa3d97","code_sha256_prefix":"ea124a9e59aa3d97","mcp_get_code":{"code_sha256":"ea124a9e59aa3d97"}},{"arxiv_id":"2310.14566","arxiv_id_is_arxiv":true,"paper":"/paper/hallusionbench-you-see-what-you-think-or-you","title":"HallusionBench: An Advanced Diagnostic Suite for Entangled Language Hallucination and Visual Illusion in Large Vision-Language Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyi-lab/hallusionbench","path":"evaluation.py","file_url":"https://github.com/tianyi-lab/hallusionbench/blob/HEAD/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c5e2fa32f54d0bba","code_sha256_prefix":"c5e2fa32f54d0bba","mcp_get_code":{"code_sha256":"c5e2fa32f54d0bba"}},{"arxiv_id":"2211.05655","arxiv_id_is_arxiv":true,"paper":"/paper/disentqa-disentangling-parametric-and","title":"DisentQA: Disentangling Parametric and Contextual Knowledge with Counterfactual Question Answering","date":"2022-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ellaneeman/disent_qa","path":"query_model.py","file_url":"https://github.com/ellaneeman/disent_qa/blob/HEAD/query_model.py","status":"unverified","verification_level":0,"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":"a0de6f5df583e698","code_sha256_prefix":"a0de6f5df583e698","mcp_get_code":{"code_sha256":"a0de6f5df583e698"}},{"arxiv_id":"Guan_HallusionBench_An_Advanced_Diagnostic_Suite_for_Entangled_Language_Hallucination_and_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Guan_HallusionBench_An_Advanced_Diagnostic_Suite_for_Entangled_Language_Hallucination_and_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tianyi-lab/HallusionBench","path":"evaluation.py","file_url":"https://github.com/tianyi-lab/HallusionBench/blob/HEAD/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c5e2fa32f54d0bba","code_sha256_prefix":"c5e2fa32f54d0bba","mcp_get_code":{"code_sha256":"c5e2fa32f54d0bba"}}],"record_sha256":"23a4924c8b43f1ebe2d23ffe3d7e7d1d88781a33423d7107096aa047e71f524c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}