{"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":"/task/passage-ranking","name":"Passage Ranking","slug":"passage-ranking","description_markdown":null,"categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":73,"papers_with_code":35,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/passage-ranking-on-ms-marco","slug":"passage-ranking-on-ms-marco","dataset":"MS MARCO","dataset_url":"/dataset/ms-marco","rows_in_archive":4,"metrics":["MRR@10"],"first_row_in_archive_order":{"model":"Fine-tuned SOTA","paper_title":"Text and Code Embeddings by Contrastive Pre-Training","paper_url":"/paper/text-and-code-embeddings-by-contrastive-pre","paper_date":"2022-01-24","arxiv_id":"2201.10005","code_links":[{"title":"openmatch/coco-dr","url":"https://github.com/openmatch/coco-dr"}],"syntology":null}}],"datasets":[{"url":"/dataset/ms-marco","name":"MS MARCO","full_name":"Microsoft Machine Reading Comprehension Dataset","num_papers_in_archive":1036}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":73,"of":73,"of_with_code":35,"tagged_in_all":73,"counts":{"archive_papers_tagged":73,"with_a_code_link":35,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":73,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/adaptive-re-ranking-with-a-corpus-graph","slug":"adaptive-re-ranking-with-a-corpus-graph","title":"Adaptive Re-Ranking with a Corpus Graph","date":"2022-08-18","arxiv_id":"2208.08942","repositories_listed":3,"syntology":null},{"url":"/paper/pseudo-relevance-feedback-for-multiple","slug":"pseudo-relevance-feedback-for-multiple","title":"Pseudo-Relevance Feedback for Multiple Representation Dense Retrieval","date":"2021-06-21","arxiv_id":"2106.11251","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pseudo-relevance-feedback-for-multiple#ran","syntology_url":"https://syntology.ai/paper/2106.11251","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11251"}},"official":{"repos":["terrierteam/pyterrier_colbert","cmacdonald/pyterrier_colbert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/repbert-contextualized-text-embeddings-for","slug":"repbert-contextualized-text-embeddings-for","title":"RepBERT: Contextualized Text Embeddings for First-Stage Retrieval","date":"2020-06-28","arxiv_id":"2006.15498","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/repbert-contextualized-text-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/2006.15498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15498"}},"official":{"repos":["jingtaozhan/RepBERT-Index"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-rank-in-generative-retrieval","slug":"learning-to-rank-in-generative-retrieval","title":"Learning to Rank in Generative Retrieval","date":"2023-06-27","arxiv_id":"2306.15222","repositories_listed":2,"syntology":null},{"url":"/paper/shallow-pooling-for-sparse-labels","slug":"shallow-pooling-for-sparse-labels","title":"Shallow pooling for sparse labels","date":"2021-08-31","arxiv_id":"2109.00062","repositories_listed":2,"syntology":null},{"url":"/paper/dealing-with-typos-for-bert-based-passage","slug":"dealing-with-typos-for-bert-based-passage","title":"Dealing with Typos for BERT-based Passage Retrieval and Ranking","date":"2021-08-27","arxiv_id":"2108.12139","repositories_listed":2,"syntology":null},{"url":"/paper/document-ranking-with-a-pretrained-sequence","slug":"document-ranking-with-a-pretrained-sequence","title":"Document Ranking with a Pretrained Sequence-to-Sequence Model","date":"2020-03-14","arxiv_id":"2003.06713","repositories_listed":2,"syntology":null},{"url":"/paper/iranker-towards-ranking-foundation-model","slug":"iranker-towards-ranking-foundation-model","title":"IRanker: Towards Ranking Foundation Model","date":"2025-06-25","arxiv_id":"2506.21638","repositories_listed":1,"syntology":null},{"url":"/paper/sliding-windows-are-not-the-end-exploring","slug":"sliding-windows-are-not-the-end-exploring","title":"Sliding Windows Are Not the End: Exploring Full Ranking with Long-Context Large Language Models","date":"2024-12-19","arxiv_id":"2412.14574","repositories_listed":1,"syntology":null},{"url":"/paper/cure-clinical-understanding-retrieval","slug":"cure-clinical-understanding-retrieval","title":"CURE: A dataset for Clinical Understanding & Retrieval Evaluation","date":"2024-12-09","arxiv_id":"2412.06954","repositories_listed":1,"syntology":null},{"url":"/paper/demorank-selecting-effective-demonstrations","slug":"demorank-selecting-effective-demonstrations","title":"DemoRank: Selecting Effective Demonstrations for Large Language Models in Ranking Task","date":"2024-06-24","arxiv_id":"2406.16332","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":17,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/demorank-selecting-effective-demonstrations#ran","syntology_url":"https://syntology.ai/paper/2406.16332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16332"}},"official":{"repos":["8421bcd/demorank"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-passage-embeddings-for-efficient","slug":"leveraging-passage-embeddings-for-efficient","title":"Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language Models","date":"2024-06-21","arxiv_id":"2406.14848","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/leveraging-passage-embeddings-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2406.14848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14848"}},"official":{"repos":["liuqi6777/pe_rank"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/shallow-cross-encoders-for-low-latency","slug":"shallow-cross-encoders-for-low-latency","title":"Shallow Cross-Encoders for Low-Latency Retrieval","date":"2024-03-29","arxiv_id":"2403.20222","repositories_listed":1,"syntology":null},{"url":"/paper/fusion-in-t5-unifying-document-ranking","slug":"fusion-in-t5-unifying-document-ranking","title":"Fusion-in-T5: Unifying Document Ranking Signals for Improved Information Retrieval","date":"2023-05-24","arxiv_id":"2305.14685","repositories_listed":1,"syntology":null},{"url":"/paper/is-chatgpt-good-at-search-investigating-large","slug":"is-chatgpt-good-at-search-investigating-large","title":"Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents","date":"2023-04-19","arxiv_id":"2304.09542","repositories_listed":1,"syntology":null},{"url":"/paper/t2ranking-a-large-scale-chinese-benchmark-for","slug":"t2ranking-a-large-scale-chinese-benchmark-for","title":"T2Ranking: A large-scale Chinese Benchmark for Passage Ranking","date":"2023-04-07","arxiv_id":"2304.03679","repositories_listed":1,"syntology":null},{"url":"/paper/lead-liberal-feature-based-distillation-for","slug":"lead-liberal-feature-based-distillation-for","title":"LEAD: Liberal Feature-based Distillation for Dense Retrieval","date":"2022-12-10","arxiv_id":"2212.05225","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-impact-of-speech-recognition-errors-in","slug":"on-the-impact-of-speech-recognition-errors-in","title":"On the Impact of Speech Recognition Errors in Passage Retrieval for Spoken Question Answering","date":"2022-09-26","arxiv_id":"2209.12944","repositories_listed":1,"syntology":null},{"url":"/paper/order-disorder-imitation-adversarial-attacks","slug":"order-disorder-imitation-adversarial-attacks","title":"Order-Disorder: Imitation Adversarial Attacks for Black-box Neural Ranking Models","date":"2022-09-14","arxiv_id":"2209.06506","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-pairwise-re-ranking-with-pre-trained","slug":"sparse-pairwise-re-ranking-with-pre-trained","title":"Sparse Pairwise Re-ranking with Pre-trained Transformers","date":"2022-07-10","arxiv_id":"2207.04470","repositories_listed":1,"syntology":null},{"url":"/paper/hlatr-enhance-multi-stage-text-retrieval-with","slug":"hlatr-enhance-multi-stage-text-retrieval-with","title":"HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking","date":"2022-05-21","arxiv_id":"2205.10569","repositories_listed":1,"syntology":null},{"url":"/paper/analysing-the-robustness-of-dual-encoders-for","slug":"analysing-the-robustness-of-dual-encoders-for","title":"Analysing the Robustness of Dual Encoders for Dense Retrieval Against Misspellings","date":"2022-05-04","arxiv_id":"2205.02303","repositories_listed":1,"syntology":null},{"url":"/paper/text-and-code-embeddings-by-contrastive-pre","slug":"text-and-code-embeddings-by-contrastive-pre","title":"Text and Code Embeddings by Contrastive Pre-Training","date":"2022-01-24","arxiv_id":"2201.10005","repositories_listed":1,"syntology":null},{"url":"/paper/mmarco-a-multilingual-version-of-ms-marco","slug":"mmarco-a-multilingual-version-of-ms-marco","title":"mMARCO: A Multilingual Version of the MS MARCO Passage Ranking Dataset","date":"2021-08-31","arxiv_id":"2108.13897","repositories_listed":1,"syntology":null},{"url":"/paper/on-approximate-nearest-neighbour-selection","slug":"on-approximate-nearest-neighbour-selection","title":"On Approximate Nearest Neighbour Selection for Multi-Stage Dense Retrieval","date":"2021-08-25","arxiv_id":"2108.11480","repositories_listed":1,"syntology":null},{"url":"/paper/query-embedding-pruning-for-dense-retrieval","slug":"query-embedding-pruning-for-dense-retrieval","title":"Query Embedding Pruning for Dense Retrieval","date":"2021-08-23","arxiv_id":"2108.10341","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-sentence-level-representations-for","slug":"exploiting-sentence-level-representations-for","title":"Exploiting Sentence-Level Representations for Passage Ranking","date":"2021-06-14","arxiv_id":"2106.07316","repositories_listed":1,"syntology":null},{"url":"/paper/a-wrong-answer-or-a-wrong-question-an","slug":"a-wrong-answer-or-a-wrong-question-an","title":"A Wrong Answer or a Wrong Question? An Intricate Relationship between Question Reformulation and Answer Selection in Conversational Question Answering","date":"2020-10-13","arxiv_id":"2010.06835","repositories_listed":1,"syntology":null},{"url":"/paper/improving-efficient-neural-ranking-models","slug":"improving-efficient-neural-ranking-models","title":"Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation","date":"2020-10-06","arxiv_id":"2010.02666","repositories_listed":1,"syntology":null},{"url":"/paper/expansion-via-prediction-of-importance-with","slug":"expansion-via-prediction-of-importance-with","title":"Expansion via Prediction of Importance with Contextualization","date":"2020-04-29","arxiv_id":"2004.14245","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-question-answering-over","slug":"conversational-question-answering-over","title":"Conversational Question Answering over Passages by Leveraging Word Proximity Networks","date":"2020-04-27","arxiv_id":"2004.13117","repositories_listed":1,"syntology":null},{"url":"/paper/learning-contextualized-document","slug":"learning-contextualized-document","title":"Learning Contextualized Document Representations for Healthcare Answer Retrieval","date":"2020-02-03","arxiv_id":"2002.00835","repositories_listed":1,"syntology":null},{"url":"/paper/tu-wien-trec-deep-learning-19-simple","slug":"tu-wien-trec-deep-learning-19-simple","title":"TU Wien @ TREC Deep Learning '19 -- Simple Contextualization for Re-ranking","date":"2019-12-03","arxiv_id":"1912.01385","repositories_listed":1,"syntology":null},{"url":"/paper/crown-conversational-passage-ranking-by","slug":"crown-conversational-passage-ranking-by","title":"CROWN: Conversational Passage Ranking by Reasoning over Word Networks","date":"2019-11-07","arxiv_id":"1911.02850","repositories_listed":1,"syntology":null},{"url":"/paper/an-updated-duet-model-for-passage-re-ranking","slug":"an-updated-duet-model-for-passage-re-ranking","title":"An Updated Duet Model for Passage Re-ranking","date":"2019-03-18","arxiv_id":"1903.07666","repositories_listed":1,"syntology":null},{"url":null,"slug":"chain-of-thought-poisoning-attacks-against-r1","title":"Chain-of-Thought Poisoning Attacks against R1-based Retrieval-Augmented Generation Systems","date":"2025-05-22","arxiv_id":"2505.16367","repositories_listed":0,"syntology":null},{"url":null,"slug":"passage-query-methods-for-retrieval-and","title":"Passage Query Methods for Retrieval and Reranking in Conversational Agents","date":"2025-02-28","arxiv_id":"2503.00238","repositories_listed":0,"syntology":null},{"url":null,"slug":"irlab-ikat24-learned-sparse-retrieval-with","title":"IRLab@iKAT24: Learned Sparse Retrieval with Multi-aspect LLM Query Generation for Conversational Search","date":"2024-11-22","arxiv_id":"2411.14739","repositories_listed":0,"syntology":null},{"url":null,"slug":"rradistill-distilling-llms-passage-ranking","title":"RRADistill: Distilling LLMs' Passage Ranking Ability for Long-Tail Queries Document Re-Ranking on a Search Engine","date":"2024-10-08","arxiv_id":"2410.18097","repositories_listed":0,"syntology":null},{"url":null,"slug":"mamba-retriever-utilizing-mamba-for-effective","title":"Mamba Retriever: Utilizing Mamba for Effective and Efficient Dense Retrieval","date":"2024-08-15","arxiv_id":"2408.08066","repositories_listed":0,"syntology":null},{"url":null,"slug":"re-ranking-step-by-step-investigating-pre","title":"Re-Ranking Step by Step: Investigating Pre-Filtering for Re-Ranking with Large Language Models","date":"2024-06-26","arxiv_id":"2406.18740","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-cluster-based-sparse-document","title":"Approximate Cluster-Based Sparse Document Retrieval with Segmented Maximum Term Weights","date":"2024-04-13","arxiv_id":"2404.08896","repositories_listed":0,"syntology":null},{"url":null,"slug":"genqrensemble-zero-shot-llm-ensemble","title":"GenQREnsemble: Zero-Shot LLM Ensemble Prompting for Generative Query Reformulation","date":"2024-04-04","arxiv_id":"2404.03746","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-surprising-effectiveness-of-rankers","title":"The Surprising Effectiveness of Rankers Trained on Expanded Queries","date":"2024-04-03","arxiv_id":"2404.02587","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-bias-in-a-ranked-list-using-term","title":"Measuring Bias in a Ranked List using Term-based Representations","date":"2024-03-09","arxiv_id":"2403.05975","repositories_listed":0,"syntology":null},{"url":null,"slug":"searching-dense-representations-with-inverted","title":"Searching Dense Representations with Inverted Indexes","date":"2023-12-04","arxiv_id":"2312.01556","repositories_listed":0,"syntology":null},{"url":null,"slug":"parade-passage-ranking-using-demonstrations","title":"PaRaDe: Passage Ranking using Demonstrations with Large Language Models","date":"2023-10-22","arxiv_id":"2310.14408","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-query-rewriting-for-text","title":"Context Aware Query Rewriting for Text Rankers using LLM","date":"2023-08-31","arxiv_id":"2308.16753","repositories_listed":0,"syntology":null},{"url":null,"slug":"vector-search-with-openai-embeddings-lucene","title":"Vector Search with OpenAI Embeddings: Lucene Is All You Need","date":"2023-08-29","arxiv_id":"2308.14963","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-retrieval-and-multi-stage-text-ranking","title":"Hybrid Retrieval and Multi-stage Text Ranking Solution at TREC 2022 Deep Learning Track","date":"2023-08-23","arxiv_id":"2308.12039","repositories_listed":0,"syntology":null},{"url":null,"slug":"griprank-bridging-the-gap-between-retrieval","title":"GripRank: Bridging the Gap between Retrieval and Generation via the Generative Knowledge Improved Passage Ranking","date":"2023-05-29","arxiv_id":"2305.18144","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-does-generative-retrieval-scale-to","title":"How Does Generative Retrieval Scale to Millions of Passages?","date":"2023-05-19","arxiv_id":"2305.11841","repositories_listed":0,"syntology":null},{"url":null,"slug":"pregan-answer-oriented-passage-ranking-with","title":"PReGAN: Answer Oriented Passage Ranking with Weakly Supervised GAN","date":"2022-07-05","arxiv_id":"2207.01762","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-self-supervised-joint-training-framework","title":"A Self-supervised Joint Training Framework for Document Reranking","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-lingual-training-of-dense-retrievers","title":"Cross-Lingual Training of Dense Retrievers for Document Retrieval","date":"2021-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-approach-to-jointly-rank-passages","title":"A Simple Approach to Jointly Rank Passages and Select Relevant Sentences in the OBQA Context","date":"2021-09-22","arxiv_id":"2109.10497","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-lingual-training-with-dense-retrieval","title":"Cross-Lingual Training with Dense Retrieval for Document Retrieval","date":"2021-09-03","arxiv_id":"2109.01628","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-few-brief-notes-on-deepimpact-coil-and-a","title":"A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniques","date":"2021-06-28","arxiv_id":"2106.14807","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-fine-tuning-improves-robustness","title":"Contrastive Fine-tuning Improves Robustness for Neural Rankers","date":"2021-05-27","arxiv_id":"2105.12932","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-to-text-multi-view-learning-for-passage","title":"Text-to-Text Multi-view Learning for Passage Re-ranking","date":"2021-04-29","arxiv_id":"2104.14133","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-passage-ranking-for-diverse-multi","title":"Joint Passage Ranking for Diverse Multi-Answer Retrieval","date":"2021-04-17","arxiv_id":"2104.08445","repositories_listed":0,"syntology":null},{"url":null,"slug":"content-based-models-of-quotation","title":"Content-based Models of Quotation","date":"2021-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"conversational-answer-generation-and","title":"Conversational Answer Generation and Factuality for Reading Comprehension Question-Answering","date":"2021-03-11","arxiv_id":"2103.06500","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-passage-re-ranking-with-word-n-gram","title":"Improving Passage Re-Ranking with Word N-Gram Aware Coattention Encoder","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"making-information-seeking-easier-an-improved","title":"Making Information Seeking Easier: An Improved Pipeline for Conversational Search","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"aws-cord19-search-a-scientific-literature","title":"AWS CORD-19 Search: A Neural Search Engine for COVID-19 Literature","date":"2020-07-17","arxiv_id":"2007.09186","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-implicit-relevance-feedback-from-user","title":"Mining Implicit Relevance Feedback from User Behavior for Web Question Answering","date":"2020-06-13","arxiv_id":"2006.07581","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-query-term-independence","title":"Incorporating Query Term Independence Assumption for Efficient Retrieval and Ranking using Deep Neural Networks","date":"2019-07-08","arxiv_id":"1907.03693","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-passage-based-approach-to-learning-to-rank","title":"A Passage-Based Approach to Learning to Rank Documents","date":"2019-06-05","arxiv_id":"1906.02083","repositories_listed":0,"syntology":null},{"url":null,"slug":"passage-ranking-with-weak-supervsion","title":"Passage Ranking with Weak Supervision","date":"2019-05-15","arxiv_id":"1905.05910","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-behaviors-of-bert-in","title":"Understanding the Behaviors of BERT in Ranking","date":"2019-04-16","arxiv_id":"1904.07531","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-comprehensive-ranker-ncr-for-open","title":"A Neural Comprehensive Ranker (NCR) for Open-Domain Question Answering","date":"2017-09-29","arxiv_id":"1709.10204","repositories_listed":0,"syntology":null},{"url":null,"slug":"s-net-from-answer-extraction-to-answer","title":"S-Net: From Answer Extraction to Answer Generation for Machine Reading Comprehension","date":"2017-06-15","arxiv_id":"1706.04815","repositories_listed":0,"syntology":null}],"syntology_records":4,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_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_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)"},"since_archive_judged":{"papers":6,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/passage-ranking-on-ms-marco","since_archive":"/sota/passage-ranking-on-ms-marco#since-judged","papers_judged":6,"placed":0}]},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/task/passage-ranking/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/passage-ranking/papers/ran/1","json":"/task/passage-ranking/papers/ran/1.json","rows":4}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"e42b8469209be7d0d59ac86fe60f9430a3e9ae4981e2d24cffc9f57a22cf82a3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}