{"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/studying-the-wikipedia-hyperlink-graph-for","title":"Studying the Wikipedia Hyperlink Graph for Relatedness and Disambiguation","arxiv_id":"1503.01655","date":"2015-03-05","proceeding":null,"authors":["Eneko Agirre","Ander Barrena","Aitor Soroa"],"abstract":"Hyperlinks and other relations in Wikipedia are a extraordinary resource\nwhich is still not fully understood. In this paper we study the different types\nof links in Wikipedia, and contrast the use of the full graph with respect to\njust direct links. We apply a well-known random walk algorithm on two tasks,\nword relatedness and named-entity disambiguation. We show that using the full\ngraph is more effective than just direct links by a large margin, that\nnon-reciprocal links harm performance, and that there is no benefit from\ncategories and infoboxes, with coherent results on both tasks. We set new\nstate-of-the-art figures for systems based on Wikipedia links, comparable to\nsystems exploiting several information sources and/or supervised machine\nlearning. Our approach is open source, with instruction to reproduce results,\nand amenable to be integrated with complementary text-based methods.","url_abs":"http://arxiv.org/abs/1503.01655v2","url_pdf":"http://arxiv.org/pdf/1503.01655v2.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":"studying-the-wikipedia-hyperlink-graph-for","repo_url":"https://github.com/asoroa/ukb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"entity-disambiguation","task_name":"Entity Disambiguation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"asoroa/ukb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"5c001f324be163de933e52f4581a0f84158f03837feb5f8653bc1963d48843b8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}