{"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/add-embeddings","entry":"add_embeddings","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":1,"n_papers_ran_instrument_only":7,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":7,"n_places_pointer_only_link_open":2,"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":1,"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":"2604.11628","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11628","title":"Back to Basics: Let Conversational Agents Remember with Just Retrieval and Generation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"facebookresearch/contriever","path":"passage_retrieval.py","file_url":"https://github.com/facebookresearch/contriever/blob/HEAD/passage_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, facebookresearch/contriever when it was checked","code_sha256":"bc7a7a194c238080","code_sha256_prefix":"bc7a7a194c238080","mcp_get_code":{"code_sha256":"bc7a7a194c238080"}},{"arxiv_id":"2604.10900","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-10900","title":"CASK: Core-Aware Selective KV Compression for Reasoning Traces","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"THUDM/LongBench","path":"LongBench/retrieval/contriever/passage_retrieval.py","file_url":"https://github.com/THUDM/LongBench/blob/HEAD/LongBench/retrieval/contriever/passage_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","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 FenQQQ/Fusion-in-decoder, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"bc7a7a194c238080","code_sha256_prefix":"bc7a7a194c238080","mcp_get_code":{"code_sha256":"bc7a7a194c238080"}},{"arxiv_id":"2407.12854","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-retrieval-based-language-models-with","title":"Scaling Retrieval-Based Language Models with a Trillion-Token Datastore","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rulinshao/retrieval-scaling","path":"contriever/passage_retrieval.py","file_url":"https://github.com/rulinshao/retrieval-scaling/blob/HEAD/contriever/passage_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","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 FenQQQ/Fusion-in-decoder, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"bc7a7a194c238080","code_sha256_prefix":"bc7a7a194c238080","mcp_get_code":{"code_sha256":"bc7a7a194c238080"}},{"arxiv_id":"2403.06840","arxiv_id_is_arxiv":true,"paper":"/paper/ra-isf-learning-to-answer-and-understand-from","title":"RA-ISF: Learning to Answer and Understand from Retrieval Augmentation via Iterative Self-Feedback","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oceanntwt/ra-isf","path":"retrieval_contriever/passage_retrieval.py","file_url":"https://github.com/oceanntwt/ra-isf/blob/HEAD/retrieval_contriever/passage_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, oceanntwt/ra-isf when it was checked","code_sha256":"bc7a7a194c238080","code_sha256_prefix":"bc7a7a194c238080","mcp_get_code":{"code_sha256":"bc7a7a194c238080"}},{"arxiv_id":"2402.05391","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-graphs-meet-multi-modal-learning-a","title":"Knowledge Graphs Meet Multi-Modal Learning: A Comprehensive Survey","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hackerchenzhuo/LaKo","path":"fact_retrieval.py","file_url":"https://github.com/hackerchenzhuo/LaKo/blob/HEAD/fact_retrieval.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":"ac1c2010e4fa00c6","code_sha256_prefix":"ac1c2010e4fa00c6","mcp_get_code":{"code_sha256":"ac1c2010e4fa00c6"}},{"arxiv_id":"2401.16979","arxiv_id_is_arxiv":true,"paper":"/paper/re3val-reinforced-and-reranked-generative","title":"Re3val: Reinforced and Reranked Generative Retrieval","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/FiD","path":"passage_retrieval.py","file_url":"https://github.com/facebookresearch/FiD/blob/HEAD/passage_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, facebookresearch/FiD when it was checked","code_sha256":"bc7a7a194c238080","code_sha256_prefix":"bc7a7a194c238080","mcp_get_code":{"code_sha256":"bc7a7a194c238080"}},{"arxiv_id":"2311.09805","arxiv_id_is_arxiv":true,"paper":"/paper/docmath-eval-evaluating-numerical-reasoning","title":"DocMath-Eval: Evaluating Math Reasoning Capabilities of LLMs in Understanding Long and Specialized Documents","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-nlp/docmath-eval","path":"retriever/src/index.py","file_url":"https://github.com/yale-nlp/docmath-eval/blob/HEAD/retriever/src/index.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yale-nlp/docmath-eval when it was checked","code_sha256":"bc7a7a194c238080","code_sha256_prefix":"bc7a7a194c238080","mcp_get_code":{"code_sha256":"bc7a7a194c238080"}},{"arxiv_id":"2012.04584","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-knowledge-from-reader-to-retriever-1","title":"Distilling Knowledge from Reader to Retriever for Question Answering","date":"2020-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FenQQQ/Fusion-in-decoder","path":"passage_retrieval.py","file_url":"https://github.com/FenQQQ/Fusion-in-decoder/blob/HEAD/passage_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","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, FenQQQ/Fusion-in-decoder (NOASSERTION)","code_sha256":"bc7a7a194c238080","code_sha256_prefix":"bc7a7a194c238080","mcp_get_code":{"code_sha256":"bc7a7a194c238080"}}],"record_sha256":"3455372084d0acb966f22dd52895287d5a07befe396b0c0f72e85882c6425954","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}