{"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/avg","entry":"avg","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":11,"n_places_pointer_only":7,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":5,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2608.10528","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10528","title":"When Do Anchor-Based Pointwise LLM Rerankers Help? Retriever Quality, Statistical Scope, and Anchor Design","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"utshabkg/GCCP-reproduce","path":"experiments/decoder_only_models/run_decoder.py","file_url":"https://github.com/utshabkg/GCCP-reproduce/blob/HEAD/experiments/decoder_only_models/run_decoder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, utshabkg/GCCP-reproduce when it was checked","code_sha256":"6c400decd573e0ca","code_sha256_prefix":"6c400decd573e0ca","mcp_get_code":{"code_sha256":"6c400decd573e0ca"}},{"arxiv_id":"2608.10528","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10528","title":"When Do Anchor-Based Pointwise LLM Rerankers Help? Retriever Quality, Statistical Scope, and Anchor Design","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"utshabkg/GCCP-reproduce","path":"experiments/decoder_only_models/run_decoder_beir.py","file_url":"https://github.com/utshabkg/GCCP-reproduce/blob/HEAD/experiments/decoder_only_models/run_decoder_beir.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, utshabkg/GCCP-reproduce when it was checked","code_sha256":"d75f633822e894a3","code_sha256_prefix":"d75f633822e894a3","mcp_get_code":{"code_sha256":"d75f633822e894a3"}},{"arxiv_id":"2512.11391","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-11391","title":"Mitigating the Safety Alignment Tax with Null-Space Constrained Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"ivanniu/NSPO","path":"evaluation/eval_sorrybench.py","file_url":"https://github.com/ivanniu/NSPO/blob/HEAD/evaluation/eval_sorrybench.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ivanniu/NSPO when it was checked","code_sha256":"9ba031d07c0634c0","code_sha256_prefix":"9ba031d07c0634c0","mcp_get_code":{"code_sha256":"9ba031d07c0634c0"}},{"arxiv_id":"2408.10343","arxiv_id_is_arxiv":true,"paper":"/paper/legalbench-rag-a-benchmark-for-retrieval","title":"LegalBench-RAG: A Benchmark for Retrieval-Augmented Generation in the Legal Domain","date":"2024-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zeroentropy-cc/legalbenchrag","path":"legalbenchrag/run_benchmark.py","file_url":"https://github.com/zeroentropy-cc/legalbenchrag/blob/HEAD/legalbenchrag/run_benchmark.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"827171693ba8c487","code_sha256_prefix":"827171693ba8c487","mcp_get_code":{"code_sha256":"827171693ba8c487"}},{"arxiv_id":"2407.02880","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-composition-using-task-vectors-with","title":"Knowledge Composition using Task Vectors with Learned Anisotropic Scaling","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fredzzhang/atlas","path":"src/learn_task_addition.py","file_url":"https://github.com/fredzzhang/atlas/blob/HEAD/src/learn_task_addition.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fredzzhang/atlas when it was checked","code_sha256":"aab9d967b4f428fa","code_sha256_prefix":"aab9d967b4f428fa","mcp_get_code":{"code_sha256":"aab9d967b4f428fa"}},{"arxiv_id":"2406.04216","arxiv_id_is_arxiv":true,"paper":"/paper/what-do-language-models-learn-in-context-the","title":"What Do Language Models Learn in Context? The Structured Task Hypothesis","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-lre/llm_icl","path":"src/utils.py","file_url":"https://github.com/eth-lre/llm_icl/blob/HEAD/src/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"272fccc7faf0215a","code_sha256_prefix":"272fccc7faf0215a","mcp_get_code":{"code_sha256":"272fccc7faf0215a"}},{"arxiv_id":"2401.06866","arxiv_id_is_arxiv":true,"paper":"/paper/health-llm-large-language-models-for-health","title":"Health-LLM: Large Language Models for Health Prediction via Wearable Sensor Data","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitmedialab/health-llm","path":"gen_dataset.py","file_url":"https://github.com/mitmedialab/health-llm/blob/HEAD/gen_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e65837da534b4304","code_sha256_prefix":"e65837da534b4304","mcp_get_code":{"code_sha256":"e65837da534b4304"}},{"arxiv_id":"2310.17645","arxiv_id_is_arxiv":true,"paper":"/paper/defending-against-transfer-attacks-from","title":"PubDef: Defending Against Transfer Attacks From Public Models","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhengyuZhao/TransferAttackEval","path":"attacks/feature_disruption_attacks.py","file_url":"https://github.com/ZhengyuZhao/TransferAttackEval/blob/HEAD/attacks/feature_disruption_attacks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ZhengyuZhao/TransferAttackEval when it was checked","code_sha256":"7a1a277b5455acbd","code_sha256_prefix":"7a1a277b5455acbd","mcp_get_code":{"code_sha256":"7a1a277b5455acbd"}},{"arxiv_id":"2310.14491","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-mechanistic-interpretation-of-multi","title":"Towards a Mechanistic Interpretation of Multi-Step Reasoning Capabilities of Language Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan-h/mechanisticprobe","path":"src/utils.py","file_url":"https://github.com/yifan-h/mechanisticprobe/blob/HEAD/src/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"272fccc7faf0215a","code_sha256_prefix":"272fccc7faf0215a","mcp_get_code":{"code_sha256":"272fccc7faf0215a"}},{"arxiv_id":"2310.13590","arxiv_id_is_arxiv":true,"paper":"/paper/relm-leveraging-language-models-for-enhanced","title":"ReLM: Leveraging Language Models for Enhanced Chemical Reaction Prediction","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syr-cn/relm","path":"utils.py","file_url":"https://github.com/syr-cn/relm/blob/HEAD/utils.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, syr-cn/relm when it was checked","code_sha256":"aab9d967b4f428fa","code_sha256_prefix":"aab9d967b4f428fa","mcp_get_code":{"code_sha256":"aab9d967b4f428fa"}},{"arxiv_id":"2104.08303","arxiv_id_is_arxiv":true,"paper":"/paper/capturing-row-and-column-semantics-in","title":"Capturing Row and Column Semantics in Transformer Based Question Answering over Tables","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/row-column-intersection","path":"tableqa/aggregation_integration.py","file_url":"https://github.com/IBM/row-column-intersection/blob/HEAD/tableqa/aggregation_integration.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from ZhengyuZhao/TransferAttackEval, and GitHub detected no licence in that repository when it was checked","code_sha256":"7a1a277b5455acbd","code_sha256_prefix":"7a1a277b5455acbd","mcp_get_code":{"code_sha256":"7a1a277b5455acbd"}}],"record_sha256":"fa11de4fa44c44345760b5e35f9a40fd1db4bff598d4ef8825835563945b6022","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}