{"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/em","entry":"em","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":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":10,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":14,"n_places_pointer_only":9,"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":3,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":4},"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":"2607.26339","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-26339","title":"RAGuard: A Layered Defense Framework for Retrieval-Augmented Generation Systems Against Data Poisoning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"RAGuard-AI/RAGuard","path":"defences/scorer.py","file_url":"https://github.com/RAGuard-AI/RAGuard/blob/HEAD/defences/scorer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81076a2476f2505d","code_sha256_prefix":"81076a2476f2505d","mcp_get_code":{"code_sha256":"81076a2476f2505d"}},{"arxiv_id":"2601.05903","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05903","title":"HAPS: Hierarchical LLM Routing with Joint Architecture and Parameter Search","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"zihangtian/HAPS","path":"HotpotQA/joint_rl/rl_batch.py","file_url":"https://github.com/zihangtian/HAPS/blob/HEAD/HotpotQA/joint_rl/rl_batch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, zihangtian/HAPS when it was checked","code_sha256":"3bbfdafb9b91dbc5","code_sha256_prefix":"3bbfdafb9b91dbc5","mcp_get_code":{"code_sha256":"3bbfdafb9b91dbc5"}},{"arxiv_id":"2601.03042","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03042","title":"BaseCal: Unsupervised Confidence Calibration via Base Model Signals","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Tan-Hexiang/BaseCal","path":"gen_metric/em.py","file_url":"https://github.com/Tan-Hexiang/BaseCal/blob/HEAD/gen_metric/em.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Tan-Hexiang/BaseCal when it was checked","code_sha256":"b38e9fba40933c59","code_sha256_prefix":"b38e9fba40933c59","mcp_get_code":{"code_sha256":"b38e9fba40933c59"}},{"arxiv_id":"2410.05162","arxiv_id_is_arxiv":true,"paper":"/paper/deciphering-the-interplay-of-parametric-and","title":"Deciphering the Interplay of Parametric and Non-parametric Memory in Retrieval-augmented Language Models","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m3hrdadfi/rag-memory-interplay","path":"src/atlas/evaluation.py","file_url":"https://github.com/m3hrdadfi/rag-memory-interplay/blob/HEAD/src/atlas/evaluation.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, m3hrdadfi/rag-memory-interplay when it was checked","code_sha256":"38c3b1ee62b65838","code_sha256_prefix":"38c3b1ee62b65838","mcp_get_code":{"code_sha256":"38c3b1ee62b65838"}},{"arxiv_id":"2406.18847","arxiv_id_is_arxiv":true,"paper":"/paper/learning-retrieval-augmentation-for","title":"Learning Retrieval Augmentation for Personalized Dialogue Generation","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqsiswiliam/lapdog","path":"src/evaluation.py","file_url":"https://github.com/hqsiswiliam/lapdog/blob/HEAD/src/evaluation.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, hqsiswiliam/lapdog when it was checked","code_sha256":"38c3b1ee62b65838","code_sha256_prefix":"38c3b1ee62b65838","mcp_get_code":{"code_sha256":"38c3b1ee62b65838"}},{"arxiv_id":"2406.18187","arxiv_id_is_arxiv":true,"paper":"/paper/selective-prompting-tuning-for-personalized","title":"Selective Prompting Tuning for Personalized Conversations with LLMs","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqsiswiliam/SPT","path":"evaluation.py","file_url":"https://github.com/hqsiswiliam/SPT/blob/HEAD/evaluation.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, hqsiswiliam/SPT when it was checked","code_sha256":"38c3b1ee62b65838","code_sha256_prefix":"38c3b1ee62b65838","mcp_get_code":{"code_sha256":"38c3b1ee62b65838"}},{"arxiv_id":"2406.05654","arxiv_id_is_arxiv":true,"paper":"/paper/domainrag-a-chinese-benchmark-for-evaluating","title":"DomainRAG: A Chinese Benchmark for Evaluating Domain-specific Retrieval-Augmented Generation","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShootingWong/DomainRAG","path":"BCM/evaluation/Evaluator.py","file_url":"https://github.com/ShootingWong/DomainRAG/blob/HEAD/BCM/evaluation/Evaluator.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, ShootingWong/DomainRAG when it was checked","code_sha256":"abd810c2287f2f36","code_sha256_prefix":"abd810c2287f2f36","mcp_get_code":{"code_sha256":"abd810c2287f2f36"}},{"arxiv_id":"2310.12836","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-augmented-language-model","title":"Knowledge-Augmented Language Model Verification","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinheonBaek/KALMV","path":"models/verifiers.py","file_url":"https://github.com/JinheonBaek/KALMV/blob/HEAD/models/verifiers.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, JinheonBaek/KALMV when it was checked","code_sha256":"008bf270c07cb383","code_sha256_prefix":"008bf270c07cb383","mcp_get_code":{"code_sha256":"008bf270c07cb383"}},{"arxiv_id":"2308.07922","arxiv_id_is_arxiv":true,"paper":"/paper/raven-in-context-learning-with-retrieval","title":"RAVEN: In-Context Learning with Retrieval-Augmented Encoder-Decoder Language Models","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeffhj/raven","path":"src/evaluation.py","file_url":"https://github.com/jeffhj/raven/blob/HEAD/src/evaluation.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, jeffhj/raven when it was checked","code_sha256":"38c3b1ee62b65838","code_sha256_prefix":"38c3b1ee62b65838","mcp_get_code":{"code_sha256":"38c3b1ee62b65838"}},{"arxiv_id":"2305.16215","arxiv_id_is_arxiv":true,"paper":"/paper/koopman-kernel-regression-1","title":"Koopman Kernel Regression","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ceyron/machine-learning-and-simulation","path":"english/probabilistic_machine_learning/em_gmm.py","file_url":"https://github.com/Ceyron/machine-learning-and-simulation/blob/HEAD/english/probabilistic_machine_learning/em_gmm.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":"362705c2ca3ed543","code_sha256_prefix":"362705c2ca3ed543","mcp_get_code":{"code_sha256":"362705c2ca3ed543"}},{"arxiv_id":"2305.16215","arxiv_id_is_arxiv":true,"paper":"/paper/koopman-kernel-regression-1","title":"Koopman Kernel Regression","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ceyron/machine-learning-and-simulation","path":"english/probabilistic_machine_learning/em_multivariate_gmm.py","file_url":"https://github.com/Ceyron/machine-learning-and-simulation/blob/HEAD/english/probabilistic_machine_learning/em_multivariate_gmm.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":"ca84bfff521d9b46","code_sha256_prefix":"ca84bfff521d9b46","mcp_get_code":{"code_sha256":"ca84bfff521d9b46"}},{"arxiv_id":"2305.16215","arxiv_id_is_arxiv":true,"paper":"/paper/koopman-kernel-regression-1","title":"Koopman Kernel Regression","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ceyron/machine-learning-and-simulation","path":"english/probabilistic_machine_learning/contrib/em_gmm_multivariate.py","file_url":"https://github.com/Ceyron/machine-learning-and-simulation/blob/HEAD/english/probabilistic_machine_learning/contrib/em_gmm_multivariate.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":"057f69e5229c5333","code_sha256_prefix":"057f69e5229c5333","mcp_get_code":{"code_sha256":"057f69e5229c5333"}},{"arxiv_id":"2202.08786","arxiv_id_is_arxiv":true,"paper":"/paper/refined-convergence-rates-for-maximum","title":"Refined Convergence Rates for Maximum Likelihood Estimation under Finite Mixture Models","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmanole/refined-mixture-rates","path":"functions.py","file_url":"https://github.com/tmanole/refined-mixture-rates/blob/HEAD/functions.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":"4e549781120da24a","code_sha256_prefix":"4e549781120da24a","mcp_get_code":{"code_sha256":"4e549781120da24a"}},{"arxiv_id":"2025.emnlp-main.292","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.292","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RUC-NLPIR/OmniEval","path":"utils/evaluation.py","file_url":"https://github.com/RUC-NLPIR/OmniEval/blob/HEAD/utils/evaluation.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 m3hrdadfi/rag-memory-interplay, and GitHub detected no licence in that repository when it was checked","code_sha256":"38c3b1ee62b65838","code_sha256_prefix":"38c3b1ee62b65838","mcp_get_code":{"code_sha256":"38c3b1ee62b65838"}}],"record_sha256":"157c6913bd238a9b3d02d162850be750ff27024a123d6c47d531f62e977fa2a7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}