{"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/cosine-scores","entry":"cosine_scores","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":9,"n_papers_ran":9,"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_fingerprinted":2,"n_places":9,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"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":"2605.28062","paper":"/paper/arxiv-2605-28062","title":"ConvMemory: A Lightweight Learned Memory Reranker, a Negative Attribution Result, and a Research-Preview Conflict Editor","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pth2002/ConvMemory","path":"convmemory/reranker.py","file_url":"https://github.com/pth2002/ConvMemory/blob/HEAD/convmemory/reranker.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3958eba049be360c","mcp_get_code":{"code_sha256":"3958eba049be360c"}},{"arxiv_id":"2601.09141","paper":"/paper/arxiv-2601-09141","title":"Identity-Robust Language Model Generation via Content Integrity Preservation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"XMUDM/Guide-Align","path":"code/DPR/dpr/models/biencoder.py","file_url":"https://github.com/XMUDM/Guide-Align/blob/HEAD/code/DPR/dpr/models/biencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}},{"arxiv_id":"2410.06581","paper":"/paper/enhancing-legal-case-retrieval-via-scaling","title":"Enhancing Legal Case Retrieval via Scaling High-quality Synthetic Query-Candidate Pairs","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/LEAD","path":"dpr/models/biencoder.py","file_url":"https://github.com/thunlp/LEAD/blob/HEAD/dpr/models/biencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}},{"arxiv_id":"2403.03516","paper":"/paper/unsupervised-multilingual-dense-retrieval-via","title":"Unsupervised Multilingual Dense Retrieval via Generative Pseudo Labeling","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MiuLab/UMR","path":"dpr/models/biencoder.py","file_url":"https://github.com/MiuLab/UMR/blob/HEAD/dpr/models/biencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}},{"arxiv_id":"2402.13532","paper":"/paper/backdoor-attacks-on-dense-passage-retrievers","title":"Whispers in Grammars: Injecting Covert Backdoors to Compromise Dense Retrieval Systems","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruyue0001/backdoor_dpr","path":"DPR/dpr/models/biencoder.py","file_url":"https://github.com/ruyue0001/backdoor_dpr/blob/HEAD/DPR/dpr/models/biencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}},{"arxiv_id":"2205.09843","paper":"/paper/table-retrieval-may-not-necessitate-table","title":"Table Retrieval May Not Necessitate Table-specific Model Design","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zorazrw/nqt-retrieval","path":"dpr/models/biencoder.py","file_url":"https://github.com/zorazrw/nqt-retrieval/blob/HEAD/dpr/models/biencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}},{"arxiv_id":"2106.05346","paper":"/paper/end-to-end-training-of-multi-document-reader","title":"End-to-End Training of Multi-Document Reader and Retriever for Open-Domain Question Answering","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/dpr","path":"dpr/models/biencoder.py","file_url":"https://github.com/facebookresearch/dpr/blob/HEAD/dpr/models/biencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}},{"arxiv_id":"1911.03868","paper":"/paper/knowledge-guided-text-retrieval-and-reading","title":"Knowledge Guided Text Retrieval and Reading for Open Domain Question Answering","date":"2019-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}},{"arxiv_id":"2024.findings-acl.708","paper":null,"title":"arXiv:2024.findings-acl.708","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"process-cxr/AGR","path":"dpr/models/biencoder.py","file_url":"https://github.com/process-cxr/AGR/blob/HEAD/dpr/models/biencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4c7d079ed8d8dd58","mcp_get_code":{"code_sha256":"4c7d079ed8d8dd58"}}]}