{"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/regex-match","entry":"regex_match","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"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":0,"ran_violates":2,"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":"2404.04163","arxiv_id_is_arxiv":true,"paper":"/paper/dwell-in-the-beginning-how-language-models","title":"Dwell in the Beginning: How Language Models Embed Long Documents for Dense Retrieval","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cxcscmu/longembeddinganalysis","path":"OpenMatch/src/openmatch/qa_utils.py","file_url":"https://github.com/cxcscmu/longembeddinganalysis/blob/HEAD/OpenMatch/src/openmatch/qa_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cxcscmu/longembeddinganalysis when it was checked","code_sha256":"93b0eef32604c3f7","code_sha256_prefix":"93b0eef32604c3f7","mcp_get_code":{"code_sha256":"93b0eef32604c3f7"}},{"arxiv_id":"2308.13259","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-driven-cot-exploring-faithful","title":"Knowledge-Driven CoT: Exploring Faithful Reasoning in LLMs for Knowledge-intensive Question Answering","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adelwang/kd-cot","path":"pipeline/Retriever/Retriever.py","file_url":"https://github.com/adelwang/kd-cot/blob/HEAD/pipeline/Retriever/Retriever.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, adelwang/kd-cot when it was checked","code_sha256":"442d4287320d335d","code_sha256_prefix":"442d4287320d335d","mcp_get_code":{"code_sha256":"442d4287320d335d"}},{"arxiv_id":"2305.19912","arxiv_id_is_arxiv":true,"paper":"/paper/structure-aware-language-model-pretraining","title":"Structure-Aware Language Model Pretraining Improves Dense Retrieval on Structured Data","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/openmatch","path":"src/openmatch/qa_utils.py","file_url":"https://github.com/openmatch/openmatch/blob/HEAD/src/openmatch/qa_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93b0eef32604c3f7","code_sha256_prefix":"93b0eef32604c3f7","mcp_get_code":{"code_sha256":"93b0eef32604c3f7"}},{"arxiv_id":"2305.17331","arxiv_id_is_arxiv":true,"paper":"/paper/augmentation-adapted-retriever-improves","title":"Augmentation-Adapted Retriever Improves Generalization of Language Models as Generic Plug-In","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenMatch/Augmentation-Adapted-Retriever","path":"src/Retriever/qa_utils.py","file_url":"https://github.com/OpenMatch/Augmentation-Adapted-Retriever/blob/HEAD/src/Retriever/qa_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93b0eef32604c3f7","code_sha256_prefix":"93b0eef32604c3f7","mcp_get_code":{"code_sha256":"93b0eef32604c3f7"}},{"arxiv_id":"2305.06984","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-open-domain-question-answering-in","title":"Evaluating Open-Domain Question Answering in the Era of Large Language Models","date":"2023-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ehsk/openqa-eval","path":"src/oqaeval/squad_evaluate.py","file_url":"https://github.com/ehsk/openqa-eval/blob/HEAD/src/oqaeval/squad_evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db77dd5d7d909a53","code_sha256_prefix":"db77dd5d7d909a53","mcp_get_code":{"code_sha256":"db77dd5d7d909a53"}},{"arxiv_id":"2102.10073","arxiv_id_is_arxiv":true,"paper":"/paper/pyserini-an-easy-to-use-python-toolkit-to","title":"Pyserini: An Easy-to-Use Python Toolkit to Support Replicable IR Research with Sparse and Dense Representations","date":"2021-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/pyserini","path":"pyserini/eval/evaluate_dpr_retrieval.py","file_url":"https://github.com/castorini/pyserini/blob/HEAD/pyserini/eval/evaluate_dpr_retrieval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93b0eef32604c3f7","code_sha256_prefix":"93b0eef32604c3f7","mcp_get_code":{"code_sha256":"93b0eef32604c3f7"}},{"arxiv_id":"2101.00294","arxiv_id_is_arxiv":true,"paper":"/paper/reader-guided-passage-reranking-for-open","title":"Rider: Reader-Guided Passage Reranking for Open-Domain Question Answering","date":"2021-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morningmoni/GAR","path":"rider/rider.py","file_url":"https://github.com/morningmoni/GAR/blob/HEAD/rider/rider.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, morningmoni/GAR when it was checked","code_sha256":"442d4287320d335d","code_sha256_prefix":"442d4287320d335d","mcp_get_code":{"code_sha256":"442d4287320d335d"}},{"arxiv_id":"2023.findings-acl.734","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.734","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"OpenMatch/OpenMatch","path":"src/openmatch/qa_utils.py","file_url":"https://github.com/OpenMatch/OpenMatch/blob/HEAD/src/openmatch/qa_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93b0eef32604c3f7","code_sha256_prefix":"93b0eef32604c3f7","mcp_get_code":{"code_sha256":"93b0eef32604c3f7"}}],"record_sha256":"d35537acd21c8a2aeb2ecc126de161c2021f69b309da327d4ba84a34370fac49","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}