{"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/select-field","entry":"select_field","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":1,"n_papers_ran_no_instrument_failure":1,"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":3,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":12,"n_places_pointer_only_link_open":7,"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":1,"unverified":2},"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":"2505.11683","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-design-decisions-for-dual-encoder","title":"Evaluating Design Decisions for Dual Encoder-based Entity Disambiguation","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/BLINK","path":"blink/biencoder/data_process.py","file_url":"https://github.com/facebookresearch/BLINK/blob/HEAD/blink/biencoder/data_process.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/BLINK, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"bff0f2e6d48007b2","code_sha256_prefix":"bff0f2e6d48007b2","mcp_get_code":{"code_sha256":"bff0f2e6d48007b2"}},{"arxiv_id":"2402.02636","arxiv_id_is_arxiv":true,"paper":"/paper/can-large-language-models-learn-independent","title":"Can Large Language Models Learn Independent Causal Mechanisms?","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Strong-AI-Lab/Logical-and-abstract-reasoning","path":"models/run_multiple_choice.py","file_url":"https://github.com/Strong-AI-Lab/Logical-and-abstract-reasoning/blob/HEAD/models/run_multiple_choice.py","status":"unverified","verification_level":0,"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 yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"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":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 yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"2310.09430","arxiv_id_is_arxiv":true,"paper":"/paper/a-systematic-evaluation-of-large-language-1","title":"Assessing and Enhancing the Robustness of Large Language Models with Task Structure Variations for Logical Reasoning","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"strong-ai-lab/logical-and-abstract-reasoning","path":"models/run_multiple_choice.py","file_url":"https://github.com/strong-ai-lab/logical-and-abstract-reasoning/blob/HEAD/models/run_multiple_choice.py","status":"unverified","verification_level":0,"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 yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"2108.00648","arxiv_id_is_arxiv":true,"paper":"/paper/from-lsat-the-progress-and-challenges-of","title":"From LSAT: The Progress and Challenges of Complex Reasoning","date":"2021-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongwanjun/AR-LSAT","path":"LSTM/main_large.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/LSTM/main_large.py","status":"unverified","verification_level":0,"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 yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"2011.03080","arxiv_id_is_arxiv":true,"paper":"/paper/exams-a-multi-subject-high-school","title":"EXAMS: A Multi-Subject High School Examinations Dataset for Cross-Lingual and Multilingual Question Answering","date":"2020-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"2009.06504","arxiv_id_is_arxiv":true,"paper":"/paper/filling-the-gap-of-utterance-aware-and","title":"Filling the Gap of Utterance-aware and Speaker-aware Representation for Multi-turn Dialogue","date":"2020-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"comprehensiveMap/MDFN","path":"run_MDFN.py","file_url":"https://github.com/comprehensiveMap/MDFN/blob/HEAD/run_MDFN.py","status":"unverified","verification_level":0,"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 yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"2004.11546","arxiv_id_is_arxiv":true,"paper":"/paper/g-daug-generative-data-augmentation-for","title":"Generative Data Augmentation for Commonsense Reasoning","date":"2020-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyiben/G-DAUG-c-Generative-Data-Augmentation-for-Commonsense-Reasoning","path":"finetune_gd_swag.py","file_url":"https://github.com/yangyiben/G-DAUG-c-Generative-Data-Augmentation-for-Commonsense-Reasoning/blob/HEAD/finetune_gd_swag.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, yangyiben/G-DAUG-c-Generative-Data-Augmentation-for-Commonsense-Reasoning when it was checked","code_sha256":"56c5c1024fb026bd","code_sha256_prefix":"56c5c1024fb026bd","mcp_get_code":{"code_sha256":"56c5c1024fb026bd"}},{"arxiv_id":"2004.04494","arxiv_id_is_arxiv":true,"paper":"/paper/mutual-a-dataset-for-multi-turn-dialogue","title":"MuTual: A Dataset for Multi-Turn Dialogue Reasoning","date":"2020-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nealcly/MuTual","path":"baseline/multi-choice/run_multiple_choice.py","file_url":"https://github.com/Nealcly/MuTual/blob/HEAD/baseline/multi-choice/run_multiple_choice.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, Nealcly/MuTual when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"2002.04326","arxiv_id_is_arxiv":true,"paper":"/paper/reclor-a-reading-comprehension-dataset-1","title":"ReClor: A Reading Comprehension Dataset Requiring Logical Reasoning","date":"2020-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuweihao/reclor","path":"run_multiple_choice.py","file_url":"https://github.com/yuweihao/reclor/blob/HEAD/run_multiple_choice.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, yuweihao/reclor when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"1908.05739","arxiv_id_is_arxiv":true,"paper":"/paper/abductive-commonsense-reasoning","title":"Abductive Commonsense Reasoning","date":"2019-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/abductive-commonsense-reasoning","path":"anli/data_processors.py","file_url":"https://github.com/allenai/abductive-commonsense-reasoning/blob/HEAD/anli/data_processors.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"arxiv_id":"aaai_29850","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29850","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ozyyshr/FocalReasoner","path":"run_multiple_choice.py","file_url":"https://github.com/ozyyshr/FocalReasoner/blob/HEAD/run_multiple_choice.py","status":"unverified","verification_level":0,"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 yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","mcp_get_code":{"code_sha256":"0a546b305d274996"}}],"record_sha256":"fdd4bcf354fcb72429e4c00ea4f4820a2b0784c8abeb0c1caaf3b03ea33e0484","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}