{"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":"/paper/13062597","title":"Introducing LETOR 4.0 Datasets","arxiv_id":"1306.2597","date":"2013-06-09","proceeding":null,"authors":["Tao Qin","Tie-Yan Liu"],"abstract":"LETOR is a package of benchmark data sets for research on LEarning TO Rank,\nwhich contains standard features, relevance judgments, data partitioning,\nevaluation tools, and several baselines. Version 1.0 was released in April\n2007. Version 2.0 was released in Dec. 2007. Version 3.0 was released in Dec.\n2008. This version, 4.0, was released in July 2009. Very different from\nprevious versions (V3.0 is an update based on V2.0 and V2.0 is an update based\non V1.0), LETOR4.0 is a totally new release. It uses the Gov2 web page\ncollection (~25M pages) and two query sets from Million Query track of TREC\n2007 and TREC 2008. We call the two query sets MQ2007 and MQ2008 for short.\nThere are about 1700 queries in MQ2007 with labeled documents and about 800\nqueries in MQ2008 with labeled documents. If you have any questions or\nsuggestions about the datasets, please kindly email us (letor@microsoft.com).\nOur goal is to make the dataset reliable and useful for the community.","url_abs":"http://arxiv.org/abs/1306.2597v1","url_pdf":"http://arxiv.org/pdf/1306.2597v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"13062597","repo_url":"https://github.com/kiwicom/catboost-cxx","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"13062597","repo_url":"https://github.com/sajari/mlg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"13062597","repo_url":"https://github.com/wildltr/ptranking","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"}],"methods":[],"datasets_introduced":[{"slug":"mq2007","name":"MQ2007","full_name":""},{"slug":"mq2008","name":"MQ2008","full_name":""},{"slug":"mslr-web30k","name":"MSLR WEB30K","full_name":"Microsoft Learning to Rank Datasets-30k"},{"slug":"mslr-web10k","name":"MSLR-WEB10K","full_name":""},{"slug":"mslr-web30k-1","name":"MSLR-WEB30K","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1306.2597","atlas_url":"https://app.syntology.ai/?focus=1306.2597","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1306.2597"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1306.2597\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1306.2597"},"call":"get_concepts_for_paper(arxiv_id=\"1306.2597\")"}],"by_repo":[{"repo":"kiwicom/catboost-cxx","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sajari/mlg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"wildltr/ptranking","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2008.13368"],"harvested_for_calls":[{"arxiv_id":"2008.13368","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2008.13368"},"call":"get_harvested_code_for_paper(arxiv_id=\"2008.13368\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d7156d7ff2ec9480df6e11ccba5906b6fe0a28731c30361054900cf676ec90da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}