{"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/cross-attention-forward","entry":"cross_attention_forward","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":14,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":11,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":9,"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":2,"ran":0,"unverified":1},"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":"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/fid.py","file_url":"https://github.com/m3hrdadfi/rag-memory-interplay/blob/HEAD/src/atlas/fid.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, m3hrdadfi/rag-memory-interplay when it was checked","code_sha256":"a94b66d049f10dc8","code_sha256_prefix":"a94b66d049f10dc8","mcp_get_code":{"code_sha256":"a94b66d049f10dc8"}},{"arxiv_id":"2409.19804","arxiv_id_is_arxiv":true,"paper":"/paper/does-rag-introduce-unfairness-in-llms","title":"Does RAG Introduce Unfairness in LLMs? Evaluating Fairness in Retrieval-Augmented Generation Systems","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elviswxy/rag_fairness","path":"flashrag/generator/fid.py","file_url":"https://github.com/elviswxy/rag_fairness/blob/HEAD/flashrag/generator/fid.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, elviswxy/rag_fairness when it was checked","code_sha256":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"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/fid.py","file_url":"https://github.com/hqsiswiliam/lapdog/blob/HEAD/src/fid.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, hqsiswiliam/lapdog when it was checked","code_sha256":"a94b66d049f10dc8","code_sha256_prefix":"a94b66d049f10dc8","mcp_get_code":{"code_sha256":"a94b66d049f10dc8"}},{"arxiv_id":"2403.15268","arxiv_id_is_arxiv":true,"paper":"/paper/imagination-augmented-generation-learning-to","title":"Awakening Augmented Generation: Learning to Awaken Internal Knowledge of Large Language Models for Question Answering","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xnhyacinth/iag","path":"ft_llama/model.py","file_url":"https://github.com/xnhyacinth/iag/blob/HEAD/ft_llama/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"arxiv_id":"2402.15838","arxiv_id_is_arxiv":true,"paper":"/paper/listt5-listwise-reranking-with-fusion-in","title":"ListT5: Listwise Reranking with Fusion-in-Decoder Improves Zero-shot Retrieval","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","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":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"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":"src/model.py","file_url":"https://github.com/hackerchenzhuo/LaKo/blob/HEAD/src/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"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":"src/model.py","file_url":"https://github.com/facebookresearch/FiD/blob/HEAD/src/model.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":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"arxiv_id":"2312.05762","arxiv_id_is_arxiv":true,"paper":"/paper/multi-defendant-legal-judgment-prediction-via","title":"Multi-Defendant Legal Judgment Prediction via Hierarchical Reasoning","date":"2023-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"currentf/hrn","path":"models/HRN/src/model.py","file_url":"https://github.com/currentf/hrn/blob/HEAD/models/HRN/src/model.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, currentf/hrn when it was checked","code_sha256":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"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/fid.py","file_url":"https://github.com/jeffhj/raven/blob/HEAD/src/fid.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, jeffhj/raven when it was checked","code_sha256":"a94b66d049f10dc8","code_sha256_prefix":"a94b66d049f10dc8","mcp_get_code":{"code_sha256":"a94b66d049f10dc8"}},{"arxiv_id":"2207.12888","arxiv_id_is_arxiv":true,"paper":"/paper/lako-knowledge-driven-visual-question","title":"LaKo: Knowledge-driven Visual Question Answering via Late Knowledge-to-Text Injection","date":"2022-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","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":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"arxiv_id":"2206.15474","arxiv_id_is_arxiv":true,"paper":"/paper/forecasting-future-world-events-with-neural","title":"Forecasting Future World Events with Neural Networks","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyzoujm/autocast","path":"autocast_experiments/src/model.py","file_url":"https://github.com/andyzoujm/autocast/blob/HEAD/autocast_experiments/src/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"arxiv_id":"2204.07770","arxiv_id_is_arxiv":true,"paper":"/paper/unigdd-a-unified-generative-framework-for","title":"UniGDD: A Unified Generative Framework for Goal-Oriented Document-Grounded Dialogue","date":"2022-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gao-xiao-bai/UniGDD","path":"model.py","file_url":"https://github.com/gao-xiao-bai/UniGDD/blob/HEAD/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, gao-xiao-bai/UniGDD when it was checked","code_sha256":"1874e854f6b824e3","code_sha256_prefix":"1874e854f6b824e3","mcp_get_code":{"code_sha256":"1874e854f6b824e3"}},{"arxiv_id":"2112.08688","arxiv_id_is_arxiv":true,"paper":"/paper/evidentiality-guided-generation-for-knowledge","title":"Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akariasai/evidentiality_qa","path":"evi_gen/src/model.py","file_url":"https://github.com/akariasai/evidentiality_qa/blob/HEAD/evi_gen/src/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}},{"arxiv_id":"2108.06314","arxiv_id_is_arxiv":true,"paper":"/paper/a-dataset-for-answering-time-sensitive","title":"A Dataset for Answering Time-Sensitive Questions","date":"2021-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenhuchen/time-sensitive-qa","path":"FiD/model.py","file_url":"https://github.com/wenhuchen/time-sensitive-qa/blob/HEAD/FiD/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6bef6bdd6eb44070","code_sha256_prefix":"6bef6bdd6eb44070","mcp_get_code":{"code_sha256":"6bef6bdd6eb44070"}}],"record_sha256":"a68b9622702c4cd6fa5930c9956474c26bf75fa302e58f93665e0c00a1fb3581","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}