{"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/load-reference","entry":"load_reference","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":9,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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.27895","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27895","title":"Mosaic: A Benchmark Suite for Differentiable Physics Solvers","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pasteurlabs/mosaic","path":"mosaic/benchmarks/core/reference.py","file_url":"https://github.com/pasteurlabs/mosaic/blob/HEAD/mosaic/benchmarks/core/reference.py","status":"unverified","verification_level":0,"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":"f5f3ef2a4014ece6","code_sha256_prefix":"f5f3ef2a4014ece6","mcp_get_code":{"code_sha256":"f5f3ef2a4014ece6"}},{"arxiv_id":"2407.17023","arxiv_id_is_arxiv":true,"paper":"/paper/from-internal-conflict-to-contextual","title":"DYNAMICQA: Tracing Internal Knowledge Conflicts in Language Models","date":"2024-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"copenlu/dynamicqa","path":"final_code/get_stubborn_persuaded_instances.py","file_url":"https://github.com/copenlu/dynamicqa/blob/HEAD/final_code/get_stubborn_persuaded_instances.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, copenlu/dynamicqa when it was checked","code_sha256":"210a13606bd58095","code_sha256_prefix":"210a13606bd58095","mcp_get_code":{"code_sha256":"210a13606bd58095"}},{"arxiv_id":"2404.18812","arxiv_id_is_arxiv":true,"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":"unverified","verification_level":0,"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":"52e247dd5467b4bb","code_sha256_prefix":"52e247dd5467b4bb","mcp_get_code":{"code_sha256":"52e247dd5467b4bb"}},{"arxiv_id":"2401.10487","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ypw0102/gdr when it was checked","code_sha256":"b75e94e5d0c04ad5","code_sha256_prefix":"b75e94e5d0c04ad5","mcp_get_code":{"code_sha256":"b75e94e5d0c04ad5"}},{"arxiv_id":"2310.14037","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"73a28fd25464e18b","code_sha256_prefix":"73a28fd25464e18b","mcp_get_code":{"code_sha256":"73a28fd25464e18b"}},{"arxiv_id":"2209.00179","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"73a28fd25464e18b","code_sha256_prefix":"73a28fd25464e18b","mcp_get_code":{"code_sha256":"73a28fd25464e18b"}},{"arxiv_id":"2110.05789","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4020d64dcc4b6c53","code_sha256_prefix":"4020d64dcc4b6c53","mcp_get_code":{"code_sha256":"4020d64dcc4b6c53"}},{"arxiv_id":"1611.09268","arxiv_id_is_arxiv":true,"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":"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":"52e247dd5467b4bb","code_sha256_prefix":"52e247dd5467b4bb","mcp_get_code":{"code_sha256":"52e247dd5467b4bb"}},{"arxiv_id":"2022.emnlp-main.727","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52e247dd5467b4bb","code_sha256_prefix":"52e247dd5467b4bb","mcp_get_code":{"code_sha256":"52e247dd5467b4bb"}}],"record_sha256":"69e94479ae5859686c97945fc63a8264a53e65d3f09b69870de6a67464c883fa","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}