{"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-pred","entry":"get_pred","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":20,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":3,"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":20,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":3,"n_samples_unverified":8,"n_samples_fingerprinted":1,"n_places":21,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":8,"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":"2604.10900","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-10900","title":"CASK: Core-Aware Selective KV Compression for Reasoning Traces","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"THUDM/LongBench","path":"LongBench/retrieval/pred.py","file_url":"https://github.com/THUDM/LongBench/blob/HEAD/LongBench/retrieval/pred.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":"7de062709da87b4f","code_sha256_prefix":"7de062709da87b4f","mcp_get_code":{"code_sha256":"7de062709da87b4f"}},{"arxiv_id":"2603.14238","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-14238","title":"Domain-Skewed Federated Learning with Feature Decoupling and Calibration","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"mala-lab/F2DC","path":"models/f2dc.py","file_url":"https://github.com/mala-lab/F2DC/blob/HEAD/models/f2dc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf281d515e42470d","code_sha256_prefix":"bf281d515e42470d","mcp_get_code":{"code_sha256":"bf281d515e42470d"}},{"arxiv_id":"2505.20322","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-prompt-engineering-robust-behavior","title":"Beyond Prompt Engineering: Robust Behavior Control in LLMs via Steering Target Atoms","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/steer-target-atoms","path":"dataloader.py","file_url":"https://github.com/zjunlp/steer-target-atoms/blob/HEAD/dataloader.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":"4e409608d73ba8ed","code_sha256_prefix":"4e409608d73ba8ed","mcp_get_code":{"code_sha256":"4e409608d73ba8ed"}},{"arxiv_id":"2409.12181","arxiv_id_is_arxiv":true,"paper":"/paper/a-controlled-study-on-long-context-extension","title":"A Controlled Study on Long Context Extension and Generalization in LLMs","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leooyii/lceg","path":"longbench/pred.py","file_url":"https://github.com/leooyii/lceg/blob/HEAD/longbench/pred.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, leooyii/lceg when it was checked","code_sha256":"ac5698be4313ef23","code_sha256_prefix":"ac5698be4313ef23","mcp_get_code":{"code_sha256":"ac5698be4313ef23"}},{"arxiv_id":"2409.00101","arxiv_id_is_arxiv":true,"paper":"/paper/neurolm-a-universal-multi-task-foundation","title":"NeuroLM: A Universal Multi-task Foundation Model for Bridging the Gap between Language and EEG Signals","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"935963004/neurolm","path":"train_instruction.py","file_url":"https://github.com/935963004/neurolm/blob/HEAD/train_instruction.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":"c26a6321cdb66be7","code_sha256_prefix":"c26a6321cdb66be7","mcp_get_code":{"code_sha256":"c26a6321cdb66be7"}},{"arxiv_id":"2407.08972","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-the-dark-secrets-of-extremely-large","title":"Revealing the Dark Secrets of Extremely Large Kernel ConvNets on Robustness","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lauch1ng/lkrobust","path":"adversarial_attack/utils.py","file_url":"https://github.com/lauch1ng/lkrobust/blob/HEAD/adversarial_attack/utils.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":"317cf3d87d623d14","code_sha256_prefix":"317cf3d87d623d14","mcp_get_code":{"code_sha256":"317cf3d87d623d14"}},{"arxiv_id":"2407.04842","arxiv_id_is_arxiv":true,"paper":"/paper/mj-bench-is-your-multimodal-reward-model","title":"MJ-Bench: Is Your Multimodal Reward Model Really a Good Judge for Text-to-Image Generation?","date":"2024-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MJ-Bench/MJ-Bench","path":"experimental/ddpo_finetune_with_vlm.py","file_url":"https://github.com/MJ-Bench/MJ-Bench/blob/HEAD/experimental/ddpo_finetune_with_vlm.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":"17ad7536db5b4682","code_sha256_prefix":"17ad7536db5b4682","mcp_get_code":{"code_sha256":"17ad7536db5b4682"}},{"arxiv_id":"2406.03143","arxiv_id_is_arxiv":true,"paper":"/paper/zeropur-succinct-training-free-adversarial","title":"ZeroPur: Succinct Training-Free Adversarial Purification","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erhul/ZeroPur","path":"utils.py","file_url":"https://github.com/erhul/ZeroPur/blob/HEAD/utils.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, erhul/ZeroPur when it was checked","code_sha256":"5105d577deca7c37","code_sha256_prefix":"5105d577deca7c37","mcp_get_code":{"code_sha256":"5105d577deca7c37"}},{"arxiv_id":"2405.04434","arxiv_id_is_arxiv":true,"paper":"/paper/deepseek-v2-a-strong-economical-and-efficient","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shadowpa0327/Palu","path":"run_long_bench.py","file_url":"https://github.com/shadowpa0327/Palu/blob/HEAD/run_long_bench.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":"87b9a0c596eea7a8","code_sha256_prefix":"87b9a0c596eea7a8","mcp_get_code":{"code_sha256":"87b9a0c596eea7a8"}},{"arxiv_id":"2402.19167","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-large-language-models-an-unseen","title":"Teaching Large Language Models an Unseen Language on the Fly","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luciusssss/zhuangbench","path":"src/model.py","file_url":"https://github.com/luciusssss/zhuangbench/blob/HEAD/src/model.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":"c70a55ce586ba43d","code_sha256_prefix":"c70a55ce586ba43d","mcp_get_code":{"code_sha256":"c70a55ce586ba43d"}},{"arxiv_id":"2402.02750","arxiv_id_is_arxiv":true,"paper":"/paper/kivi-a-tuning-free-asymmetric-2bit","title":"KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jy-yuan/kivi","path":"pred_long_bench.py","file_url":"https://github.com/jy-yuan/kivi/blob/HEAD/pred_long_bench.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":"1b63810f36de324d","code_sha256_prefix":"1b63810f36de324d","mcp_get_code":{"code_sha256":"1b63810f36de324d"}},{"arxiv_id":"2311.09198","arxiv_id_is_arxiv":true,"paper":"/paper/never-lost-in-the-middle-improving-large","title":"Never Lost in the Middle: Mastering Long-Context Question Answering with Position-Agnostic Decompositional Training","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hejunqing/never-lost-in-the-middle","path":"LongBench/src/baichuan_pred_shuffle.py","file_url":"https://github.com/hejunqing/never-lost-in-the-middle/blob/HEAD/LongBench/src/baichuan_pred_shuffle.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":"9ac0485160d687f7","code_sha256_prefix":"9ac0485160d687f7","mcp_get_code":{"code_sha256":"9ac0485160d687f7"}},{"arxiv_id":"2304.03935","arxiv_id_is_arxiv":true,"paper":"/paper/last-layer-fairness-fine-tuning-is-simple-and","title":"Last-Layer Fairness Fine-tuning is Simple and Effective for Neural Networks","date":"2023-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"modar7/the_fairness_stitch","path":"src/utils.py","file_url":"https://github.com/modar7/the_fairness_stitch/blob/HEAD/src/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":"c691b280c17d59c0","code_sha256_prefix":"c691b280c17d59c0","mcp_get_code":{"code_sha256":"c691b280c17d59c0"}},{"arxiv_id":"2302.07257","arxiv_id_is_arxiv":true,"paper":"/paper/chatcad-interactive-computer-aided-diagnosis","title":"ChatCAD: Interactive Computer-Aided Diagnosis on Medical Image using Large Language Models","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaozh10/ChatCAD","path":"cxr/diagnosis.py","file_url":"https://github.com/zhaozh10/ChatCAD/blob/HEAD/cxr/diagnosis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f0d6025716c6e55a","code_sha256_prefix":"f0d6025716c6e55a","mcp_get_code":{"code_sha256":"f0d6025716c6e55a"}},{"arxiv_id":"2211.04279","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-shortcuts-in-medical-images-a-case","title":"Detecting Shortcuts in Medical Images -- A Case Study in Chest X-rays","date":"2022-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ameliajimenez/shortcuts-chest-xray","path":"bin/test_model.py","file_url":"https://github.com/ameliajimenez/shortcuts-chest-xray/blob/HEAD/bin/test_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ameliajimenez/shortcuts-chest-xray when it was checked","code_sha256":"a925c89a990e4ad6","code_sha256_prefix":"a925c89a990e4ad6","mcp_get_code":{"code_sha256":"a925c89a990e4ad6"}},{"arxiv_id":"2210.02419","arxiv_id_is_arxiv":true,"paper":"/paper/explanation-uncertainty-with-decision","title":"Boundary-Aware Uncertainty for Feature Attribution Explainers","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davinhill/gpec","path":"GPEC/GP.py","file_url":"https://github.com/davinhill/gpec/blob/HEAD/GPEC/GP.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":"86bab81e90151905","code_sha256_prefix":"86bab81e90151905","mcp_get_code":{"code_sha256":"86bab81e90151905"}},{"arxiv_id":"2203.03802","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-iterative-revision-from-human","title":"Understanding Iterative Revision from Human-Written Text","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vipulraheja/iterater","path":"code/IteraTeR_ACL2022/model/generation/bart_inference_and_metrics.py","file_url":"https://github.com/vipulraheja/iterater/blob/HEAD/code/IteraTeR_ACL2022/model/generation/bart_inference_and_metrics.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":"08582d047537b71e","code_sha256_prefix":"08582d047537b71e","mcp_get_code":{"code_sha256":"08582d047537b71e"}},{"arxiv_id":"2203.03802","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-iterative-revision-from-human","title":"Understanding Iterative Revision from Human-Written Text","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vipulraheja/iterater","path":"code/IteraTeR_ACL2022/model/generation/pegasus_inference_and_metrics.py","file_url":"https://github.com/vipulraheja/iterater/blob/HEAD/code/IteraTeR_ACL2022/model/generation/pegasus_inference_and_metrics.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":"d683a5a86dabd653","code_sha256_prefix":"d683a5a86dabd653","mcp_get_code":{"code_sha256":"d683a5a86dabd653"}},{"arxiv_id":"2011.05864","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-sentence-embeddings-from-pre-trained","title":"On the Sentence Embeddings from Pre-trained Language Models","date":"2020-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bohanli/BERT-flow","path":"scripts/eval_stsb.py","file_url":"https://github.com/bohanli/BERT-flow/blob/HEAD/scripts/eval_stsb.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b6418910c030c74","code_sha256_prefix":"3b6418910c030c74","mcp_get_code":{"code_sha256":"3b6418910c030c74"}},{"arxiv_id":"2025.findings-acl.433","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.433","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"haon-chen/mmE5","path":"evaluation/eval_utils.py","file_url":"https://github.com/haon-chen/mmE5/blob/HEAD/evaluation/eval_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":"1a5d849f73e20d05","code_sha256_prefix":"1a5d849f73e20d05","mcp_get_code":{"code_sha256":"1a5d849f73e20d05"}},{"arxiv_id":"2025.emnlp-main.1179","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.1179","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"csdq777/Lotus","path":"X/model.py","file_url":"https://github.com/csdq777/Lotus/blob/HEAD/X/model.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":"c70a55ce586ba43d","code_sha256_prefix":"c70a55ce586ba43d","mcp_get_code":{"code_sha256":"c70a55ce586ba43d"}}],"record_sha256":"298a699ea0fd29aca3a3e02e01ddf55ec4ecc45f5234f864273e75c71f9c0848","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}