{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/load-reference-from-stream","entry":"load_reference_from_stream","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":6,"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":4,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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.18812","paper":"/paper/efficient-inverted-indexes-for-approximate","title":"Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/anserini","path":"src/main/python/msmarco_compare.py","file_url":"https://github.com/castorini/anserini/blob/HEAD/src/main/python/msmarco_compare.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b09cad901d138056","mcp_get_code":{"code_sha256":"b09cad901d138056"}},{"arxiv_id":"2401.10487","paper":"/paper/generative-dense-retrieval-memory-can-be-a","title":"Generative Dense Retrieval: Memory Can Be a Burden","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ypw0102/gdr","path":"GDR_model/main_metrics.py","file_url":"https://github.com/ypw0102/gdr/blob/HEAD/GDR_model/main_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e99a1fef3b9d445c","mcp_get_code":{"code_sha256":"e99a1fef3b9d445c"}},{"arxiv_id":"2310.14037","paper":"/paper/unlock-multi-modal-capability-of-dense","title":"MARVEL: Unlocking the Multi-Modal Capability of Dense Retrieval via Visual Module Plugin","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/marvel","path":"ANCE/msmarco_eval.py","file_url":"https://github.com/openmatch/marvel/blob/HEAD/ANCE/msmarco_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3bb6407c68aabca4","mcp_get_code":{"code_sha256":"3bb6407c68aabca4"}},{"arxiv_id":"2209.00179","paper":"/paper/universal-multi-modality-retrieval-with-one","title":"Universal Vision-Language Dense Retrieval: Learning A Unified Representation Space for Multi-Modal Retrieval","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/univl-dr","path":"UniVL-DR/msmarco_eval.py","file_url":"https://github.com/openmatch/univl-dr/blob/HEAD/UniVL-DR/msmarco_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3bb6407c68aabca4","mcp_get_code":{"code_sha256":"3bb6407c68aabca4"}},{"arxiv_id":"2110.05789","paper":"/paper/learning-discrete-representations-via-1","title":"Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingtaozhan/DRhard","path":"msmarco_eval.py","file_url":"https://github.com/jingtaozhan/DRhard/blob/HEAD/msmarco_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"42005ba9f770d57d","mcp_get_code":{"code_sha256":"42005ba9f770d57d"}},{"arxiv_id":"1611.09268","paper":"/paper/ms-marco-a-human-generated-machine-reading","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","date":"2016-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/MSMARCO-Passage-Ranking","path":"ms_marco_eval.py","file_url":"https://github.com/microsoft/MSMARCO-Passage-Ranking/blob/HEAD/ms_marco_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b09cad901d138056","mcp_get_code":{"code_sha256":"b09cad901d138056"}},{"arxiv_id":"2022.emnlp-main.727","paper":null,"title":"arXiv:2022.emnlp-main.727","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"gzerveas/CODER","path":"ms_marco_eval.py","file_url":"https://github.com/gzerveas/CODER/blob/HEAD/ms_marco_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"b09cad901d138056","mcp_get_code":{"code_sha256":"b09cad901d138056"}}]}