{"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/information-retrieval/papers/ran/2","list_of":"/task/information-retrieval","task":"Information Retrieval","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":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,191],"of":191,"counts":{"archive_papers_tagged":4740,"with_a_code_link":1188,"where_syntology_ran_a_sample":191,"not_listed_spam_title":0,"listed":4740,"listed_where_code_ran":191,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":151,"every_run_a_failure_of_syntologys_instrument":40,"listed_with_a_run_with_no_instrument_failure":151,"listed_every_run_a_failure_of_syntologys_instrument":40,"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/information-retrieval/papers/ran/1","prev":"/task/information-retrieval/papers/ran/1","next":null,"papers":[{"url":"/paper/retromae-2-duplex-masked-auto-encoder-for-pre","slug":"retromae-2-duplex-masked-auto-encoder-for-pre","title":"RetroMAE-2: Duplex Masked Auto-Encoder For Pre-Training Retrieval-Oriented Language Models","date":"2023-05-04","arxiv_id":"2305.02564","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":0,"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/retromae-2-duplex-masked-auto-encoder-for-pre#ran","syntology_url":"https://syntology.ai/paper/2305.02564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02564"}},"official":{"repos":["staoxiao/retromae"],"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/uncovering-chatgpt-s-capabilities-in","slug":"uncovering-chatgpt-s-capabilities-in","title":"Uncovering ChatGPT's Capabilities in Recommender Systems","date":"2023-05-03","arxiv_id":"2305.02182","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/uncovering-chatgpt-s-capabilities-in#ran","syntology_url":"https://syntology.ai/paper/2305.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02182"}},"official":{"repos":["rainym00d/llm4rs"],"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/mphayaner-named-entity-recognition-for","slug":"mphayaner-named-entity-recognition-for","title":"MphayaNER: Named Entity Recognition for Tshivenda","date":"2023-04-08","arxiv_id":"2304.03952","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 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) · 0 unverified","sample_list":"/paper/mphayaner-named-entity-recognition-for#ran","syntology_url":"https://syntology.ai/paper/2304.03952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.03952"}},"official":{"repos":["rendanim/mphayaner"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-the-role-of-token-retrieval-in","slug":"rethinking-the-role-of-token-retrieval-in","title":"Rethinking the Role of Token Retrieval in Multi-Vector Retrieval","date":"2023-04-04","arxiv_id":"2304.01982","repositories_listed":2,"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":0,"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/rethinking-the-role-of-token-retrieval-in#ran","syntology_url":"https://syntology.ai/paper/2304.01982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.01982"}},"official":{"repos":["google-deepmind/xtr"],"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/hierarchical-video-moment-retrieval-and-step","slug":"hierarchical-video-moment-retrieval-and-step","title":"Hierarchical Video-Moment Retrieval and Step-Captioning","date":"2023-03-29","arxiv_id":"2303.16406","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"10 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hierarchical-video-moment-retrieval-and-step#ran","syntology_url":"https://syntology.ai/paper/2303.16406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.16406"}},"official":{"repos":["j-min/HiREST"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/annollm-making-large-language-models-to-be","slug":"annollm-making-large-language-models-to-be","title":"AnnoLLM: Making Large Language Models to Be Better Crowdsourced Annotators","date":"2023-03-29","arxiv_id":"2303.16854","repositories_listed":2,"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":0,"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/annollm-making-large-language-models-to-be#ran","syntology_url":"https://syntology.ai/paper/2303.16854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.16854"}},"official":{"repos":["nlpcode/annollm"],"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/deep-declarative-dynamic-time-warping-for-end","slug":"deep-declarative-dynamic-time-warping-for-end","title":"Deep Declarative Dynamic Time Warping for End-to-End Learning of Alignment Paths","date":"2023-03-19","arxiv_id":"2303.10778","repositories_listed":1,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-declarative-dynamic-time-warping-for-end#ran","syntology_url":"https://syntology.ai/paper/2303.10778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10778"}},"official":{"repos":["mingu6/declarativedtw"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/spacerini-plug-and-play-search-engines-with","slug":"spacerini-plug-and-play-search-engines-with","title":"Spacerini: Plug-and-play Search Engines with Pyserini and Hugging Face","date":"2023-02-28","arxiv_id":"2302.14534","repositories_listed":1,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 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) · 7 unverified","sample_list":"/paper/spacerini-plug-and-play-search-engines-with#ran","syntology_url":"https://syntology.ai/paper/2302.14534","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.14534"}},"official":{"repos":["castorini/hf-spacerini"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/jazznet-a-dataset-of-fundamental-piano","slug":"jazznet-a-dataset-of-fundamental-piano","title":"jazznet: A Dataset of Fundamental Piano Patterns for Music Audio Machine Learning Research","date":"2023-02-17","arxiv_id":"2302.08632","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/jazznet-a-dataset-of-fundamental-piano#ran","syntology_url":"https://syntology.ai/paper/2302.08632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08632"}},"official":{"repos":["tosiron/jazznet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/one-embedder-any-task-instruction-finetuned","slug":"one-embedder-any-task-instruction-finetuned","title":"One Embedder, Any Task: Instruction-Finetuned Text Embeddings","date":"2022-12-19","arxiv_id":"2212.09741","repositories_listed":4,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-embedder-any-task-instruction-finetuned#ran","syntology_url":"https://syntology.ai/paper/2212.09741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09741"}},"official":{"repos":["HKUNLP/instructor-embedding"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":3,"ran_from_kinds":["listed","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/the-chamber-ensemble-generator-limitless-high","slug":"the-chamber-ensemble-generator-limitless-high","title":"The Chamber Ensemble Generator: Limitless High-Quality MIR Data via Generative Modeling","date":"2022-09-28","arxiv_id":"2209.14458","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/the-chamber-ensemble-generator-limitless-high#ran","syntology_url":"https://syntology.ai/paper/2209.14458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.14458"}},"official":{"repos":["lukewys/chamber-ensemble-generator"],"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/concrete-improving-cross-lingual-fact","slug":"concrete-improving-cross-lingual-fact","title":"CONCRETE: Improving Cross-lingual Fact-checking with Cross-lingual Retrieval","date":"2022-09-05","arxiv_id":"2209.02071","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/concrete-improving-cross-lingual-fact#ran","syntology_url":"https://syntology.ai/paper/2209.02071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.02071"}},"official":{"repos":["khuangaf/concrete"],"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/tripjudge-a-relevance-judgement-test","slug":"tripjudge-a-relevance-judgement-test","title":"TripJudge: A Relevance Judgement Test Collection for TripClick Health Retrieval","date":"2022-08-14","arxiv_id":"2208.06936","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tripjudge-a-relevance-judgement-test#ran","syntology_url":"https://syntology.ai/paper/2208.06936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.06936"}},"official":{"repos":["sophiaalthammer/tripjudge"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-learning-with-retrieval-augmented","slug":"few-shot-learning-with-retrieval-augmented","title":"Atlas: Few-shot Learning with Retrieval Augmented Language Models","date":"2022-08-05","arxiv_id":"2208.03299","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-learning-with-retrieval-augmented#ran","syntology_url":"https://syntology.ai/paper/2208.03299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03299"}},"official":{"repos":["facebookresearch/atlas"],"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/contextual-bandits-with-smooth-regret","slug":"contextual-bandits-with-smooth-regret","title":"Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces","date":"2022-07-12","arxiv_id":"2207.05849","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/contextual-bandits-with-smooth-regret#ran","syntology_url":"https://syntology.ai/paper/2207.05849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05849"}},"official":{"repos":["pmineiro/smoothcb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-proper-contrastive-self-supervised","slug":"towards-proper-contrastive-self-supervised","title":"Towards Proper Contrastive Self-supervised Learning Strategies For Music Audio Representation","date":"2022-07-10","arxiv_id":"2207.04471","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/towards-proper-contrastive-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2207.04471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04471"}},"official":{"repos":["kunimi00/contrastivesslmusicaudio"],"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/bridging-the-gap-between-indexing-and","slug":"bridging-the-gap-between-indexing-and","title":"Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generation","date":"2022-06-21","arxiv_id":"2206.10128","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/bridging-the-gap-between-indexing-and#ran","syntology_url":"https://syntology.ai/paper/2206.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10128"}},"official":{"repos":["arvinzhuang/dsi-qg"],"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/infinite-recommendation-networks-a-data","slug":"infinite-recommendation-networks-a-data","title":"Infinite Recommendation Networks: A Data-Centric Approach","date":"2022-06-03","arxiv_id":"2206.02626","repositories_listed":5,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/infinite-recommendation-networks-a-data#ran","syntology_url":"https://syntology.ai/paper/2206.02626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02626"}},"official":{"repos":["noveens/distill_cf","noveens/infinite_ae_cf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/refining-query-representations-for-dense","slug":"refining-query-representations-for-dense","title":"Optimizing Test-Time Query Representations for Dense Retrieval","date":"2022-05-25","arxiv_id":"2205.12680","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/refining-query-representations-for-dense#ran","syntology_url":"https://syntology.ai/paper/2205.12680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12680"}},"official":{"repos":["dmis-lab/tour"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tracing-knowledge-in-language-models-back-to","slug":"tracing-knowledge-in-language-models-back-to","title":"Towards Tracing Factual Knowledge in Language Models Back to the Training Data","date":"2022-05-23","arxiv_id":"2205.11482","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/tracing-knowledge-in-language-models-back-to#ran","syntology_url":"https://syntology.ai/paper/2205.11482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11482"}},"official":{"repos":["ekinakyurek/influence"],"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/plaid-an-efficient-engine-for-late","slug":"plaid-an-efficient-engine-for-late","title":"PLAID: An Efficient Engine for Late Interaction Retrieval","date":"2022-05-19","arxiv_id":"2205.09707","repositories_listed":2,"syntology":{"n":12,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":11,"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) · 11 unverified","sample_list":"/paper/plaid-an-efficient-engine-for-late#ran","syntology_url":"https://syntology.ai/paper/2205.09707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09707"}},"official":{"repos":["stanford-futuredata/ColBERT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unifying-language-learning-paradigms","slug":"unifying-language-learning-paradigms","title":"UL2: Unifying Language Learning Paradigms","date":"2022-05-10","arxiv_id":"2205.05131","repositories_listed":2,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unifying-language-learning-paradigms#ran","syntology_url":"https://syntology.ai/paper/2205.05131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05131"}},"official":{"repos":["google-research/google-research"],"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/dimension-reduction-for-efficient-dense","slug":"dimension-reduction-for-efficient-dense","title":"Dimension Reduction for Efficient Dense Retrieval via Conditional Autoencoder","date":"2022-05-06","arxiv_id":"2205.03284","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/dimension-reduction-for-efficient-dense#ran","syntology_url":"https://syntology.ai/paper/2205.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03284"}},"official":{"repos":["neuir/conae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-multisided-exposure-fairness-for","slug":"joint-multisided-exposure-fairness-for","title":"Joint Multisided Exposure Fairness for Recommendation","date":"2022-04-29","arxiv_id":"2205.00048","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/joint-multisided-exposure-fairness-for#ran","syntology_url":"https://syntology.ai/paper/2205.00048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00048"}},"official":{"repos":["haolun-wu/jmefairness"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/human-preferences-as-dueling-bandits","slug":"human-preferences-as-dueling-bandits","title":"Human Preferences as Dueling Bandits","date":"2022-04-21","arxiv_id":"2204.10362","repositories_listed":2,"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/human-preferences-as-dueling-bandits#ran","syntology_url":"https://syntology.ai/paper/2204.10362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.10362"}},"official":{"repos":["claclark/preferences","xinyiyan/duelingbandits"],"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/exploring-dual-encoder-architectures-for","slug":"exploring-dual-encoder-architectures-for","title":"Exploring Dual Encoder Architectures for Question Answering","date":"2022-04-14","arxiv_id":"2204.07120","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/exploring-dual-encoder-architectures-for#ran","syntology_url":"https://syntology.ai/paper/2204.07120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07120"}},"official":null}},{"url":"/paper/sgpt-gpt-sentence-embeddings-for-semantic","slug":"sgpt-gpt-sentence-embeddings-for-semantic","title":"SGPT: GPT Sentence Embeddings for Semantic Search","date":"2022-02-17","arxiv_id":"2202.08904","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/sgpt-gpt-sentence-embeddings-for-semantic#ran","syntology_url":"https://syntology.ai/paper/2202.08904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08904"}},"official":{"repos":["muennighoff/sgpt"],"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/inpars-data-augmentation-for-information","slug":"inpars-data-augmentation-for-information","title":"InPars: Data Augmentation for Information Retrieval using Large Language Models","date":"2022-02-10","arxiv_id":"2202.05144","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/inpars-data-augmentation-for-information#ran","syntology_url":"https://syntology.ai/paper/2202.05144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05144"}},"official":{"repos":["zetaalphavector/inpars"],"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/lamda-language-models-for-dialog-applications","slug":"lamda-language-models-for-dialog-applications","title":"LaMDA: Language Models for Dialog Applications","date":"2022-01-20","arxiv_id":"2201.08239","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":1,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lamda-language-models-for-dialog-applications#ran","syntology_url":"https://syntology.ai/paper/2201.08239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08239"}},"official":null}},{"url":"/paper/transfer-learning-approaches-for-building","slug":"transfer-learning-approaches-for-building","title":"Transfer Learning Approaches for Building Cross-Language Dense Retrieval Models","date":"2022-01-20","arxiv_id":"2201.08471","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/transfer-learning-approaches-for-building#ran","syntology_url":"https://syntology.ai/paper/2201.08471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08471"}},"official":{"repos":["hltcoe/colbert-x"],"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/towards-unsupervised-dense-information","slug":"towards-unsupervised-dense-information","title":"Unsupervised Dense Information Retrieval with Contrastive Learning","date":"2021-12-16","arxiv_id":"2112.09118","repositories_listed":6,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"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, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-unsupervised-dense-information#ran","syntology_url":"https://syntology.ai/paper/2112.09118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.09118"}},"official":{"repos":["facebookresearch/contriever"],"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/colbertv2-effective-and-efficient-retrieval","slug":"colbertv2-effective-and-efficient-retrieval","title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction","date":"2021-12-02","arxiv_id":"2112.01488","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/colbertv2-effective-and-efficient-retrieval#ran","syntology_url":"https://syntology.ai/paper/2112.01488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.01488"}},"official":{"repos":["stanford-futuredata/ColBERT"],"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/learning-discrete-representations-via-1","slug":"learning-discrete-representations-via-1","title":"Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval","date":"2021-10-12","arxiv_id":"2110.05789","repositories_listed":4,"syntology":{"n":22,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-discrete-representations-via-1#ran","syntology_url":"https://syntology.ai/paper/2110.05789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.05789"}},"official":{"repos":["jingtaozhan/repconc"],"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":["listed","official"]}}},{"url":"/paper/sequence-to-sequence-piano-transcription-with","slug":"sequence-to-sequence-piano-transcription-with","title":"Sequence-to-Sequence Piano Transcription with Transformers","date":"2021-07-19","arxiv_id":"2107.09142","repositories_listed":2,"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/sequence-to-sequence-piano-transcription-with#ran","syntology_url":"https://syntology.ai/paper/2107.09142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.09142"}},"official":null}},{"url":"/paper/more-robust-dense-retrieval-with-contrastive","slug":"more-robust-dense-retrieval-with-contrastive","title":"More Robust Dense Retrieval with Contrastive Dual Learning","date":"2021-07-16","arxiv_id":"2107.07773","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/more-robust-dense-retrieval-with-contrastive#ran","syntology_url":"https://syntology.ai/paper/2107.07773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07773"}},"official":{"repos":["thunlp/DANCE"],"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/codified-audio-language-modeling-learns","slug":"codified-audio-language-modeling-learns","title":"Codified audio language modeling learns useful representations for music information retrieval","date":"2021-07-12","arxiv_id":"2107.05677","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":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/codified-audio-language-modeling-learns#ran","syntology_url":"https://syntology.ai/paper/2107.05677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05677"}},"official":{"repos":["p-lambda/jukemir"],"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/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/an-information-retrieval-approach-to-building","slug":"an-information-retrieval-approach-to-building","title":"An Information Retrieval Approach to Building Datasets for Hate Speech Detection","date":"2021-06-17","arxiv_id":"2106.09775","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":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) · 2 unverified","sample_list":"/paper/an-information-retrieval-approach-to-building#ran","syntology_url":"https://syntology.ai/paper/2106.09775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09775"}},"official":{"repos":["mdmustafizurrahman/An-Information-Retrieval-Approach-to-Building-Datasets-for-Hate-Speech-Detection"],"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/tracing-back-music-emotion-predictions-to","slug":"tracing-back-music-emotion-predictions-to","title":"Tracing Back Music Emotion Predictions to Sound Sources and Intuitive Perceptual Qualities","date":"2021-06-14","arxiv_id":"2106.07787","repositories_listed":2,"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":5,"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/tracing-back-music-emotion-predictions-to#ran","syntology_url":"https://syntology.ai/paper/2106.07787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07787"}},"official":{"repos":["CPJKU/audioLIME","shreyanc/model_debugging"],"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/learning-passage-impacts-for-inverted-indexes","slug":"learning-passage-impacts-for-inverted-indexes","title":"Learning Passage Impacts for Inverted Indexes","date":"2021-04-24","arxiv_id":"2104.12016","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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","sample_list":"/paper/learning-passage-impacts-for-inverted-indexes#ran","syntology_url":"https://syntology.ai/paper/2104.12016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12016"}},"official":{"repos":["DI4IR/SIGIR2021"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/b-prop-bootstrapped-pre-training-with","slug":"b-prop-bootstrapped-pre-training-with","title":"B-PROP: Bootstrapped Pre-training with Representative Words Prediction for Ad-hoc Retrieval","date":"2021-04-20","arxiv_id":"2104.09791","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/b-prop-bootstrapped-pre-training-with#ran","syntology_url":"https://syntology.ai/paper/2104.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09791"}},"official":{"repos":["Albert-Ma/PROP"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/beir-a-heterogenous-benchmark-for-zero-shot","slug":"beir-a-heterogenous-benchmark-for-zero-shot","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","date":"2021-04-17","arxiv_id":"2104.08663","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/beir-a-heterogenous-benchmark-for-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2104.08663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08663"}},"official":{"repos":["UKPLab/beir"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/back-to-the-basics-a-quantitative-analysis-of","slug":"back-to-the-basics-a-quantitative-analysis-of","title":"Back to the Basics: A Quantitative Analysis of Statistical and Graph-Based Term Weighting Schemes for Keyword Extraction","date":"2021-04-16","arxiv_id":"2104.08028","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/back-to-the-basics-a-quantitative-analysis-of#ran","syntology_url":"https://syntology.ai/paper/2104.08028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08028"}},"official":{"repos":["asahi417/kex"],"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":["official"]}}},{"url":"/paper/tsdae-using-transformer-based-sequential","slug":"tsdae-using-transformer-based-sequential","title":"TSDAE: Using Transformer-based Sequential Denoising Auto-Encoder for Unsupervised Sentence Embedding Learning","date":"2021-04-14","arxiv_id":"2104.06979","repositories_listed":6,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/tsdae-using-transformer-based-sequential#ran","syntology_url":"https://syntology.ai/paper/2104.06979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06979"}},"official":{"repos":["kwang2049/pytorch-bertflow","kwang2049/useb","ukplab/pytorch-bertflow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/macro-average-rare-types-are-important-too","slug":"macro-average-rare-types-are-important-too","title":"Macro-Average: Rare Types Are Important Too","date":"2021-04-12","arxiv_id":"2104.05700","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/macro-average-rare-types-are-important-too#ran","syntology_url":"https://syntology.ai/paper/2104.05700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05700"}},"official":{"repos":["thammegowda/007-mt-eval-macro"],"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":["found_in_text"]}}},{"url":"/paper/csfcube-a-test-collection-of-computer-science","slug":"csfcube-a-test-collection-of-computer-science","title":"CSFCube -- A Test Collection of Computer Science Research Articles for Faceted Query by Example","date":"2021-03-24","arxiv_id":"2103.12906","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/csfcube-a-test-collection-of-computer-science#ran","syntology_url":"https://syntology.ai/paper/2103.12906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12906"}},"official":{"repos":["iesl/CSFCube"],"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/naturalproofs-mathematical-theorem-proving-in","slug":"naturalproofs-mathematical-theorem-proving-in","title":"NaturalProofs: Mathematical Theorem Proving in Natural Language","date":"2021-03-24","arxiv_id":"2104.01112","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/naturalproofs-mathematical-theorem-proving-in#ran","syntology_url":"https://syntology.ai/paper/2104.01112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01112"}},"official":{"repos":["wellecks/naturalproofs"],"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/pyserini-an-easy-to-use-python-toolkit-to","slug":"pyserini-an-easy-to-use-python-toolkit-to","title":"Pyserini: An Easy-to-Use Python Toolkit to Support Replicable IR Research with Sparse and Dense Representations","date":"2021-02-19","arxiv_id":"2102.10073","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pyserini-an-easy-to-use-python-toolkit-to#ran","syntology_url":"https://syntology.ai/paper/2102.10073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.10073"}},"official":{"repos":["castorini/pyserini"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distilling-knowledge-from-reader-to-retriever-1","slug":"distilling-knowledge-from-reader-to-retriever-1","title":"Distilling Knowledge from Reader to Retriever for Question Answering","date":"2020-12-08","arxiv_id":"2012.04584","repositories_listed":4,"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/distilling-knowledge-from-reader-to-retriever-1#ran","syntology_url":"https://syntology.ai/paper/2012.04584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.04584"}},"official":{"repos":["facebookresearch/FiD"],"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/debatesum-a-large-scale-argument-mining-and","slug":"debatesum-a-large-scale-argument-mining-and","title":"DebateSum: A large-scale argument mining and summarization dataset","date":"2020-11-14","arxiv_id":"2011.07251","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/debatesum-a-large-scale-argument-mining-and#ran","syntology_url":"https://syntology.ai/paper/2011.07251","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.07251"}},"official":{"repos":["Hellisotherpeople/DebateSum","Hellisotherpeople/debate2vec","arvind-balaji/debate-cards"],"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/giantmidi-piano-a-large-scale-midi-dataset","slug":"giantmidi-piano-a-large-scale-midi-dataset","title":"GiantMIDI-Piano: A large-scale MIDI dataset for classical piano music","date":"2020-10-11","arxiv_id":"2010.07061","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/giantmidi-piano-a-large-scale-midi-dataset#ran","syntology_url":"https://syntology.ai/paper/2010.07061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07061"}},"official":{"repos":["bytedance/GiantMIDI-Piano"],"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/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"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/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"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/rank-over-class-the-untapped-potential-of","slug":"rank-over-class-the-untapped-potential-of","title":"Rank over Class: The Untapped Potential of Ranking in Natural Language Processing","date":"2020-09-10","arxiv_id":"2009.05160","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 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) · 0 unverified","sample_list":"/paper/rank-over-class-the-untapped-potential-of#ran","syntology_url":"https://syntology.ai/paper/2009.05160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05160"}},"official":{"repos":["atapour/rank-over-class"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fine-grained-visual-textual-alignment-for","slug":"fine-grained-visual-textual-alignment-for","title":"Fine-grained Visual Textual Alignment for Cross-Modal Retrieval using Transformer Encoders","date":"2020-08-12","arxiv_id":"2008.05231","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":12,"n_pointer_only":2,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 1 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fine-grained-visual-textual-alignment-for#ran","syntology_url":"https://syntology.ai/paper/2008.05231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05231"}},"official":{"repos":["mesnico/TERAN"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mixing-specific-data-augmentation-techniques","slug":"mixing-specific-data-augmentation-techniques","title":"Mixing-Specific Data Augmentation Techniques for Improved Blind Violin/Piano Source Separation","date":"2020-08-06","arxiv_id":"2008.02480","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/mixing-specific-data-augmentation-techniques#ran","syntology_url":"https://syntology.ai/paper/2008.02480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02480"}},"official":{"repos":["SunnyCYC/aug4mss"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-optimal-tree-models-under-beam","slug":"learning-optimal-tree-models-under-beam","title":"Learning Optimal Tree Models Under Beam Search","date":"2020-06-27","arxiv_id":"2006.15408","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 6 unverified","sample_list":"/paper/learning-optimal-tree-models-under-beam#ran","syntology_url":"https://syntology.ai/paper/2006.15408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15408"}},"official":null}},{"url":"/paper/pre-training-via-paraphrasing","slug":"pre-training-via-paraphrasing","title":"Pre-training via Paraphrasing","date":"2020-06-26","arxiv_id":"2006.15020","repositories_listed":2,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":3,"n_honours":3,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pre-training-via-paraphrasing#ran","syntology_url":"https://syntology.ai/paper/2006.15020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15020"}},"official":null}},{"url":"/paper/few-shot-generative-conversational-query","slug":"few-shot-generative-conversational-query","title":"Few-Shot Generative Conversational Query Rewriting","date":"2020-06-09","arxiv_id":"2006.05009","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":1,"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/few-shot-generative-conversational-query#ran","syntology_url":"https://syntology.ai/paper/2006.05009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05009"}},"official":{"repos":["thunlp/ConversationQueryRewriter"],"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","unlocated"]}}},{"url":"/paper/open-retrieval-conversational-question","slug":"open-retrieval-conversational-question","title":"Open-Retrieval Conversational Question Answering","date":"2020-05-22","arxiv_id":"2005.11364","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/open-retrieval-conversational-question#ran","syntology_url":"https://syntology.ai/paper/2005.11364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11364"}},"official":{"repos":["prdwb/orconvqa-release"],"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/a-deep-recurrent-survival-model-for-unbiased","slug":"a-deep-recurrent-survival-model-for-unbiased","title":"A Deep Recurrent Survival Model for Unbiased Ranking","date":"2020-04-30","arxiv_id":"2004.14714","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/a-deep-recurrent-survival-model-for-unbiased#ran","syntology_url":"https://syntology.ai/paper/2004.14714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14714"}},"official":{"repos":["Jinjiarui/DRSR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/colbert-efficient-and-effective-passage","slug":"colbert-efficient-and-effective-passage","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","date":"2020-04-27","arxiv_id":"2004.12832","repositories_listed":9,"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/colbert-efficient-and-effective-passage#ran","syntology_url":"https://syntology.ai/paper/2004.12832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12832"}},"official":{"repos":["stanford-futuredata/ColBERT"],"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/se-kge-a-location-aware-knowledge-graph","slug":"se-kge-a-location-aware-knowledge-graph","title":"SE-KGE: A Location-Aware Knowledge Graph Embedding Model for Geographic Question Answering and Spatial Semantic Lifting","date":"2020-04-25","arxiv_id":"2004.14171","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/se-kge-a-location-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2004.14171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14171"}},"official":null}},{"url":"/paper/transformer-reasoning-network-for-image-text","slug":"transformer-reasoning-network-for-image-text","title":"Transformer Reasoning Network for Image-Text Matching and Retrieval","date":"2020-04-20","arxiv_id":"2004.09144","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":10,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transformer-reasoning-network-for-image-text#ran","syntology_url":"https://syntology.ai/paper/2004.09144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09144"}},"official":{"repos":["mesnico/TERN"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/image-based-table-recognition-data-model-and","slug":"image-based-table-recognition-data-model-and","title":"Image-based table recognition: data, model, and evaluation","date":"2019-11-25","arxiv_id":"1911.10683","repositories_listed":6,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"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, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/image-based-table-recognition-data-model-and#ran","syntology_url":"https://syntology.ai/paper/1911.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10683"}},"official":{"repos":["ibm-aur-nlp/PubTabNet"],"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/sato-contextual-semantic-type-detection-in","slug":"sato-contextual-semantic-type-detection-in","title":"Sato: Contextual Semantic Type Detection in Tables","date":"2019-11-14","arxiv_id":"1911.06311","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sato-contextual-semantic-type-detection-in#ran","syntology_url":"https://syntology.ai/paper/1911.06311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06311"}},"official":{"repos":["megagonlabs/sato"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/contextualized-sparse-representation-with-1","slug":"contextualized-sparse-representation-with-1","title":"Contextualized Sparse Representations for Real-Time Open-Domain Question Answering","date":"2019-11-07","arxiv_id":"1911.02896","repositories_listed":3,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":6,"n_honours":5,"n_violates":2,"n_no_contract":2,"n_pointer_only":7,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 2 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/contextualized-sparse-representation-with-1#ran","syntology_url":"https://syntology.ai/paper/1911.02896","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02896"}},"official":{"repos":["jhyuklee/sparc"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/191013339","slug":"191013339","title":"Scalable Evaluation and Improvement of Document Set Expansion via Neural Positive-Unlabeled Learning","date":"2019-10-29","arxiv_id":"1910.13339","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/191013339#ran","syntology_url":"https://syntology.ai/paper/1910.13339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13339"}},"official":{"repos":["sayaendo/document-set-expansion-pu"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/answering-complex-open-domain-questions","slug":"answering-complex-open-domain-questions","title":"Answering Complex Open-domain Questions Through Iterative Query Generation","date":"2019-10-15","arxiv_id":"1910.07000","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/answering-complex-open-domain-questions#ran","syntology_url":"https://syntology.ai/paper/1910.07000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07000"}},"official":{"repos":["qipeng/golden-retriever"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codesearchnet-challenge-evaluating-the-state","slug":"codesearchnet-challenge-evaluating-the-state","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","date":"2019-09-20","arxiv_id":"1909.09436","repositories_listed":14,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/codesearchnet-challenge-evaluating-the-state#ran","syntology_url":"https://syntology.ai/paper/1909.09436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.09436"}},"official":{"repos":["github/CodeSearchNet"],"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":["listed","official"]}}},{"url":"/paper/revealing-the-importance-of-semantic","slug":"revealing-the-importance-of-semantic","title":"Revealing the Importance of Semantic Retrieval for Machine Reading at Scale","date":"2019-09-17","arxiv_id":"1909.08041","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":2,"n_honours":4,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/revealing-the-importance-of-semantic#ran","syntology_url":"https://syntology.ai/paper/1909.08041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08041"}},"official":{"repos":["easonnie/semanticRetrievalMRS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/interactive-machine-comprehension-with","slug":"interactive-machine-comprehension-with","title":"Interactive Machine Comprehension with Information Seeking Agents","date":"2019-08-27","arxiv_id":"1908.10449","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"6 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interactive-machine-comprehension-with#ran","syntology_url":"https://syntology.ai/paper/1908.10449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10449"}},"official":{"repos":["xingdi-eric-yuan/imrc_public"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-translate-edit-model-for-natural-language","slug":"a-translate-edit-model-for-natural-language","title":"Text-to-SQL Generation for Question Answering on Electronic Medical Records","date":"2019-07-28","arxiv_id":"1908.01839","repositories_listed":1,"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":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) · 0 unverified","sample_list":"/paper/a-translate-edit-model-for-natural-language#ran","syntology_url":"https://syntology.ai/paper/1908.01839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.01839"}},"official":{"repos":["wangpinggl/TREQS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-complex-basis-functions-for","slug":"learning-complex-basis-functions-for","title":"Learning Complex Basis Functions for Invariant Representations of Audio","date":"2019-07-13","arxiv_id":"1907.05982","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/learning-complex-basis-functions-for#ran","syntology_url":"https://syntology.ai/paper/1907.05982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05982"}},"official":{"repos":["SonyCSLParis/cae-invar"],"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/reqa-an-evaluation-for-end-to-end-answer","slug":"reqa-an-evaluation-for-end-to-end-answer","title":"ReQA: An Evaluation for End-to-End Answer Retrieval Models","date":"2019-07-10","arxiv_id":"1907.04780","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/reqa-an-evaluation-for-end-to-end-answer#ran","syntology_url":"https://syntology.ai/paper/1907.04780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04780"}},"official":{"repos":["google/retrieval-qa-eval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-arabic-question-answering","slug":"neural-arabic-question-answering","title":"Neural Arabic Question Answering","date":"2019-06-12","arxiv_id":"1906.05394","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-arabic-question-answering#ran","syntology_url":"https://syntology.ai/paper/1906.05394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05394"}},"official":{"repos":["husseinmozannar/SOQAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/compositional-questions-do-not-necessitate","slug":"compositional-questions-do-not-necessitate","title":"Compositional Questions Do Not Necessitate Multi-hop Reasoning","date":"2019-06-07","arxiv_id":"1906.02900","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-questions-do-not-necessitate#ran","syntology_url":"https://syntology.ai/paper/1906.02900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02900"}},"official":{"repos":["shmsw25/single-hop-rc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-use-of-arxiv-as-a-dataset","slug":"on-the-use-of-arxiv-as-a-dataset","title":"On the Use of ArXiv as a Dataset","date":"2019-04-30","arxiv_id":"1905.00075","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-use-of-arxiv-as-a-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00075"}},"official":{"repos":["mattbierbaum/arxiv-public-datasets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-interest-network-with-dynamic-routing","slug":"multi-interest-network-with-dynamic-routing","title":"Multi-Interest Network with Dynamic Routing for Recommendation at Tmall","date":"2019-04-17","arxiv_id":"1904.08030","repositories_listed":6,"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":0,"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/multi-interest-network-with-dynamic-routing#ran","syntology_url":"https://syntology.ai/paper/1904.08030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08030"}},"official":null}},{"url":"/paper/bidirectional-attentive-memory-networks-for","slug":"bidirectional-attentive-memory-networks-for","title":"Bidirectional Attentive Memory Networks for Question Answering over Knowledge Bases","date":"2019-03-06","arxiv_id":"1903.02188","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bidirectional-attentive-memory-networks-for#ran","syntology_url":"https://syntology.ai/paper/1903.02188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02188"}},"official":{"repos":["hugochan/BAMnet"],"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":["listed","official"]}}},{"url":"/paper/elki-a-large-open-source-library-for-data","slug":"elki-a-large-open-source-library-for-data","title":"ELKI: A large open-source library for data analysis - ELKI Release 0.7.5 \"Heidelberg\"","date":"2019-02-10","arxiv_id":"1902.03616","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/elki-a-large-open-source-library-for-data#ran","syntology_url":"https://syntology.ai/paper/1902.03616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03616"}},"official":{"repos":["elki-project/elki"],"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/end-to-end-open-domain-question-answering","slug":"end-to-end-open-domain-question-answering","title":"End-to-End Open-Domain Question Answering with BERTserini","date":"2019-02-05","arxiv_id":"1902.01718","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-open-domain-question-answering#ran","syntology_url":"https://syntology.ai/paper/1902.01718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01718"}},"official":{"repos":["rsvp-ai/bertserini"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transfertransfo-a-transfer-learning-approach","slug":"transfertransfo-a-transfer-learning-approach","title":"TransferTransfo: A Transfer Learning Approach for Neural Network Based Conversational Agents","date":"2019-01-23","arxiv_id":"1901.08149","repositories_listed":23,"syntology":{"n":26,"n_ran":18,"n_constructed":0,"n_ran_checked":11,"n_instrument":7,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":7,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 7 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/transfertransfo-a-transfer-learning-approach#ran","syntology_url":"https://syntology.ai/paper/1901.08149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08149"}},"official":null}},{"url":"/paper/nprf-a-neural-pseudo-relevance-feedback","slug":"nprf-a-neural-pseudo-relevance-feedback","title":"NPRF: A Neural Pseudo Relevance Feedback Framework for Ad-hoc Information Retrieval","date":"2018-10-30","arxiv_id":"1810.12936","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/nprf-a-neural-pseudo-relevance-feedback#ran","syntology_url":"https://syntology.ai/paper/1810.12936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.12936"}},"official":{"repos":["ucasir/NPRF"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/texttovec-deep-contextualized-neural","slug":"texttovec-deep-contextualized-neural","title":"textTOvec: Deep Contextualized Neural Autoregressive Topic Models of Language with Distributed Compositional Prior","date":"2018-10-09","arxiv_id":"1810.03947","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/texttovec-deep-contextualized-neural#ran","syntology_url":"https://syntology.ai/paper/1810.03947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03947"}},"official":{"repos":["pgcool/textTOvec"],"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/skeleton-to-response-dialogue-generation","slug":"skeleton-to-response-dialogue-generation","title":"Skeleton-to-Response: Dialogue Generation Guided by Retrieval Memory","date":"2018-09-14","arxiv_id":"1809.05296","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/skeleton-to-response-dialogue-generation#ran","syntology_url":"https://syntology.ai/paper/1809.05296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.05296"}},"official":{"repos":["jcyk/skeleton-to-response"],"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/deep-randomized-ensembles-for-metric-learning","slug":"deep-randomized-ensembles-for-metric-learning","title":"Deep Randomized Ensembles for Metric Learning","date":"2018-08-13","arxiv_id":"1808.04469","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-randomized-ensembles-for-metric-learning#ran","syntology_url":"https://syntology.ai/paper/1808.04469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04469"}},"official":{"repos":["littleredxh/DREML"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/crepe-a-convolutional-representation-for","slug":"crepe-a-convolutional-representation-for","title":"CREPE: A Convolutional Representation for Pitch Estimation","date":"2018-02-17","arxiv_id":"1802.06182","repositories_listed":2,"syntology":{"n":23,"n_ran":20,"n_constructed":0,"n_ran_checked":18,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":17,"n_pointer_only":0,"phrase":"20 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/crepe-a-convolutional-representation-for#ran","syntology_url":"https://syntology.ai/paper/1802.06182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06182"}},"official":{"repos":["marl/crepe"],"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":["listed","official"]}}},{"url":"/paper/irgan-a-minimax-game-for-unifying-generative","slug":"irgan-a-minimax-game-for-unifying-generative","title":"IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models","date":"2017-05-30","arxiv_id":"1705.10513","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/irgan-a-minimax-game-for-unifying-generative#ran","syntology_url":"https://syntology.ai/paper/1705.10513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.10513"}},"official":{"repos":["geek-ai/irgan"],"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/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}},"official":{"repos":["tkipf/relational-gcn"],"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":["listed","official","unlocated"]}}},{"url":"/paper/deep-metric-learning-using-triplet-network","slug":"deep-metric-learning-using-triplet-network","title":"Deep metric learning using Triplet network","date":"2014-12-20","arxiv_id":"1412.6622","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/deep-metric-learning-using-triplet-network#ran","syntology_url":"https://syntology.ai/paper/1412.6622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6622"}},"official":null}}],"record_sha256":"0e49933e9afd437ee7ebd4843113f6e6a9e88732939052a5978c68858b90f6fd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}