{"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/wikigraphs-a-wikipedia-text-knowledge-graph","title":"WikiGraphs: A Wikipedia Text - Knowledge Graph Paired Dataset","arxiv_id":"2107.09556","date":"2021-07-20","proceeding":"NAACL (TextGraphs) 2021 6","authors":["Luyu Wang","Yujia Li","Ozlem Aslan","Oriol Vinyals"],"abstract":"We present a new dataset of Wikipedia articles each paired with a knowledge graph, to facilitate the research in conditional text generation, graph generation and graph representation learning. Existing graph-text paired datasets typically contain small graphs and short text (1 or few sentences), thus limiting the capabilities of the models that can be learned on the data. Our new dataset WikiGraphs is collected by pairing each Wikipedia article from the established WikiText-103 benchmark (Merity et al., 2016) with a subgraph from the Freebase knowledge graph (Bollacker et al., 2008). This makes it easy to benchmark against other state-of-the-art text generative models that are capable of generating long paragraphs of coherent text. Both the graphs and the text data are of significantly larger scale compared to prior graph-text paired datasets. We present baseline graph neural network and transformer model results on our dataset for 3 tasks: graph -> text generation, graph -> text retrieval and text -> graph retrieval. We show that better conditioning on the graph provides gains in generation and retrieval quality but there is still large room for improvement.","url_abs":"https://arxiv.org/abs/2107.09556v1","url_pdf":"https://arxiv.org/pdf/2107.09556v1.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":"wikigraphs-a-wikipedia-text-knowledge-graph","repo_url":"https://github.com/deepmind/deepmind-research/tree/master/wikigraphs","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"jax","reach":null}],"tasks":[{"task_slug":"articles","task_name":"Articles"},{"task_slug":"conditional-text-generation","task_name":"Conditional Text Generation"},{"task_slug":"graph-generation","task_name":"Graph Generation"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"kg-to-text","task_name":"KG-to-Text Generation"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"text-generation","task_name":"Text Generation"},{"task_slug":"text-retrieval","task_name":"Text Retrieval"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[{"slug":"wikigraphs","name":"WikiGraphs","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/kg-to-text-generation-on-wikigraphs","task":"KG-to-Text Generation","dataset":"WikiGraphs","model":"Unconditional","rank_in_archive_order":1,"of":4,"metrics":{"Test perplexity":"25.85","rBLEU (Test)":"9.98","rBLEU (Valid)":"10.97","rBLEU(w/title)(Test)":"24.07","rBLEU(w/title)(Valid)":"27.98"},"uses_additional_data":false},{"leaderboard":"/sota/kg-to-text-generation-on-wikigraphs","task":"KG-to-Text Generation","dataset":"WikiGraphs","model":"BoW","rank_in_archive_order":2,"of":4,"metrics":{"Test perplexity":"26.65","rBLEU (Test)":"24.41","rBLEU (Valid)":"29.53","rBLEU(w/title)(Test)":"27.39","rBLEU(w/title)(Valid)":"32.41"},"uses_additional_data":false},{"leaderboard":"/sota/kg-to-text-generation-on-wikigraphs","task":"KG-to-Text Generation","dataset":"WikiGraphs","model":"GNN","rank_in_archive_order":3,"of":4,"metrics":{"Test perplexity":"26.93","rBLEU (Test)":"26.22","rBLEU (Valid)":"31.39","rBLEU(w/title)(Test)":"28.35","rBLEU(w/title)(Valid)":"32.65"},"uses_additional_data":false},{"leaderboard":"/sota/kg-to-text-generation-on-wikigraphs","task":"KG-to-Text Generation","dataset":"WikiGraphs","model":"Nodes","rank_in_archive_order":4,"of":4,"metrics":{"Test perplexity":"27.4","rBLEU (Test)":"25.31","rBLEU (Valid)":"30.51","rBLEU(w/title)(Test)":"27.43","rBLEU(w/title)(Valid)":"32.60"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2107.09556","atlas_url":"https://app.syntology.ai/?focus=2107.09556","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":"2107.09556"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2107.09556\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2107.09556"},"call":"get_concepts_for_paper(arxiv_id=\"2107.09556\")"}],"by_repo":[{"repo":"deepmind/deepmind-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["2006.12982","2101.08692","2103.03206","2105.14039"],"harvested_for_calls":[{"arxiv_id":"2006.12982","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.12982"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.12982\")"},{"arxiv_id":"2101.08692","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2101.08692"},"call":"get_harvested_code_for_paper(arxiv_id=\"2101.08692\")"},{"arxiv_id":"2103.03206","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.03206"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.03206\")"},{"arxiv_id":"2105.14039","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14039"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14039\")"}]}],"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":"57700086d7568aaef037ccf0314ee8f44b65ee31965c78851d721e765202ae29","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}