{"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/papers/ran/1","list_of":"/task/reranking","task":"Reranking","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,59],"of":59,"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":45,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":45,"listed_every_run_a_failure_of_syntologys_instrument":14,"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"},"first_page":"/task/reranking/papers/ran/1","prev":null,"next":null,"papers":[{"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/omgm-orchestrate-multiple-granularities-and","slug":"omgm-orchestrate-multiple-granularities-and","title":"OMGM: Orchestrate Multiple Granularities and Modalities for Efficient Multimodal Retrieval","date":"2025-05-10","arxiv_id":"2505.07879","repositories_listed":0,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/omgm-orchestrate-multiple-granularities-and#ran","syntology_url":"https://syntology.ai/paper/2505.07879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.07879"}},"official":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/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/sirerag-indexing-similar-and-related","slug":"sirerag-indexing-similar-and-related","title":"SiReRAG: Indexing Similar and Related Information for Multihop Reasoning","date":"2024-12-09","arxiv_id":"2412.06206","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sirerag-indexing-similar-and-related#ran","syntology_url":"https://syntology.ai/paper/2412.06206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.06206"}},"official":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":12,"n_instrument":0,"n_unverified":2,"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) · 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":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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":16,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":15,"n_pointer_only":3,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 1 violated, 15 with no contract checked; 4 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":5,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"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":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 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; 0 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":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/reranking-laws-for-language-generation-a","slug":"reranking-laws-for-language-generation-a","title":"Reranking Laws for Language Generation: A Communication-Theoretic Perspective","date":"2024-09-11","arxiv_id":"2409.07131","repositories_listed":0,"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/reranking-laws-for-language-generation-a#ran","syntology_url":"https://syntology.ai/paper/2409.07131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.07131"}},"official":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/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/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":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 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":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mgte-generalized-long-context-text","slug":"mgte-generalized-long-context-text","title":"mGTE: Generalized Long-Context Text Representation and Reranking Models for Multilingual Text Retrieval","date":"2024-07-29","arxiv_id":"2407.19669","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mgte-generalized-long-context-text#ran","syntology_url":"https://syntology.ai/paper/2407.19669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19669"}},"official":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":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 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":7,"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":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 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":1,"n_unverified":3,"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":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 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":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rar-b-reasoning-as-retrieval-benchmark","slug":"rar-b-reasoning-as-retrieval-benchmark","title":"RAR-b: Reasoning as Retrieval Benchmark","date":"2024-04-09","arxiv_id":"2404.06347","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rar-b-reasoning-as-retrieval-benchmark#ran","syntology_url":"https://syntology.ai/paper/2404.06347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06347"}},"official":{"repos":["gowitheflow-1998/rar-b"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/easy-to-hard-generalization-scalable","slug":"easy-to-hard-generalization-scalable","title":"Easy-to-Hard Generalization: Scalable Alignment Beyond Human Supervision","date":"2024-03-14","arxiv_id":"2403.09472","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/easy-to-hard-generalization-scalable#ran","syntology_url":"https://syntology.ai/paper/2403.09472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09472"}},"official":{"repos":["edward-sun/easy-to-hard"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/listt5-listwise-reranking-with-fusion-in","slug":"listt5-listwise-reranking-with-fusion-in","title":"ListT5: Listwise Reranking with Fusion-in-Decoder Improves Zero-shot Retrieval","date":"2024-02-24","arxiv_id":"2402.15838","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/listt5-listwise-reranking-with-fusion-in#ran","syntology_url":"https://syntology.ai/paper/2402.15838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15838"}},"official":{"repos":["soyoung97/listt5"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"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":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 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; 0 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":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/list-aware-reranking-truncation-joint-model","slug":"list-aware-reranking-truncation-joint-model","title":"List-aware Reranking-Truncation Joint Model for Search and Retrieval-augmented Generation","date":"2024-02-05","arxiv_id":"2402.02764","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/list-aware-reranking-truncation-joint-model#ran","syntology_url":"https://syntology.ai/paper/2402.02764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02764"}},"official":{"repos":["xsc1234/genrt"],"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/re3val-reinforced-and-reranked-generative","slug":"re3val-reinforced-and-reranked-generative","title":"Re3val: Reinforced and Reranked Generative Retrieval","date":"2024-01-30","arxiv_id":"2401.16979","repositories_listed":0,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":13,"phrase":"10 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/re3val-reinforced-and-reranked-generative#ran","syntology_url":"https://syntology.ai/paper/2401.16979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16979"}},"official":null}},{"url":"/paper/mining-fine-grained-image-text-alignment-for","slug":"mining-fine-grained-image-text-alignment-for","title":"Mining Fine-Grained Image-Text Alignment for Zero-Shot Captioning via Text-Only Training","date":"2024-01-04","arxiv_id":"2401.02347","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"3 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mining-fine-grained-image-text-alignment-for#ran","syntology_url":"https://syntology.ai/paper/2401.02347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.02347"}},"official":{"repos":["artanic30/maccap"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/affective-and-dynamic-beam-search-for-story","slug":"affective-and-dynamic-beam-search-for-story","title":"Affective and Dynamic Beam Search for Story Generation","date":"2023-10-23","arxiv_id":"2310.15079","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":2,"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/affective-and-dynamic-beam-search-for-story#ran","syntology_url":"https://syntology.ai/paper/2310.15079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15079"}},"official":{"repos":["tenghaohuang/affgen"],"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/found-in-the-middle-permutation-self","slug":"found-in-the-middle-permutation-self","title":"Found in the Middle: Permutation Self-Consistency Improves Listwise Ranking in Large Language Models","date":"2023-10-11","arxiv_id":"2310.07712","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/found-in-the-middle-permutation-self#ran","syntology_url":"https://syntology.ai/paper/2310.07712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07712"}},"official":{"repos":["castorini/perm-sc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/generative-flow-network-for-listwise","slug":"generative-flow-network-for-listwise","title":"Generative Flow Network for Listwise Recommendation","date":"2023-06-04","arxiv_id":"2306.02239","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generative-flow-network-for-listwise#ran","syntology_url":"https://syntology.ai/paper/2306.02239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02239"}},"official":{"repos":["charliemat/gfn4rec"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/eel-efficiently-encoding-lattices-for","slug":"eel-efficiently-encoding-lattices-for","title":"EEL: Efficiently Encoding Lattices for Reranking","date":"2023-06-01","arxiv_id":"2306.00947","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/eel-efficiently-encoding-lattices-for#ran","syntology_url":"https://syntology.ai/paper/2306.00947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00947"}},"official":{"repos":["prasanns/eel-reranking"],"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/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":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 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":4,"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/lever-learning-to-verify-language-to-code","slug":"lever-learning-to-verify-language-to-code","title":"LEVER: Learning to Verify Language-to-Code Generation with Execution","date":"2023-02-16","arxiv_id":"2302.08468","repositories_listed":1,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":18,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":17,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 1 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/lever-learning-to-verify-language-to-code#ran","syntology_url":"https://syntology.ai/paper/2302.08468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08468"}},"official":{"repos":["niansong1996/lever"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/coder-reviewer-reranking-for-code-generation","slug":"coder-reviewer-reranking-for-code-generation","title":"Coder Reviewer Reranking for Code Generation","date":"2022-11-29","arxiv_id":"2211.16490","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}},"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-bilingual-lexicon-induction-with-1","slug":"improving-bilingual-lexicon-induction-with-1","title":"Improving Bilingual Lexicon Induction with Cross-Encoder Reranking","date":"2022-10-30","arxiv_id":"2210.16953","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-bilingual-lexicon-induction-with-1#ran","syntology_url":"https://syntology.ai/paper/2210.16953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16953"}},"official":{"repos":["cambridgeltl/BLICEr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/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/re2g-retrieve-rerank-generate-2","slug":"re2g-retrieve-rerank-generate-2","title":"Re2G: Retrieve, Rerank, Generate","date":"2022-07-13","arxiv_id":"2207.06300","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/re2g-retrieve-rerank-generate-2#ran","syntology_url":"https://syntology.ai/paper/2207.06300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06300"}},"official":{"repos":["ibm/kgi-slot-filling"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/transcormer-transformer-for-sentence-scoring","slug":"transcormer-transformer-for-sentence-scoring","title":"Transcormer: Transformer for Sentence Scoring with Sliding Language Modeling","date":"2022-05-25","arxiv_id":"2205.12986","repositories_listed":1,"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/transcormer-transformer-for-sentence-scoring#ran","syntology_url":"https://syntology.ai/paper/2205.12986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12986"}},"official":null}},{"url":"/paper/quality-aware-decoding-for-neural-machine-1","slug":"quality-aware-decoding-for-neural-machine-1","title":"Quality-Aware Decoding for Neural Machine Translation","date":"2022-05-02","arxiv_id":"2205.00978","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/quality-aware-decoding-for-neural-machine-1#ran","syntology_url":"https://syntology.ai/paper/2205.00978","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00978"}},"official":{"repos":["deep-spin/qaware-decode"],"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/multi-level-interaction-reranking-with-user","slug":"multi-level-interaction-reranking-with-user","title":"Multi-Level Interaction Reranking with User Behavior History","date":"2022-04-20","arxiv_id":"2204.09370","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/multi-level-interaction-reranking-with-user#ran","syntology_url":"https://syntology.ai/paper/2204.09370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09370"}},"official":{"repos":["YunjiaXi/Multi-Level-Interaction-Reranking"],"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/unsupervised-cross-task-generalization-via","slug":"unsupervised-cross-task-generalization-via","title":"Unsupervised Cross-Task Generalization via Retrieval Augmentation","date":"2022-04-17","arxiv_id":"2204.07937","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":1,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-cross-task-generalization-via#ran","syntology_url":"https://syntology.ai/paper/2204.07937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07937"}},"official":{"repos":["INK-USC/ReCross"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":1,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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/instance-level-image-retrieval-using","slug":"instance-level-image-retrieval-using","title":"Instance-level Image Retrieval using Reranking Transformers","date":"2021-03-22","arxiv_id":"2103.12236","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/instance-level-image-retrieval-using#ran","syntology_url":"https://syntology.ai/paper/2103.12236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12236"}},"official":{"repos":["uvavision/rerankingtransformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/reader-guided-passage-reranking-for-open","slug":"reader-guided-passage-reranking-for-open","title":"Rider: Reader-Guided Passage Reranking for Open-Domain Question Answering","date":"2021-01-01","arxiv_id":"2101.00294","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/reader-guided-passage-reranking-for-open#ran","syntology_url":"https://syntology.ai/paper/2101.00294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.00294"}},"official":{"repos":["morningmoni/GAR"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/retrieve-rerank-read-then-iterate-answering","slug":"retrieve-rerank-read-then-iterate-answering","title":"Answering Open-Domain Questions of Varying Reasoning Steps from Text","date":"2020-10-23","arxiv_id":"2010.12527","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/retrieve-rerank-read-then-iterate-answering#ran","syntology_url":"https://syntology.ai/paper/2010.12527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12527"}},"official":{"repos":["beerqa/irrr"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/energy-based-reranking-improving-neural","slug":"energy-based-reranking-improving-neural","title":"Energy-Based Reranking: Improving Neural Machine Translation Using Energy-Based Models","date":"2020-09-20","arxiv_id":"2009.13267","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/energy-based-reranking-improving-neural#ran","syntology_url":"https://syntology.ai/paper/2009.13267","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13267"}},"official":{"repos":["rooshenas/ebr_mt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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":10,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 1 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":10,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/tired-of-topic-models-clusters-of-pretrained","slug":"tired-of-topic-models-clusters-of-pretrained","title":"Tired of Topic Models? Clusters of Pretrained Word Embeddings Make for Fast and Good Topics too!","date":"2020-04-30","arxiv_id":"2004.14914","repositories_listed":1,"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":2,"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/tired-of-topic-models-clusters-of-pretrained#ran","syntology_url":"https://syntology.ai/paper/2004.14914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14914"}},"official":{"repos":["adalmia96/Cluster-Analysis"],"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/fine-grained-fashion-similarity-learning-by","slug":"fine-grained-fashion-similarity-learning-by","title":"Fine-Grained Fashion Similarity Learning by Attribute-Specific Embedding Network","date":"2020-02-07","arxiv_id":"2002.02814","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-grained-fashion-similarity-learning-by#ran","syntology_url":"https://syntology.ai/paper/2002.02814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02814"}},"official":{"repos":["Maryeon/asen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["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":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 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/retrieve-read-rerank-towards-end-to-end-multi","slug":"retrieve-read-rerank-towards-end-to-end-multi","title":"Retrieve, Read, Rerank: Towards End-to-End Multi-Document Reading Comprehension","date":"2019-06-11","arxiv_id":"1906.04618","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/retrieve-read-rerank-towards-end-to-end-multi#ran","syntology_url":"https://syntology.ai/paper/1906.04618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04618"}},"official":{"repos":["huminghao16/RE3QA"],"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/evidence-aggregation-for-answer-re-ranking-in","slug":"evidence-aggregation-for-answer-re-ranking-in","title":"Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering","date":"2017-11-14","arxiv_id":"1711.05116","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/evidence-aggregation-for-answer-re-ranking-in#ran","syntology_url":"https://syntology.ai/paper/1711.05116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05116"}},"official":{"repos":["shuohangwang/mprc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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}}],"record_sha256":"d7c60b796508b07aae434383ae837aa024117786e07b22cde61dc3a8b3f95172","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}