{"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/load-and-cache-examples","entry":"load_and_cache_examples","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":18,"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":19,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":17,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":4,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":17},"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":"2411.06448","arxiv_id_is_arxiv":true,"paper":"/paper/over-parameterized-student-model-via-tensor","title":"Over-parameterized Student Model via Tensor Decomposition Boosted Knowledge Distillation","date":"2024-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intell-sci-comput/OPDF","path":"BERT-of-Theseus/run_glue_MPO_losslayer.py","file_url":"https://github.com/intell-sci-comput/OPDF/blob/HEAD/BERT-of-Theseus/run_glue_MPO_losslayer.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":"97549800b52bcd2d","code_sha256_prefix":"97549800b52bcd2d","mcp_get_code":{"code_sha256":"97549800b52bcd2d"}},{"arxiv_id":"2410.04472","arxiv_id_is_arxiv":true,"paper":"/paper/collapsed-language-models-promote-fairness","title":"Collapsed Language Models Promote Fairness","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xujxyang/Fairness-NC-main","path":"adept/debias_original.py","file_url":"https://github.com/Xujxyang/Fairness-NC-main/blob/HEAD/adept/debias_original.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, Xujxyang/Fairness-NC-main when it was checked","code_sha256":"f46fa5e6d0948125","code_sha256_prefix":"f46fa5e6d0948125","mcp_get_code":{"code_sha256":"f46fa5e6d0948125"}},{"arxiv_id":"2312.15614","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-parameter","title":"A Comprehensive Evaluation of Parameter-Efficient Fine-Tuning on Software Engineering Tasks","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwtnju/peft","path":"clone/code/clone.py","file_url":"https://github.com/zwtnju/peft/blob/HEAD/clone/code/clone.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, zwtnju/peft when it was checked","code_sha256":"c931ca2e34e6dbd9","code_sha256_prefix":"c931ca2e34e6dbd9","mcp_get_code":{"code_sha256":"c931ca2e34e6dbd9"}},{"arxiv_id":"2310.13316","arxiv_id_is_arxiv":true,"paper":"/paper/coarse-to-fine-dual-encoders-are-better-frame","title":"Coarse-to-Fine Dual Encoders are Better Frame Identification Learners","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkunlp-icler/cofftea","path":"code/dataset.py","file_url":"https://github.com/pkunlp-icler/cofftea/blob/HEAD/code/dataset.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":"3de6c82bab9412ea","code_sha256_prefix":"3de6c82bab9412ea","mcp_get_code":{"code_sha256":"3de6c82bab9412ea"}},{"arxiv_id":"2211.05414","arxiv_id_is_arxiv":true,"paper":"/paper/adept-a-debiasing-prompt-framework","title":"ADEPT: A DEbiasing PrompT Framework","date":"2022-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EmpathYang/ADEPT","path":"debias.py","file_url":"https://github.com/EmpathYang/ADEPT/blob/HEAD/debias.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Xujxyang/Fairness-NC-main, and GitHub detected no licence in that repository when it was checked","code_sha256":"f46fa5e6d0948125","code_sha256_prefix":"f46fa5e6d0948125","mcp_get_code":{"code_sha256":"f46fa5e6d0948125"}},{"arxiv_id":"2202.09381","arxiv_id_is_arxiv":true,"paper":"/paper/synthetic-disinformation-attacks-on-automated","title":"Synthetic Disinformation Attacks on Automated Fact Verification Systems","date":"2022-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yibing-du/adversarial-factcheck","path":"fever/corefbert/Pretrain/run_pretrain.py","file_url":"https://github.com/yibing-du/adversarial-factcheck/blob/HEAD/fever/corefbert/Pretrain/run_pretrain.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":"dc8e63d7478acf25","code_sha256_prefix":"dc8e63d7478acf25","mcp_get_code":{"code_sha256":"dc8e63d7478acf25"}},{"arxiv_id":"2105.14781","arxiv_id_is_arxiv":true,"paper":"/paper/a-semantic-based-method-for-unsupervised","title":"A Semantic-based Method for Unsupervised Commonsense Question Answering","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heylinsir/semantic-based-qa","path":"src/run_SEQA_generation.py","file_url":"https://github.com/heylinsir/semantic-based-qa/blob/HEAD/src/run_SEQA_generation.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":"a6129e1b4cbc4d2f","code_sha256_prefix":"a6129e1b4cbc4d2f","mcp_get_code":{"code_sha256":"a6129e1b4cbc4d2f"}},{"arxiv_id":"2105.14781","arxiv_id_is_arxiv":true,"paper":"/paper/a-semantic-based-method-for-unsupervised","title":"A Semantic-based Method for Unsupervised Commonsense Question Answering","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heylinsir/semantic-based-qa","path":"src/run_SEQA_voting.py","file_url":"https://github.com/heylinsir/semantic-based-qa/blob/HEAD/src/run_SEQA_voting.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":"a36518da7ffbc858","code_sha256_prefix":"a36518da7ffbc858","mcp_get_code":{"code_sha256":"a36518da7ffbc858"}},{"arxiv_id":"2103.11811","arxiv_id_is_arxiv":true,"paper":"/paper/masakhaner-named-entity-recognition-for","title":"MasakhaNER: Named Entity Recognition for African Languages","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"masakhane-io/masakhane-ner","path":"code/predict_ner.py","file_url":"https://github.com/masakhane-io/masakhane-ner/blob/HEAD/code/predict_ner.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, masakhane-io/masakhane-ner (NOASSERTION)","code_sha256":"a962fe586a31e797","code_sha256_prefix":"a962fe586a31e797","mcp_get_code":{"code_sha256":"a962fe586a31e797"}},{"arxiv_id":"2011.01513","arxiv_id_is_arxiv":true,"paper":"/paper/charbert-character-aware-pre-trained-language","title":"CharBERT: Character-aware Pre-trained Language Model","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wtma/CharBERT","path":"run_lm_finetuning.py","file_url":"https://github.com/wtma/CharBERT/blob/HEAD/run_lm_finetuning.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":"9db820e8f7a8258b","code_sha256_prefix":"9db820e8f7a8258b","mcp_get_code":{"code_sha256":"9db820e8f7a8258b"}},{"arxiv_id":"2010.05700","arxiv_id_is_arxiv":true,"paper":"/paper/reformulating-unsupervised-style-transfer-as","title":"Reformulating Unsupervised Style Transfer as Paraphrase Generation","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martiansideofthemoon/style-transfer-paraphrase","path":"style_paraphrase/run_lm_finetuning.py","file_url":"https://github.com/martiansideofthemoon/style-transfer-paraphrase/blob/HEAD/style_paraphrase/run_lm_finetuning.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":"f9b01438cd540c30","code_sha256_prefix":"f9b01438cd540c30","mcp_get_code":{"code_sha256":"f9b01438cd540c30"}},{"arxiv_id":"2010.01766","arxiv_id_is_arxiv":true,"paper":"/paper/demi-discriminative-estimator-of-mutual-1","title":"DEMI: Discriminative Estimator of Mutual Information","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RayRuizhiLiao/demi_mi_estimator","path":"utils.py","file_url":"https://github.com/RayRuizhiLiao/demi_mi_estimator/blob/HEAD/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":"8a456261317b11a7","code_sha256_prefix":"8a456261317b11a7","mcp_get_code":{"code_sha256":"8a456261317b11a7"}},{"arxiv_id":"2006.15509","arxiv_id_is_arxiv":true,"paper":"/paper/bond-bert-assisted-open-domain-named-entity","title":"BOND: BERT-Assisted Open-Domain Named Entity Recognition with Distant Supervision","date":"2020-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cliang1453/BOND","path":"data_utils.py","file_url":"https://github.com/cliang1453/BOND/blob/HEAD/data_utils.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":"d44194ff2ec0a210","code_sha256_prefix":"d44194ff2ec0a210","mcp_get_code":{"code_sha256":"d44194ff2ec0a210"}},{"arxiv_id":"2005.00770","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-and-predicting-transferability","title":"Exploring and Predicting Transferability across NLP Tasks","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuvuumass/task-transferability","path":"run_finetuning_CR.py","file_url":"https://github.com/tuvuumass/task-transferability/blob/HEAD/run_finetuning_CR.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":"5671be9e6de071d7","code_sha256_prefix":"5671be9e6de071d7","mcp_get_code":{"code_sha256":"5671be9e6de071d7"}},{"arxiv_id":"2005.00547","arxiv_id_is_arxiv":true,"paper":"/paper/goemotions-a-dataset-of-fine-grained-emotions","title":"GoEmotions: A Dataset of Fine-Grained Emotions","date":"2020-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"monologg/GoEmotions-pytorch","path":"data_loader.py","file_url":"https://github.com/monologg/GoEmotions-pytorch/blob/HEAD/data_loader.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":"5b789dfece5f5d6f","code_sha256_prefix":"5b789dfece5f5d6f","mcp_get_code":{"code_sha256":"5b789dfece5f5d6f"}},{"arxiv_id":"2002.02925","arxiv_id_is_arxiv":true,"paper":"/paper/bert-of-theseus-compressing-bert-by","title":"BERT-of-Theseus: Compressing BERT by Progressive Module Replacing","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JetRunner/BERT-of-Theseus","path":"run_glue.py","file_url":"https://github.com/JetRunner/BERT-of-Theseus/blob/HEAD/run_glue.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":"794b556e7b37a67d","code_sha256_prefix":"794b556e7b37a67d","mcp_get_code":{"code_sha256":"794b556e7b37a67d"}},{"arxiv_id":"2002.02925","arxiv_id_is_arxiv":true,"paper":"/paper/bert-of-theseus-compressing-bert-by","title":"BERT-of-Theseus: Compressing BERT by Progressive Module Replacing","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JetRunner/BERT-of-Theseus","path":"glue_script/run_prediction.py","file_url":"https://github.com/JetRunner/BERT-of-Theseus/blob/HEAD/glue_script/run_prediction.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":"afc76339aaf5823b","code_sha256_prefix":"afc76339aaf5823b","mcp_get_code":{"code_sha256":"afc76339aaf5823b"}},{"arxiv_id":"1911.02984","arxiv_id_is_arxiv":true,"paper":"/paper/the-techqa-dataset","title":"The TechQA Dataset","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/techqa","path":"techqa_processor.py","file_url":"https://github.com/ibm/techqa/blob/HEAD/techqa_processor.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":"64f34f8784ad0dbd","code_sha256_prefix":"64f34f8784ad0dbd","mcp_get_code":{"code_sha256":"64f34f8784ad0dbd"}},{"arxiv_id":"2023.emnlp-main.803","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-main.803","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yisunlp/Anti-CF","path":"utils/process.py","file_url":"https://github.com/yisunlp/Anti-CF/blob/HEAD/utils/process.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":"562b75692bdd7588","code_sha256_prefix":"562b75692bdd7588","mcp_get_code":{"code_sha256":"562b75692bdd7588"}},{"arxiv_id":"2022.emnlp-main.417","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.emnlp-main.417","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dmis-lab/GeNER","path":"self_training/data_utils.py","file_url":"https://github.com/dmis-lab/GeNER/blob/HEAD/self_training/data_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":"df77c460e4f9f5b0","code_sha256_prefix":"df77c460e4f9f5b0","mcp_get_code":{"code_sha256":"df77c460e4f9f5b0"}}],"record_sha256":"7899de7d97627bb22f239444f2290f22892e62392222365cdc8975a92201219f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}