{"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/retriever","entry":"Retriever","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":11,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":11,"n_samples_ran":7,"n_samples_constructed":4,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":6,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"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":"2606.23881","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-23881","title":"Ground Then Rank: Revisiting Knowledge-Based VQA with Training-Free Entity Identification","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Go2Heart/EchoSight","path":"model/retriever.py","file_url":"https://github.com/Go2Heart/EchoSight/blob/HEAD/model/retriever.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":"128dc22d75efa617","code_sha256_prefix":"128dc22d75efa617","mcp_get_code":{"code_sha256":"128dc22d75efa617"}},{"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","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, zihangtian/HAPS when it was checked","code_sha256":"421651a025757bd2","code_sha256_prefix":"421651a025757bd2","mcp_get_code":{"code_sha256":"421651a025757bd2"}},{"arxiv_id":"2505.07879","arxiv_id_is_arxiv":true,"paper":"/paper/omgm-orchestrate-multiple-granularities-and","title":"OMGM: Orchestrate Multiple Granularities and Modalities for Efficient Multimodal Retrieval","date":"2025-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChaoLinAViy/OMGM","path":"model/retriever.py","file_url":"https://github.com/ChaoLinAViy/OMGM/blob/HEAD/model/retriever.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, ChaoLinAViy/OMGM when it was checked","code_sha256":"fa30ec70782d65f2","code_sha256_prefix":"fa30ec70782d65f2","mcp_get_code":{"code_sha256":"fa30ec70782d65f2"}},{"arxiv_id":"2410.20724","arxiv_id_is_arxiv":true,"paper":"/paper/simple-is-effective-the-roles-of-graphs-and","title":"Simple Is Effective: The Roles of Graphs and Large Language Models in Knowledge-Graph-Based Retrieval-Augmented Generation","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-com/subgraphrag","path":"retrieve/src/model/retriever.py","file_url":"https://github.com/graph-com/subgraphrag/blob/HEAD/retrieve/src/model/retriever.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":"a0086a56c06edbff","code_sha256_prefix":"a0086a56c06edbff","mcp_get_code":{"code_sha256":"a0086a56c06edbff"}},{"arxiv_id":"2406.14979","arxiv_id_is_arxiv":true,"paper":"/paper/retrieve-plan-generation-an-iterative","title":"Retrieve-Plan-Generation: An Iterative Planning and Answering Framework for Knowledge-Intensive LLM Generation","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haruhi-sudo/RPG","path":"retriever/passage_retrieval.py","file_url":"https://github.com/haruhi-sudo/RPG/blob/HEAD/retriever/passage_retrieval.py","status":"ran","verification_level":1,"contract_check":null,"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, haruhi-sudo/RPG when it was checked","code_sha256":"7da1c23a709ab06e","code_sha256_prefix":"7da1c23a709ab06e","mcp_get_code":{"code_sha256":"7da1c23a709ab06e"}},{"arxiv_id":"2403.00801","arxiv_id_is_arxiv":true,"paper":"/paper/self-retrieval-building-an-information","title":"Self-Retrieval: End-to-End Information Retrieval with One Large Language Model","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tangqiaoyu/selfretrieval","path":"evaluation/predict.py","file_url":"https://github.com/tangqiaoyu/selfretrieval/blob/HEAD/evaluation/predict.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, tangqiaoyu/selfretrieval when it was checked","code_sha256":"0cfdc6cb7b4cd04e","code_sha256_prefix":"0cfdc6cb7b4cd04e","mcp_get_code":{"code_sha256":"0cfdc6cb7b4cd04e"}},{"arxiv_id":"2310.01329","arxiv_id_is_arxiv":true,"paper":"/paper/btr-binary-token-representations-for","title":"BTR: Binary Token Representations for Efficient Retrieval Augmented Language Models","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csarron/btr","path":"BTR-BERT/src/btr/models/modeling_retriever.py","file_url":"https://github.com/csarron/btr/blob/HEAD/BTR-BERT/src/btr/models/modeling_retriever.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, csarron/btr when it was checked","code_sha256":"fed50449261dcbeb","code_sha256_prefix":"fed50449261dcbeb","mcp_get_code":{"code_sha256":"fed50449261dcbeb"}},{"arxiv_id":"2308.10633","arxiv_id_is_arxiv":true,"paper":"/paper/ralle-a-framework-for-developing-and","title":"RaLLe: A Framework for Developing and Evaluating Retrieval-Augmented Large Language Models","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhoshi3/RaLLe","path":"ralle/retrievers/initialize.py","file_url":"https://github.com/yhoshi3/RaLLe/blob/HEAD/ralle/retrievers/initialize.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":"fae9ccd49478bc2c","code_sha256_prefix":"fae9ccd49478bc2c","mcp_get_code":{"code_sha256":"fae9ccd49478bc2c"}},{"arxiv_id":"2305.09645","arxiv_id_is_arxiv":true,"paper":"/paper/structgpt-a-general-framework-for-large","title":"StructGPT: A General Framework for Large Language Model to Reason over Structured Data","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUCAIBox/StructGPT","path":"structgpt_for_tableqa.py","file_url":"https://github.com/RUCAIBox/StructGPT/blob/HEAD/structgpt_for_tableqa.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":"8d2a6c5b5165e0c8","code_sha256_prefix":"8d2a6c5b5165e0c8","mcp_get_code":{"code_sha256":"8d2a6c5b5165e0c8"}},{"arxiv_id":"2301.11879","arxiv_id_is_arxiv":true,"paper":"/paper/case-based-reasoning-with-language-models-for","title":"Case-Based Reasoning with Language Models for Classification of Logical Fallacies","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhpinkman/CBR","path":"cbr_analyser/reasoner/classifier_with_attention_bert.py","file_url":"https://github.com/zhpinkman/CBR/blob/HEAD/cbr_analyser/reasoner/classifier_with_attention_bert.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, zhpinkman/CBR when it was checked","code_sha256":"0d0d04967373a856","code_sha256_prefix":"0d0d04967373a856","mcp_get_code":{"code_sha256":"0d0d04967373a856"}},{"arxiv_id":"2207.05987","arxiv_id_is_arxiv":true,"paper":"/paper/doccoder-generating-code-by-retrieving-and","title":"DocPrompting: Generating Code by Retrieving the Docs","date":"2022-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuyanzhou/doccoder","path":"generator/fid/src/model.py","file_url":"https://github.com/shuyanzhou/doccoder/blob/HEAD/generator/fid/src/model.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":"e6e89b2e0804678e","code_sha256_prefix":"e6e89b2e0804678e","mcp_get_code":{"code_sha256":"e6e89b2e0804678e"}}],"record_sha256":"60f561769d176d23bc0d598ec46228858bd7d1acefe916d8b5cd7249d03d74a1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}