{"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/reranking","name":"Reranking","slug":"reranking","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":586,"papers_with_code":216,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":[],"datasets":[{"url":"/dataset/claim-matching-robustness","name":"Claim Matching Robustness","full_name":"","num_papers_in_archive":1}],"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":6,"rows_per_page":100,"shown":100,"of":586,"of_with_code":216,"tagged_in_all":586,"counts":{"archive_papers_tagged":586,"with_a_code_link":216,"where_syntology_ran_a_sample":59,"not_listed_spam_title":0,"listed":586,"listed_where_code_ran":59,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":41,"every_run_a_failure_of_syntologys_instrument":18,"listed_with_a_run_with_no_instrument_failure":41,"listed_every_run_a_failure_of_syntologys_instrument":18,"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/mteb-massive-text-embedding-benchmark","slug":"mteb-massive-text-embedding-benchmark","title":"MTEB: Massive Text Embedding Benchmark","date":"2022-10-13","arxiv_id":"2210.07316","repositories_listed":5,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mteb-massive-text-embedding-benchmark#ran","syntology_url":"https://syntology.ai/paper/2210.07316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07316"}},"official":{"repos":["embeddings-benchmark/mteb"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/approximate-nearest-neighbor-negative","slug":"approximate-nearest-neighbor-negative","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","date":"2020-07-01","arxiv_id":"2007.00808","repositories_listed":5,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/approximate-nearest-neighbor-negative#ran","syntology_url":"https://syntology.ai/paper/2007.00808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00808"}},"official":{"repos":["microsoft/ANCE"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/facebook-fairs-wmt19-news-translation-task","slug":"facebook-fairs-wmt19-news-translation-task","title":"Facebook FAIR's WMT19 News Translation Task Submission","date":"2019-07-15","arxiv_id":"1907.06616","repositories_listed":5,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/facebook-fairs-wmt19-news-translation-task#ran","syntology_url":"https://syntology.ai/paper/1907.06616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.06616"}},"official":null}},{"url":"/paper/the-expando-mono-duo-design-pattern-for-text","slug":"the-expando-mono-duo-design-pattern-for-text","title":"The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Models","date":"2021-01-14","arxiv_id":"2101.05667","repositories_listed":4,"syntology":null},{"url":"/paper/math-shepherd-a-label-free-step-by-step","slug":"math-shepherd-a-label-free-step-by-step","title":"Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations","date":"2023-12-14","arxiv_id":"2312.08935","repositories_listed":3,"syntology":null},{"url":"/paper/rankvicuna-zero-shot-listwise-document","slug":"rankvicuna-zero-shot-listwise-document","title":"RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models","date":"2023-09-26","arxiv_id":"2309.15088","repositories_listed":3,"syntology":null},{"url":"/paper/cliff-contrastive-learning-for-improving","slug":"cliff-contrastive-learning-for-improving","title":"CLIFF: Contrastive Learning for Improving Faithfulness and Factuality in Abstractive Summarization","date":"2021-09-19","arxiv_id":"2109.09209","repositories_listed":3,"syntology":null},{"url":"/paper/a-temporal-variational-model-for-story","slug":"a-temporal-variational-model-for-story","title":"A Temporal Variational Model for Story Generation","date":"2021-09-14","arxiv_id":"2109.06807","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/faster-r-cnn-features-for-instance-search","slug":"faster-r-cnn-features-for-instance-search","title":"Faster R-CNN Features for Instance Search","date":"2016-04-29","arxiv_id":"1604.08893","repositories_listed":3,"syntology":null},{"url":"/paper/relevance-isn-t-all-you-need-scaling-rag","slug":"relevance-isn-t-all-you-need-scaling-rag","title":"Relevance Isn't All You Need: Scaling RAG Systems With Inference-Time Compute Via Multi-Criteria Reranking","date":"2025-03-14","arxiv_id":"2504.07104","repositories_listed":2,"syntology":null},{"url":"/paper/rank-r1-enhancing-reasoning-in-llm-based","slug":"rank-r1-enhancing-reasoning-in-llm-based","title":"Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning","date":"2025-03-08","arxiv_id":"2503.06034","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/rank-r1-enhancing-reasoning-in-llm-based#ran","syntology_url":"https://syntology.ai/paper/2503.06034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.06034"}},"official":{"repos":["ielab/llm-rankers"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/benchmarking-retrieval-augmented-generation-1","slug":"benchmarking-retrieval-augmented-generation-1","title":"Benchmarking Retrieval-Augmented Generation in Multi-Modal Contexts","date":"2025-02-24","arxiv_id":"2502.17297","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-high-order-interaction-awareness-in","slug":"enhancing-high-order-interaction-awareness-in","title":"Enhancing High-order Interaction Awareness in LLM-based Recommender Model","date":"2024-09-30","arxiv_id":"2409.19979","repositories_listed":2,"syntology":null},{"url":"/paper/2407-21439","slug":"2407-21439","title":"MLLM Is a Strong Reranker: Advancing Multimodal Retrieval-augmented Generation via Knowledge-enhanced Reranking and Noise-injected Training","date":"2024-07-31","arxiv_id":"2407.21439","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/2407-21439#ran","syntology_url":"https://syntology.ai/paper/2407.21439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.21439"}},"official":{"repos":["idea-finai/ragllava","idea-finai/ragvl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-retrieval-building-an-information","slug":"self-retrieval-building-an-information","title":"Self-Retrieval: End-to-End Information Retrieval with One Large Language Model","date":"2024-02-23","arxiv_id":"2403.00801","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-retrieval-building-an-information#ran","syntology_url":"https://syntology.ai/paper/2403.00801","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00801"}},"official":{"repos":["icip-cas/selfretrieval","tangqiaoyu/selfretrieval"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-trustworthy-reranking-a-simple-yet","slug":"towards-trustworthy-reranking-a-simple-yet","title":"Towards Trustworthy Reranking: A Simple yet Effective Abstention Mechanism","date":"2024-02-20","arxiv_id":"2402.12997","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/towards-trustworthy-reranking-a-simple-yet#ran","syntology_url":"https://syntology.ai/paper/2402.12997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12997"}},"official":{"repos":["artefactory/abstention-reranker","hgissbkh/abstention-reranker"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-down-litting-up-efficient-zero-shot","slug":"scaling-down-litting-up-efficient-zero-shot","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","date":"2023-12-26","arxiv_id":"2312.16098","repositories_listed":2,"syntology":null},{"url":"/paper/rankzephyr-effective-and-robust-zero-shot","slug":"rankzephyr-effective-and-robust-zero-shot","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","date":"2023-12-05","arxiv_id":"2312.02724","repositories_listed":2,"syntology":null},{"url":"/paper/neural-rankers-for-code-generation-via-inter","slug":"neural-rankers-for-code-generation-via-inter","title":"Functional Overlap Reranking for Neural Code Generation","date":"2023-10-16","arxiv_id":"2311.03366","repositories_listed":2,"syntology":null},{"url":"/paper/global-features-are-all-you-need-for-image","slug":"global-features-are-all-you-need-for-image","title":"Global Features are All You Need for Image Retrieval and Reranking","date":"2023-08-14","arxiv_id":"2308.06954","repositories_listed":2,"syntology":{"n":18,"n_ran":14,"n_constructed":9,"n_ran_checked":12,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"14 ran (of which 9 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/global-features-are-all-you-need-for-image#ran","syntology_url":"https://syntology.ai/paper/2308.06954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06954"}},"official":{"repos":["shihaoshao-gh/superglobal"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":9,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/expand-rerank-and-retrieve-query-reranking","slug":"expand-rerank-and-retrieve-query-reranking","title":"Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answering","date":"2023-05-26","arxiv_id":"2305.17080","repositories_listed":2,"syntology":null},{"url":"/paper/candidate-set-re-ranking-for-composed-image","slug":"candidate-set-re-ranking-for-composed-image","title":"Candidate Set Re-ranking for Composed Image Retrieval with Dual Multi-modal Encoder","date":"2023-05-25","arxiv_id":"2305.16304","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/candidate-set-re-ranking-for-composed-image#ran","syntology_url":"https://syntology.ai/paper/2305.16304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16304"}},"official":{"repos":["Cuberick-Orion/Candidate-Reranking-CIR"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-learning-of-sentence-embeddings","slug":"contrastive-learning-of-sentence-embeddings","title":"Contrastive Learning of Sentence Embeddings from Scratch","date":"2023-05-24","arxiv_id":"2305.15077","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/contrastive-learning-of-sentence-embeddings#ran","syntology_url":"https://syntology.ai/paper/2305.15077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15077"}},"official":{"repos":["hkust-nlp/syncse","sjtu-lit/syncse"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/explaining-patterns-in-data-with-language","slug":"explaining-patterns-in-data-with-language","title":"Explaining Patterns in Data with Language Models via Interpretable Autoprompting","date":"2022-10-04","arxiv_id":"2210.01848","repositories_listed":2,"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":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) · 0 unverified","sample_list":"/paper/explaining-patterns-in-data-with-language#ran","syntology_url":"https://syntology.ai/paper/2210.01848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01848"}},"official":{"repos":["csinva/imodelsX"],"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/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/glide-towards-photorealistic-image-generation","slug":"glide-towards-photorealistic-image-generation","title":"GLIDE: Towards Photorealistic Image Generation and Editing with Text-Guided Diffusion Models","date":"2021-12-20","arxiv_id":"2112.10741","repositories_listed":2,"syntology":{"n":15,"n_ran":9,"n_constructed":7,"n_ran_checked":8,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/glide-towards-photorealistic-image-generation#ran","syntology_url":"https://syntology.ai/paper/2112.10741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10741"}},"official":{"repos":["openai/glide-text2im"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":7,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-hybrid-relation-network-for-cross","slug":"dynamic-hybrid-relation-network-for-cross","title":"Dynamic Hybrid Relation Network for Cross-Domain Context-Dependent Semantic Parsing","date":"2021-01-05","arxiv_id":"2101.01686","repositories_listed":2,"syntology":null},{"url":"/paper/deep-multi-query-image-retrieval","slug":"deep-multi-query-image-retrieval","title":"Deep Multi Query Image Retrieval","date":"2020-08-12","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/cost-effective-interactive-attention-learning","slug":"cost-effective-interactive-attention-learning","title":"Cost-effective Interactive Attention Learning with Neural Attention Processes","date":"2020-06-09","arxiv_id":"2006.05419","repositories_listed":2,"syntology":null},{"url":"/paper/2nd-place-and-2nd-place-solution-to-kaggle","slug":"2nd-place-and-2nd-place-solution-to-kaggle","title":"2nd Place and 2nd Place Solution to Kaggle Landmark Recognition andRetrieval Competition 2019","date":"2019-06-10","arxiv_id":"1906.03990","repositories_listed":2,"syntology":null},{"url":"/paper/complexity-weighted-loss-and-diverse","slug":"complexity-weighted-loss-and-diverse","title":"Complexity-Weighted Loss and Diverse Reranking for Sentence Simplification","date":"2019-04-04","arxiv_id":"1904.02767","repositories_listed":2,"syntology":null},{"url":"/paper/in-order-transition-based-constituent-parsing","slug":"in-order-transition-based-constituent-parsing","title":"In-Order Transition-based Constituent Parsing","date":"2017-07-17","arxiv_id":"1707.05000","repositories_listed":2,"syntology":null},{"url":"/paper/two-are-better-than-one-an-ensemble-of","slug":"two-are-better-than-one-an-ensemble-of","title":"Two are Better than One: An Ensemble of Retrieval- and Generation-Based Dialog Systems","date":"2016-10-23","arxiv_id":"1610.07149","repositories_listed":2,"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/two-are-better-than-one-an-ensemble-of#ran","syntology_url":"https://syntology.ai/paper/1610.07149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.07149"}},"official":null}},{"url":"/paper/bags-of-local-convolutional-features-for","slug":"bags-of-local-convolutional-features-for","title":"Bags of Local Convolutional Features for Scalable Instance Search","date":"2016-04-15","arxiv_id":"1604.04653","repositories_listed":2,"syntology":null},{"url":"/paper/keyphrase-extraction-for-n-best-reranking-in","slug":"keyphrase-extraction-for-n-best-reranking-in","title":"Keyphrase Extraction for N-best Reranking in Multi-Sentence Compression","date":"2013-06-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/efficiency-effectiveness-reranking-flops-for","slug":"efficiency-effectiveness-reranking-flops-for","title":"Efficiency-Effectiveness Reranking FLOPs for LLM-based Rerankers","date":"2025-07-08","arxiv_id":"2507.06223","repositories_listed":1,"syntology":null},{"url":"/paper/jointrank-rank-large-set-with-single-pass","slug":"jointrank-rank-large-set-with-single-pass","title":"JointRank: Rank Large Set with Single Pass","date":"2025-06-27","arxiv_id":"2506.22262","repositories_listed":1,"syntology":null},{"url":"/paper/constructing-and-evaluating-declarative-rag","slug":"constructing-and-evaluating-declarative-rag","title":"Constructing and Evaluating Declarative RAG Pipelines in PyTerrier","date":"2025-06-12","arxiv_id":"2506.10802","repositories_listed":1,"syntology":null},{"url":"/paper/qwen3-embedding-advancing-text-embedding-and","slug":"qwen3-embedding-advancing-text-embedding-and","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","date":"2025-06-05","arxiv_id":"2506.05176","repositories_listed":1,"syntology":null},{"url":"/paper/rearank-reasoning-re-ranking-agent-via","slug":"rearank-reasoning-re-ranking-agent-via","title":"REARANK: Reasoning Re-ranking Agent via Reinforcement Learning","date":"2025-05-26","arxiv_id":"2505.20046","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/rearank-reasoning-re-ranking-agent-via#ran","syntology_url":"https://syntology.ai/paper/2505.20046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.20046"}},"official":{"repos":["lezhang7/rearank"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/rankllm-a-python-package-for-reranking-with","slug":"rankllm-a-python-package-for-reranking-with","title":"RankLLM: A Python Package for Reranking with LLMs","date":"2025-05-25","arxiv_id":"2505.19284","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rankllm-a-python-package-for-reranking-with#ran","syntology_url":"https://syntology.ai/paper/2505.19284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19284"}},"official":null}},{"url":"/paper/acurank-uncertainty-aware-adaptive","slug":"acurank-uncertainty-aware-adaptive","title":"AcuRank: Uncertainty-Aware Adaptive Computation for Listwise Reranking","date":"2025-05-24","arxiv_id":"2505.18512","repositories_listed":1,"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":3,"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/acurank-uncertainty-aware-adaptive#ran","syntology_url":"https://syntology.ai/paper/2505.18512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.18512"}},"official":{"repos":["soyoung97/acurank"],"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/universal-biological-sequence-reranking-for","slug":"universal-biological-sequence-reranking-for","title":"Universal Biological Sequence Reranking for Improved De Novo Peptide Sequencing","date":"2025-05-23","arxiv_id":"2505.17552","repositories_listed":1,"syntology":null},{"url":"/paper/rank-k-test-time-reasoning-for-listwise","slug":"rank-k-test-time-reasoning-for-listwise","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","date":"2025-05-20","arxiv_id":"2505.14432","repositories_listed":1,"syntology":null},{"url":"/paper/geovlm-improving-automated-vehicle","slug":"geovlm-improving-automated-vehicle","title":"GeoVLM: Improving Automated Vehicle Geolocalisation Using Vision-Language Matching","date":"2025-05-19","arxiv_id":"2505.13669","repositories_listed":1,"syntology":null},{"url":"/paper/variational-prefix-tuning-for-diverse-and","slug":"variational-prefix-tuning-for-diverse-and","title":"Variational Prefix Tuning for Diverse and Accurate Code Summarization Using Pre-trained Language Models","date":"2025-05-14","arxiv_id":"2505.09062","repositories_listed":1,"syntology":null},{"url":"/paper/dynamicrag-leveraging-outputs-of-large","slug":"dynamicrag-leveraging-outputs-of-large","title":"DynamicRAG: Leveraging Outputs of Large Language Model as Feedback for Dynamic Reranking in Retrieval-Augmented Generation","date":"2025-05-12","arxiv_id":"2505.07233","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-reproducible-biomedical","slug":"efficient-and-reproducible-biomedical","title":"Efficient and Reproducible Biomedical Question Answering using Retrieval Augmented Generation","date":"2025-05-12","arxiv_id":"2505.07917","repositories_listed":1,"syntology":null},{"url":"/paper/grada-graph-based-reranker-against","slug":"grada-graph-based-reranker-against","title":"GRADA: Graph-based Reranker against Adversarial Documents Attack","date":"2025-05-12","arxiv_id":"2505.07546","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-based-llms-for-position-bias-aware","slug":"prompt-based-llms-for-position-bias-aware","title":"Prompt-Based LLMs for Position Bias-Aware Reranking in Personalized Recommendations","date":"2025-05-08","arxiv_id":"2505.04948","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-role-of-diversity-in-example","slug":"exploring-the-role-of-diversity-in-example","title":"Exploring the Role of Diversity in Example Selection for In-Context Learning","date":"2025-05-03","arxiv_id":"2505.01842","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-judges-as-evaluators-the-jetts","slug":"evaluating-judges-as-evaluators-the-jetts","title":"Evaluating Judges as Evaluators: The JETTS Benchmark of LLM-as-Judges as Test-Time Scaling Evaluators","date":"2025-04-21","arxiv_id":"2504.15253","repositories_listed":1,"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/evaluating-judges-as-evaluators-the-jetts#ran","syntology_url":"https://syntology.ai/paper/2504.15253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.15253"}},"official":{"repos":["salesforceairesearch/jetts-benchmark"],"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/kgmel-knowledge-graph-enhanced-multimodal","slug":"kgmel-knowledge-graph-enhanced-multimodal","title":"KGMEL: Knowledge Graph-Enhanced Multimodal Entity Linking","date":"2025-04-21","arxiv_id":"2504.15135","repositories_listed":1,"syntology":null},{"url":"/paper/llm4ranking-an-easy-to-use-framework-of","slug":"llm4ranking-an-easy-to-use-framework-of","title":"LLM4Ranking: An Easy-to-use Framework of Utilizing Large Language Models for Document Reranking","date":"2025-04-10","arxiv_id":"2504.07439","repositories_listed":1,"syntology":null},{"url":"/paper/retrieval-augmented-generation-with-2","slug":"retrieval-augmented-generation-with-2","title":"Retrieval Augmented Generation with Collaborative Filtering for Personalized Text Generation","date":"2025-04-08","arxiv_id":"2504.05731","repositories_listed":1,"syntology":null},{"url":"/paper/rallrec-retrieval-augmented-large-language","slug":"rallrec-retrieval-augmented-large-language","title":"RALLRec+: Retrieval Augmented Large Language Model Recommendation with Reasoning","date":"2025-03-26","arxiv_id":"2503.20430","repositories_listed":1,"syntology":null},{"url":"/paper/towards-carbon-footprint-aware-recommender","slug":"towards-carbon-footprint-aware-recommender","title":"Towards Carbon Footprint-Aware Recommender Systems for Greener Item Recommendation","date":"2025-03-21","arxiv_id":"2503.17201","repositories_listed":1,"syntology":null},{"url":"/paper/multiconir-towards-multi-condition","slug":"multiconir-towards-multi-condition","title":"MultiConIR: Towards multi-condition Information Retrieval","date":"2025-03-11","arxiv_id":"2503.08046","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-structural-and-textual-retrieval","slug":"mixture-of-structural-and-textual-retrieval","title":"Mixture of Structural-and-Textual Retrieval over Text-rich Graph Knowledge Bases","date":"2025-02-27","arxiv_id":"2502.20317","repositories_listed":1,"syntology":null},{"url":"/paper/rank1-test-time-compute-for-reranking-in","slug":"rank1-test-time-compute-for-reranking-in","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","date":"2025-02-25","arxiv_id":"2502.18418","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rank1-test-time-compute-for-reranking-in#ran","syntology_url":"https://syntology.ai/paper/2502.18418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.18418"}},"official":{"repos":["orionw/rank1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rankcot-refining-knowledge-for-retrieval","slug":"rankcot-refining-knowledge-for-retrieval","title":"RankCoT: Refining Knowledge for Retrieval-Augmented Generation through Ranking Chain-of-Thoughts","date":"2025-02-25","arxiv_id":"2502.17888","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/rankcot-refining-knowledge-for-retrieval#ran","syntology_url":"https://syntology.ai/paper/2502.17888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17888"}},"official":{"repos":["neuir/rankcot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/early-exit-and-instant-confidence-translation","slug":"early-exit-and-instant-confidence-translation","title":"Early-Exit and Instant Confidence Translation Quality Estimation","date":"2025-02-20","arxiv_id":"2502.14429","repositories_listed":1,"syntology":null},{"url":"/paper/rallrec-improving-retrieval-augmented-large","slug":"rallrec-improving-retrieval-augmented-large","title":"RALLRec: Improving Retrieval Augmented Large Language Model Recommendation with Representation Learning","date":"2025-02-10","arxiv_id":"2502.06101","repositories_listed":1,"syntology":null},{"url":"/paper/repository-level-code-search-with-neural","slug":"repository-level-code-search-with-neural","title":"Repository-level Code Search with Neural Retrieval Methods","date":"2025-02-10","arxiv_id":"2502.07067","repositories_listed":1,"syntology":null},{"url":"/paper/rankify-a-comprehensive-python-toolkit-for","slug":"rankify-a-comprehensive-python-toolkit-for","title":"Rankify: A Comprehensive Python Toolkit for Retrieval, Re-Ranking, and Retrieval-Augmented Generation","date":"2025-02-04","arxiv_id":"2502.02464","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-text-to-image-generation-via","slug":"boosting-text-to-image-generation-via","title":"Boosting Text-To-Image Generation via Multilingual Prompting in Large Multimodal Models","date":"2025-01-13","arxiv_id":"2501.07086","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-structural-memory-of-llm-agents","slug":"on-the-structural-memory-of-llm-agents","title":"On the Structural Memory of LLM Agents","date":"2024-12-17","arxiv_id":"2412.15266","repositories_listed":1,"syntology":null},{"url":"/paper/rag-playground-a-framework-for-systematic","slug":"rag-playground-a-framework-for-systematic","title":"RAG Playground: A Framework for Systematic Evaluation of Retrieval Strategies and Prompt Engineering in RAG Systems","date":"2024-12-16","arxiv_id":"2412.12322","repositories_listed":1,"syntology":null},{"url":"/paper/magneto-combining-small-and-large-language","slug":"magneto-combining-small-and-large-language","title":"Magneto: Combining Small and Large Language Models for Schema Matching","date":"2024-12-11","arxiv_id":"2412.08194","repositories_listed":1,"syntology":null},{"url":"/paper/pyterrier-genrank-the-pyterrier-plugin-for","slug":"pyterrier-genrank-the-pyterrier-plugin-for","title":"PyTerrier-GenRank: The PyTerrier Plugin for Reranking with Large Language Models","date":"2024-12-06","arxiv_id":"2412.05339","repositories_listed":1,"syntology":null},{"url":"/paper/lamra-large-multimodal-model-as-your-advanced","slug":"lamra-large-multimodal-model-as-your-advanced","title":"LamRA: Large Multimodal Model as Your Advanced Retrieval Assistant","date":"2024-12-02","arxiv_id":"2412.01720","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lamra-large-multimodal-model-as-your-advanced#ran","syntology_url":"https://syntology.ai/paper/2412.01720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.01720"}},"official":null}},{"url":"/paper/cornstack-high-quality-contrastive-data-for","slug":"cornstack-high-quality-contrastive-data-for","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","date":"2024-12-01","arxiv_id":"2412.01007","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":6,"n_instrument":6,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cornstack-high-quality-contrastive-data-for#ran","syntology_url":"https://syntology.ai/paper/2412.01007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.01007"}},"official":{"repos":["gangiswag/cornstack"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-pre-trained-text-embedding","slug":"benchmarking-pre-trained-text-embedding","title":"Benchmarking pre-trained text embedding models in aligning built asset information","date":"2024-11-18","arxiv_id":"2411.12056","repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-optimization-approach-to-machine","slug":"a-bayesian-optimization-approach-to-machine","title":"A Bayesian Optimization Approach to Machine Translation Reranking","date":"2024-11-14","arxiv_id":"2411.09694","repositories_listed":1,"syntology":null},{"url":"/paper/why-these-documents-explainable-generative","slug":"why-these-documents-explainable-generative","title":"Why These Documents? Explainable Generative Retrieval with Hierarchical Category Paths","date":"2024-11-08","arxiv_id":"2411.05572","repositories_listed":1,"syntology":null},{"url":"/paper/quill-quotation-generation-enhancement-of","slug":"quill-quotation-generation-enhancement-of","title":"QUILL: Quotation Generation Enhancement of Large Language Models","date":"2024-11-06","arxiv_id":"2411.03675","repositories_listed":1,"syntology":null},{"url":"/paper/inquire-a-natural-world-text-to-image","slug":"inquire-a-natural-world-text-to-image","title":"INQUIRE: A Natural World Text-to-Image Retrieval Benchmark","date":"2024-11-04","arxiv_id":"2411.02537","repositories_listed":1,"syntology":{"n":25,"n_ran":20,"n_constructed":0,"n_ran_checked":13,"n_instrument":7,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":3,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/inquire-a-natural-world-text-to-image#ran","syntology_url":"https://syntology.ai/paper/2411.02537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02537"}},"official":{"repos":["inquire-benchmark/INQUIRE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/leveraging-label-semantics-and-meta-label","slug":"leveraging-label-semantics-and-meta-label","title":"Leveraging Label Semantics and Meta-Label Refinement for Multi-Label Question Classification","date":"2024-11-04","arxiv_id":"2411.01841","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-content-relevance-evaluating","slug":"beyond-content-relevance-evaluating","title":"Beyond Content Relevance: Evaluating Instruction Following in Retrieval Models","date":"2024-10-31","arxiv_id":"2410.23841","repositories_listed":1,"syntology":null},{"url":"/paper/llms-are-biased-evaluators-but-not-biased-for","slug":"llms-are-biased-evaluators-but-not-biased-for","title":"LLMs are Biased Evaluators But Not Biased for Retrieval Augmented Generation","date":"2024-10-28","arxiv_id":"2410.20833","repositories_listed":1,"syntology":null},{"url":"/paper/geneol-harnessing-the-generative-power-of","slug":"geneol-harnessing-the-generative-power-of","title":"GenEOL: Harnessing the Generative Power of LLMs for Training-Free Sentence Embeddings","date":"2024-10-18","arxiv_id":"2410.14635","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/geneol-harnessing-the-generative-power-of#ran","syntology_url":"https://syntology.ai/paper/2410.14635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14635"}},"official":{"repos":["raghavlite/GenEOL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cofe-rag-a-comprehensive-full-chain","slug":"cofe-rag-a-comprehensive-full-chain","title":"CoFE-RAG: A Comprehensive Full-chain Evaluation Framework for Retrieval-Augmented Generation with Enhanced Data Diversity","date":"2024-10-16","arxiv_id":"2410.12248","repositories_listed":1,"syntology":null},{"url":"/paper/aic-ctu-system-at-averitec-re-framing","slug":"aic-ctu-system-at-averitec-re-framing","title":"AIC CTU system at AVeriTeC: Re-framing automated fact-checking as a simple RAG task","date":"2024-10-15","arxiv_id":"2410.11446","repositories_listed":1,"syntology":null},{"url":"/paper/easyrag-efficient-retrieval-augmented","slug":"easyrag-efficient-retrieval-augmented","title":"EasyRAG: Efficient Retrieval-Augmented Generation Framework for Automated Network Operations","date":"2024-10-14","arxiv_id":"2410.10315","repositories_listed":1,"syntology":null},{"url":"/paper/passage-retrieval-of-polish-texts-using-okapi","slug":"passage-retrieval-of-polish-texts-using-okapi","title":"Passage Retrieval of Polish Texts Using OKAPI BM25 and an Ensemble of Cross Encoders","date":"2024-10-06","arxiv_id":"2410.04620","repositories_listed":1,"syntology":null},{"url":"/paper/pairdistill-pairwise-relevance-distillation","slug":"pairdistill-pairwise-relevance-distillation","title":"PairDistill: Pairwise Relevance Distillation for Dense Retrieval","date":"2024-10-02","arxiv_id":"2410.01383","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pairdistill-pairwise-relevance-distillation#ran","syntology_url":"https://syntology.ai/paper/2410.01383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01383"}},"official":{"repos":["miulab/pairdistill"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enclap-analyzing-the-enclap-framework-for","slug":"enclap-analyzing-the-enclap-framework-for","title":"EnCLAP++: Analyzing the EnCLAP Framework for Optimizing Automated Audio Captioning Performance","date":"2024-09-02","arxiv_id":"2409.01201","repositories_listed":1,"syntology":null},{"url":"/paper/harnessing-the-power-of-semi-structured","slug":"harnessing-the-power-of-semi-structured","title":"Harnessing the Power of Semi-Structured Knowledge and LLMs with Triplet-Based Prefiltering for Question Answering","date":"2024-09-01","arxiv_id":"2409.00861","repositories_listed":1,"syntology":null},{"url":"/paper/doce-finding-the-sweet-spot-for-execution","slug":"doce-finding-the-sweet-spot-for-execution","title":"DOCE: Finding the Sweet Spot for Execution-Based Code Generation","date":"2024-08-25","arxiv_id":"2408.13745","repositories_listed":1,"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":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) · 0 unverified","sample_list":"/paper/doce-finding-the-sweet-spot-for-execution#ran","syntology_url":"https://syntology.ai/paper/2408.13745","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.13745"}},"official":{"repos":["deep-spin/doce"],"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/revisiting-reciprocal-recommender-systems","slug":"revisiting-reciprocal-recommender-systems","title":"Revisiting Reciprocal Recommender Systems: Metrics, Formulation, and Method","date":"2024-08-19","arxiv_id":"2408.09748","repositories_listed":1,"syntology":null},{"url":"/paper/review-driven-personalized-preference","slug":"review-driven-personalized-preference","title":"Review-driven Personalized Preference Reasoning with Large Language Models for Recommendation","date":"2024-08-12","arxiv_id":"2408.06276","repositories_listed":1,"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/review-driven-personalized-preference#ran","syntology_url":"https://syntology.ai/paper/2408.06276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06276"}},"official":{"repos":["jieyong99/exp3rt"],"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/2408-02156","slug":"2408-02156","title":"Calibration-Disentangled Learning and Relevance-Prioritized Reranking for Calibrated Sequential Recommendation","date":"2024-08-04","arxiv_id":"2408.02156","repositories_listed":1,"syntology":null},{"url":"/paper/an-energy-based-model-for-word-level","slug":"an-energy-based-model-for-word-level","title":"An Energy-based Model for Word-level AutoCompletion in Computer-aided Translation","date":"2024-07-29","arxiv_id":"2407.20083","repositories_listed":1,"syntology":null},{"url":"/paper/cscpr-cross-source-context-indoor-rgb-d-place","slug":"cscpr-cross-source-context-indoor-rgb-d-place","title":"CSCPR: Cross-Source-Context Indoor RGB-D Place Recognition","date":"2024-07-24","arxiv_id":"2407.17457","repositories_listed":1,"syntology":null},{"url":"/paper/autobencher-creating-salient-novel-difficult","slug":"autobencher-creating-salient-novel-difficult","title":"AutoBencher: Creating Salient, Novel, Difficult Datasets for Language Models","date":"2024-07-11","arxiv_id":"2407.08351","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autobencher-creating-salient-novel-difficult#ran","syntology_url":"https://syntology.ai/paper/2407.08351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.08351"}},"official":{"repos":["XiangLi1999/AutoBencher"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/litsearch-a-retrieval-benchmark-for","slug":"litsearch-a-retrieval-benchmark-for","title":"LitSearch: A Retrieval Benchmark for Scientific Literature Search","date":"2024-07-10","arxiv_id":"2407.18940","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/litsearch-a-retrieval-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2407.18940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.18940"}},"official":{"repos":["princeton-nlp/litsearch"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/first-faster-improved-listwise-reranking-with","slug":"first-faster-improved-listwise-reranking-with","title":"FIRST: Faster Improved Listwise Reranking with Single Token Decoding","date":"2024-06-21","arxiv_id":"2406.15657","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/first-faster-improved-listwise-reranking-with#ran","syntology_url":"https://syntology.ai/paper/2406.15657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15657"}},"official":{"repos":["gangiswag/llm-reranker"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"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/medikal-integrating-knowledge-graphs-as","slug":"medikal-integrating-knowledge-graphs-as","title":"medIKAL: Integrating Knowledge Graphs as Assistants of LLMs for Enhanced Clinical Diagnosis on EMRs","date":"2024-06-20","arxiv_id":"2406.14326","repositories_listed":1,"syntology":null}],"syntology_records":31,"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":59,"papers_where_code_ran_first_page":"/task/reranking/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":"archive","page":2,"of":6,"url":"/task/reranking/papers/2","json":"/task/reranking/papers/2.json","rows":100},{"order":"archive","page":3,"of":6,"url":"/task/reranking/papers/3","json":"/task/reranking/papers/3.json","rows":100},{"order":"archive","page":4,"of":6,"url":"/task/reranking/papers/4","json":"/task/reranking/papers/4.json","rows":100},{"order":"archive","page":5,"of":6,"url":"/task/reranking/papers/5","json":"/task/reranking/papers/5.json","rows":100},{"order":"archive","page":6,"of":6,"url":"/task/reranking/papers/6","json":"/task/reranking/papers/6.json","rows":86},{"order":"ran","page":1,"of":1,"url":"/task/reranking/papers/ran/1","json":"/task/reranking/papers/ran/1.json","rows":59}],"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":"04707d60b9debff1b4c89d5e946d2f452baba2f0959e61f85b9dc351a070b504","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}