{"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/a-graph-structured-dataset-for-wikipedia","title":"A Graph-structured Dataset for Wikipedia Research","arxiv_id":"1903.08597","date":"2019-03-20","proceeding":null,"authors":["Nicolas Aspert","Volodymyr Miz","Benjamin Ricaud","Pierre Vandergheynst"],"abstract":"Wikipedia is a rich and invaluable source of information. Its central place\non the Web makes it a particularly interesting object of study for scientists.\nResearchers from different domains used various complex datasets related to\nWikipedia to study language, social behavior, knowledge organization, and\nnetwork theory. While being a scientific treasure, the large size of the\ndataset hinders pre-processing and may be a challenging obstacle for potential\nnew studies. This issue is particularly acute in scientific domains where\nresearchers may not be technically and data processing savvy. On one hand, the\nsize of Wikipedia dumps is large. It makes the parsing and extraction of\nrelevant information cumbersome. On the other hand, the API is straightforward\nto use but restricted to a relatively small number of requests. The middle\nground is at the mesoscopic scale when researchers need a subset of Wikipedia\nranging from thousands to hundreds of thousands of pages but there exists no\nefficient solution at this scale.\n  In this work, we propose an efficient data structure to make requests and\naccess subnetworks of Wikipedia pages and categories. We provide convenient\ntools for accessing and filtering viewership statistics or \"pagecounts\" of\nWikipedia web pages. The dataset organization leverages principles of graph\ndatabases that allows rapid and intuitive access to subgraphs of Wikipedia\narticles and categories. The dataset and deployment guidelines are available on\nthe LTS2 website \\url{https://lts2.epfl.ch/Datasets/Wikipedia/}.","url_abs":"http://arxiv.org/abs/1903.08597v1","url_pdf":"http://arxiv.org/pdf/1903.08597v1.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":"a-graph-structured-dataset-for-wikipedia","repo_url":"https://github.com/epfl-lts2/sparkwiki","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"articles","task_name":"Articles"}],"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":"epfl-lts2/sparkwiki","kind":"official","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":"c1000929f8ab211b947384c4a716bbf031f9ec8017e0f9138da0e5b7a4005c12","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}