{"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-re-ranking","name":"Passage Re-Ranking","slug":"passage-re-ranking","description_markdown":"Passage re-ranking is the task of scoring and re-ranking a collection of retrieved documents based on an input query.","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":32,"papers_with_code":19,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"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":2,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/passage-re-ranking-on-ms-marco","slug":"passage-re-ranking-on-ms-marco","dataset":"MS MARCO","dataset_url":"/dataset/ms-marco","rows_in_archive":4,"metrics":["MRR"],"first_row_in_archive_order":{"model":"HLATR","paper_title":"HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking","paper_url":"/paper/hlatr-enhance-multi-stage-text-retrieval-with","paper_date":"2022-05-21","arxiv_id":"2205.10569","code_links":[{"title":"Alibaba-NLP/HLATR","url":"https://github.com/Alibaba-NLP/HLATR"}],"syntology":null}},{"leaderboard":"/sota/passage-re-ranking-on-trec-pm","slug":"passage-re-ranking-on-trec-pm","dataset":"TREC-PM","dataset_url":null,"rows_in_archive":1,"metrics":["mAP"],"first_row_in_archive_order":{"model":"BERT + Doc2query","paper_title":"Document Expansion by Query Prediction","paper_url":"/paper/document-expansion-by-query-prediction","paper_date":"2019-04-17","arxiv_id":"1904.08375","code_links":[{"title":"castorini/Anserini","url":"https://github.com/castorini/Anserini"},{"title":"castorini/docTTTTTquery","url":"https://github.com/castorini/docTTTTTquery"},{"title":"nyu-dl/dl4ir-doc2query","url":"https://github.com/nyu-dl/dl4ir-doc2query"},{"title":"irgroup/clef2023-longeval-irc","url":"https://github.com/irgroup/clef2023-longeval-irc"},{"title":"kasys-lab/anserini-kasys","url":"https://github.com/kasys-lab/anserini-kasys"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/document-expansion-by-query-prediction#ran","syntology_url":"https://syntology.ai/paper/1904.08375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08375"}},"official":{"repos":["nyu-dl/dl4ir-doc2query"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/ms-marco","name":"MS MARCO","full_name":"Microsoft Machine Reading Comprehension Dataset","num_papers_in_archive":1036},{"url":"/dataset/mmarco","name":"mMARCO","full_name":"","num_papers_in_archive":23}],"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":32,"of":32,"of_with_code":19,"tagged_in_all":32,"counts":{"archive_papers_tagged":32,"with_a_code_link":19,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":32,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/passage-re-ranking-with-bert","slug":"passage-re-ranking-with-bert","title":"Passage Re-ranking with BERT","date":"2019-01-13","arxiv_id":"1901.04085","repositories_listed":6,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"11 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/passage-re-ranking-with-bert#ran","syntology_url":"https://syntology.ai/paper/1901.04085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.04085"}},"official":{"repos":["nyu-dl/dl4marco-bert"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/document-expansion-by-query-prediction","slug":"document-expansion-by-query-prediction","title":"Document Expansion by Query Prediction","date":"2019-04-17","arxiv_id":"1904.08375","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/document-expansion-by-query-prediction#ran","syntology_url":"https://syntology.ai/paper/1904.08375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08375"}},"official":{"repos":["nyu-dl/dl4ir-doc2query"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-systematic-investigation-of-distilling","slug":"a-systematic-investigation-of-distilling","title":"Rank-DistiLLM: Closing the Effectiveness Gap Between Cross-Encoders and LLMs for Passage Re-Ranking","date":"2024-05-13","arxiv_id":"2405.07920","repositories_listed":2,"syntology":null},{"url":"/paper/set-encoder-permutation-invariant-inter","slug":"set-encoder-permutation-invariant-inter","title":"Set-Encoder: Permutation-Invariant Inter-Passage Attention for Listwise Passage Re-Ranking with Cross-Encoders","date":"2024-04-10","arxiv_id":"2404.06912","repositories_listed":2,"syntology":null},{"url":"/paper/lepus-prompt-based-unsupervised-multi-hop","slug":"lepus-prompt-based-unsupervised-multi-hop","title":"Few-shot Reranking for Multi-hop QA via Language Model Prompting","date":"2022-05-25","arxiv_id":"2205.12650","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/exploring-the-effectiveness-of-multi-stage","slug":"exploring-the-effectiveness-of-multi-stage","title":"Exploring the Effectiveness of Multi-stage Fine-tuning for Cross-encoder Re-rankers","date":"2025-03-28","arxiv_id":"2503.22672","repositories_listed":1,"syntology":null},{"url":"/paper/multi-granularity-guided-fusion-in-decoder","slug":"multi-granularity-guided-fusion-in-decoder","title":"Multi-Granularity Guided Fusion-in-Decoder","date":"2024-04-03","arxiv_id":"2404.02581","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-language-models-to-compress-contexts","slug":"adapting-language-models-to-compress-contexts","title":"Adapting Language Models to Compress Contexts","date":"2023-05-24","arxiv_id":"2305.14788","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/adapting-language-models-to-compress-contexts#ran","syntology_url":"https://syntology.ai/paper/2305.14788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14788"}},"official":{"repos":["princeton-nlp/autocompressors"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-conversational-passage-re-ranking","slug":"improving-conversational-passage-re-ranking","title":"Improving Conversational Passage Re-ranking with View Ensemble","date":"2023-04-26","arxiv_id":"2304.13290","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/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/rocketqav2-a-joint-training-method-for-dense","slug":"rocketqav2-a-joint-training-method-for-dense","title":"RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking","date":"2021-10-14","arxiv_id":"2110.07367","repositories_listed":1,"syntology":null},{"url":"/paper/fast-passage-re-ranking-with-contextualized","slug":"fast-passage-re-ranking-with-contextualized","title":"Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage Expansion","date":"2021-08-19","arxiv_id":"2108.08513","repositories_listed":1,"syntology":null},{"url":"/paper/a-modern-perspective-on-query-likelihood-with","slug":"a-modern-perspective-on-query-likelihood-with","title":"A Modern Perspective on Query Likelihood with Deep Generative Retrieval Models","date":"2021-06-25","arxiv_id":"2106.13618","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/societal-biases-in-retrieved-contents","slug":"societal-biases-in-retrieved-contents","title":"Societal Biases in Retrieved Contents: Measurement Framework and Adversarial Mitigation for BERT Rankers","date":"2021-04-28","arxiv_id":"2104.13640","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-the-position-bias-of-transformer","slug":"mitigating-the-position-bias-of-transformer","title":"Mitigating the Position Bias of Transformer Models in Passage Re-Ranking","date":"2021-01-18","arxiv_id":"2101.06980","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":"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":"efficient-document-ranking-with-learnable","title":"Efficient Document Ranking with Learnable Late Interactions","date":"2024-06-25","arxiv_id":"2406.17968","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":"incorporating-explicit-knowledge-in-pre","title":"Incorporating Explicit Knowledge in Pre-trained Language Models for Passage Re-ranking","date":"2022-04-25","arxiv_id":"2204.11673","repositories_listed":0,"syntology":null},{"url":null,"slug":"quality-and-cost-trade-offs-in-passage-re","title":"Quality and Cost Trade-offs in Passage Re-ranking Task","date":"2021-11-18","arxiv_id":"2111.09927","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-robust-passage-re-ranking-model-by","title":"Towards Robust Passage Re-Ranking Model by Mitigating Lexical Match Bias","date":"2021-11-16","arxiv_id":null,"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":"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":"multi-perspective-semantic-information","title":"Multi-Perspective Semantic Information Retrieval in the Biomedical Domain","date":"2020-07-17","arxiv_id":"2008.01526","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-with-bert-in-tf-ranking","title":"Learning-to-Rank with BERT in TF-Ranking","date":"2020-04-17","arxiv_id":"2004.08476","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-bert-for-non-factoid-question","title":"A Study of BERT for Non-Factoid Question-Answering under Passage Length Constraints","date":"2019-08-19","arxiv_id":"1908.06780","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-the-successes-and-failures-of","title":"Investigating the Successes and Failures of BERT for Passage Re-Ranking","date":"2019-05-05","arxiv_id":"1905.01758","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-on-passage-re-ranking-in-embedding","title":"A Study on Passage Re-ranking in Embedding based Unsupervised Semantic Search","date":"2018-04-22","arxiv_id":"1804.08057","repositories_listed":0,"syntology":null}],"syntology_records":3,"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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/task/passage-re-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-re-ranking/papers/ran/1","json":"/task/passage-re-ranking/papers/ran/1.json","rows":3}],"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":"ffd91b3074c8a2eabf6800680c28713263d1d6beebc4e2c1aef6e4a9d680f489","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}