{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:32:57Z","timestamp":1773246777677,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T00:00:00Z","timestamp":1660435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,14]]},"DOI":"10.1145\/3534678.3539203","type":"proceedings-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:06:12Z","timestamp":1660331172000},"page":"3691-3701","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["GraphWorld"],"prefix":"10.1145","author":[{"given":"John","family":"Palowitch","sequence":"first","affiliation":[{"name":"Google Research, San Francisco, CA, USA"}]},{"given":"Anton","family":"Tsitsulin","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}]},{"given":"Brandon","family":"Mayer","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}]},{"given":"Bryan","family":"Perozzi","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2021. Tensorflow GNN. https:\/\/github.com\/tensorflow\/gnn."},{"key":"e_1_3_2_2_2_1","volume-title":"Community detection and stochastic block models: recent developments. JMLR","author":"Abbe Emmanuel","year":"2017","unstructured":"Emmanuel Abbe. 2017. Community detection and stochastic block models: recent developments. JMLR (2017)."},{"key":"e_1_3_2_2_3_1","volume-title":"Friends and neighbors on the web. Social networks","author":"Adamic Lada A","year":"2003","unstructured":"Lada A Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Social networks (2003)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"e_1_3_2_2_5_1","volume-title":"The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems","author":"Brin Sergey","year":"1998","unstructured":"Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems (1998)."},{"key":"e_1_3_2_2_6_1","volume-title":"Gnn-film: Graph neural networks with feature-wise linear modulation. In ICML. PMLR.","author":"Brockschmidt Marc","year":"2020","unstructured":"Marc Brockschmidt. 2020. Gnn-film: Graph neural networks with feature-wise linear modulation. In ICML. PMLR."},{"key":"e_1_3_2_2_7_1","volume-title":"How Attentive are Graph Attention Networks? arXiv preprint arXiv:2105.14491","author":"Brody Shaked","year":"2021","unstructured":"Shaked Brody, Uri Alon, and Eran Yahav. 2021. How Attentive are Graph Attention Networks? arXiv preprint arXiv:2105.14491 (2021)."},{"key":"e_1_3_2_2_8_1","volume-title":"Machine learning on graphs: A model and comprehensive taxonomy. arXiv preprint arXiv:2005.03675","author":"Chami Ines","year":"2020","unstructured":"Ines Chami, Sami Abu-El-Haija, Bryan Perozzi, Christopher R\u00e9, and Kevin Murphy. 2020. Machine learning on graphs: A model and comprehensive taxonomy. arXiv preprint arXiv:2005.03675 (2020)."},{"key":"e_1_3_2_2_9_1","volume-title":"Can graph neural networks count substructures? arXiv preprint arXiv:2002.04025","author":"Chen Zhengdao","year":"2020","unstructured":"Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna. 2020. Can graph neural networks count substructures? arXiv preprint arXiv:2002.04025 (2020)."},{"key":"e_1_3_2_2_10_1","unstructured":"Karl Cobbe Chris Hesse Jacob Hilton and John Schulman. 2020. Leveraging procedural generation to benchmark reinforcement learning. In ICML."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Maurizio Ferrari Dacrema Paolo Cremonesi and Dietmar Jannach. 2019. Are we really making much progress? A worrying analysis of recent neural recommendation approaches. In RecSys.","DOI":"10.1145\/3298689.3347058"},{"key":"e_1_3_2_2_12_1","volume-title":"Measures of the amount of ecologic association between species. Ecology","author":"Dice Lee R","year":"1945","unstructured":"Lee R Dice. 1945. Measures of the amount of ecologic association between species. Ecology (1945)."},{"key":"e_1_3_2_2_13_1","volume-title":"Benchmarking graph neural networks. arXiv preprint arXiv:2003.00982","author":"Dwivedi Vijay Prakash","year":"2020","unstructured":"Vijay Prakash Dwivedi, Chaitanya K Joshi, Thomas Laurent, Yoshua Bengio, and Xavier Bresson. 2020. Benchmarking graph neural networks. arXiv preprint arXiv:2003.00982 (2020)."},{"key":"e_1_3_2_2_14_1","unstructured":"Federico Errica Marco Podda Davide Bacciu and Alessio Micheli. 2020. A fair comparison of graph neural networks for graph classification. In ICLR."},{"key":"e_1_3_2_2_15_1","volume-title":"Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds.","author":"Fey Matthias","unstructured":"Matthias Fey and Jan E. Lenssen. 2019. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_17_1","unstructured":"William L Hamilton Rex Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS."},{"key":"e_1_3_2_2_18_1","unstructured":"Weihua Hu Matthias Fey Marinka Zitnik Yuxiao Dong Hongyu Ren Bowen Liu Michele Catasta and Jure Leskovec. 2020. Open Graph Benchmark: Datasets for machine learning on graphs. In NeurIPS."},{"key":"e_1_3_2_2_19_1","volume-title":"The distribution of the flora in the alpine zone. New Phytologist","author":"Jaccard Paul","year":"1912","unstructured":"Paul Jaccard. 1912. The distribution of the flora in the alpine zone. New Phytologist (1912)."},{"key":"e_1_3_2_2_20_1","volume-title":"Stochastic blockmodels and community structure in networks. Physical review E 83, 1","author":"Karrer Brian","year":"2011","unstructured":"Brian Karrer and Mark EJ Newman. 2011. Stochastic blockmodels and community structure in networks. Physical review E 83, 1 (2011), 016107."},{"key":"e_1_3_2_2_21_1","volume-title":"A comparative study for unsupervised network representation learning. TKDE","author":"Khosla Megha","year":"2019","unstructured":"Megha Khosla, Vinay Setty, and Avishek Anand. 2019. A comparative study for unsupervised network representation learning. TKDE (2019)."},{"key":"e_1_3_2_2_22_1","unstructured":"Dongkwan Kim and Alice Oh. 2021. How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision. In ICLR."},{"key":"e_1_3_2_2_23_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and MaxWelling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_24_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997","author":"Klicpera Johannes","year":"2018","unstructured":"Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_2_25_1","volume-title":"Marvin Zhang, Akshay Balsubramani, Weihua Hu, Michihiro Yasunaga, Richard Lanas Phillips, Irena Gao, Tony Lee, et al.","author":"Koh Pang Wei","year":"2021","unstructured":"Pang Wei Koh, Shiori Sagawa, Sang Michael Xie, Marvin Zhang, Akshay Balsubramani, Weihua Hu, Michihiro Yasunaga, Richard Lanas Phillips, Irena Gao, Tony Lee, et al. 2021. Wilds: A benchmark of in-the-wild distribution shifts. In ICML."},{"key":"e_1_3_2_2_26_1","volume-title":"Vertex similarity in networks. Physical Review E","author":"Leicht Elizabeth A","year":"2006","unstructured":"Elizabeth A Leicht, Petter Holme, and Mark EJ Newman. 2006. Vertex similarity in networks. Physical Review E (2006)."},{"key":"e_1_3_2_2_27_1","volume-title":"DEEPERBIGGERBETTER for OGB-LSC at KDD cup","author":"Li Guohao","year":"2021","unstructured":"Guohao Li, Jesus Zarzar, Hesham Mostafa, Sohil Shah, Marcel Nassar, Daniel Cummings, Sami Abu-El-Haija, Bernard Ghanem, and Matthias M\u00fcller. 2021. DEEPERBIGGERBETTER for OGB-LSC at KDD cup 2021. (2021)."},{"key":"e_1_3_2_2_28_1","volume-title":"Troubling trends in machine learning scholarship. arXiv preprint arXiv:1807.03341","author":"Lipton Zachary C","year":"2018","unstructured":"Zachary C Lipton and Jacob Steinhardt. 2018. Troubling trends in machine learning scholarship. arXiv preprint arXiv:1807.03341 (2018)."},{"key":"e_1_3_2_2_29_1","volume-title":"On graph classification networks, datasets and baselines. arXiv preprint arXiv:1905.04682","author":"Luzhnica Enxhell","year":"2019","unstructured":"Enxhell Luzhnica, Ben Day, and Pietro Li\u00f2. 2019. On graph classification networks, datasets and baselines. arXiv preprint arXiv:1905.04682 (2019)."},{"key":"e_1_3_2_2_30_1","volume-title":"Reproducible Evaluations of Network Representation Learning Models Using EvalNE. WWW'21","author":"Mara Alexandru","year":"2021","unstructured":"Alexandru Mara, Jefrey Lijffijt, and Tijl de Bie. 2021. Reproducible Evaluations of Network Representation Learning Models Using EvalNE. WWW'21, Workshop on Graph Learning Benchmarks (2021)."},{"key":"e_1_3_2_2_31_1","volume-title":"Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663","author":"Morris Christopher","year":"2020","unstructured":"Christopher Morris, Nils M Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann. 2020. Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663 (2020)."},{"key":"e_1_3_2_2_32_1","volume-title":"Adversarial NLI: A new benchmark for natural language understanding. arXiv preprint arXiv:1910.14599","author":"Nie Yixin","year":"2019","unstructured":"Yixin Nie, Adina Williams, Emily Dinan, Mohit Bansal, JasonWeston, and Douwe Kiela. 2019. Adversarial NLI: A new benchmark for natural language understanding. arXiv preprint arXiv:1910.14599 (2019)."},{"key":"e_1_3_2_2_33_1","volume-title":"Dale A Mongru, Zolt\u00e1n N Oltvai, and A-L Barab\u00e1si.","author":"Ravasz Erzs\u00e9bet","year":"2002","unstructured":"Erzs\u00e9bet Ravasz, Anna Lisa Somera, Dale A Mongru, Zolt\u00e1n N Oltvai, and A-L Barab\u00e1si. 2002. Hierarchical organization of modularity in metabolic networks. Science (2002)."},{"key":"e_1_3_2_2_34_1","volume-title":"Do cifar-10 classifiers generalize to cifar-10? arXiv preprint arXiv:1806.00451","author":"Recht Benjamin","year":"2018","unstructured":"Benjamin Recht, Rebecca Roelofs, Ludwig Schmidt, and Vaishaal Shankar. 2018. Do cifar-10 classifiers generalize to cifar-10? arXiv preprint arXiv:1806.00451 (2018)."},{"key":"e_1_3_2_2_35_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. https: \/\/networkrepository.com"},{"key":"e_1_3_2_2_36_1","volume-title":"WWW'21","author":"Shah Neil","year":"2020","unstructured":"Neil Shah. 2020. Scale-Free, Attributed and Class-Assortative Graph Generation to Facilitate Introspection of Graph Neural Networks. WWW'21, Workshop on Graph Learning Benchmarks (2020)."},{"key":"e_1_3_2_2_37_1","volume-title":"Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018)."},{"key":"e_1_3_2_2_38_1","unstructured":"Yunsheng Shi Zhengjie Huang Shikun Feng Hui Zhong Wenjin Wang and Yu Sun. 2021. Masked label prediction: Unified message passing model for semisupervised classification. (2021)."},{"key":"e_1_3_2_2_39_1","volume-title":"Alfred: A benchmark for interpreting grounded instructions for everyday tasks. In CVPR.","author":"Shridhar Mohit","year":"2020","unstructured":"Mohit Shridhar, Jesse Thomason, Daniel Gordon, Yonatan Bisk, Winson Han, Roozbeh Mottaghi, Luke Zettlemoyer, and Dieter Fox. 2020. Alfred: A benchmark for interpreting grounded instructions for everyday tasks. In CVPR."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"George W Snedecor. 1957. Statistical methods.","DOI":"10.1097\/00010694-195702000-00023"},{"key":"e_1_3_2_2_41_1","unstructured":"Th A S\u00f8rensen. 1948. A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons. Biol. Skar. (1948)."},{"key":"e_1_3_2_2_42_1","volume-title":"Who belongs in the family? Psychometrika","author":"Thorndike Robert L","year":"1953","unstructured":"Robert L Thorndike. 1953. Who belongs in the family? Psychometrika (1953)."},{"key":"e_1_3_2_2_43_1","volume-title":"Graph clustering with graph neural networks. arXiv preprint arXiv:2006.16904","author":"Tsitsulin Anton","year":"2020","unstructured":"Anton Tsitsulin, John Palowitch, Bryan Perozzi, and Emmanuel M\u00fcller. 2020. Graph clustering with graph neural networks. arXiv preprint arXiv:2006.16904 (2020)."},{"key":"e_1_3_2_2_44_1","volume-title":"WWW'21","author":"Tsitsulin Anton","year":"2021","unstructured":"Anton Tsitsulin, Benedek Rozemberczki, John Palowitch, and Bryan Perozzi. 2021. Synthetic Graph Generation to Benchmark Graph Learning. WWW'21,Workshop on Graph Learning Benchmarks (2021)."},{"key":"e_1_3_2_2_45_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Velickovic Petar","year":"2017","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_46_1","volume-title":"Break it down: A question understanding benchmark. ACL","author":"Wolfson Tomer","year":"2020","unstructured":"Tomer Wolfson, Mor Geva, Ankit Gupta, Matt Gardner, Yoav Goldberg, Daniel Deutch, and Jonathan Berant. 2020. Break it down: A question understanding benchmark. ACL (2020)."},{"key":"e_1_3_2_2_47_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML. PMLR."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_2_49_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu,Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_2_50_1","unstructured":"Jiaxuan You Zhitao Ying and Jure Leskovec. 2020. Design space for graph neural networks. In NeurIPS."},{"key":"e_1_3_2_2_51_1","volume-title":"A pipeline for fair comparison of graph neural networks in node classification tasks. arXiv preprint arXiv:2012.10619","author":"Zhao Wentao","year":"2020","unstructured":"Wentao Zhao, Dalin Zhou, Xinguo Qiu, and Wei Jiang. 2020. A pipeline for fair comparison of graph neural networks in node classification tasks. arXiv preprint arXiv:2012.10619 (2020)."},{"key":"e_1_3_2_2_52_1","volume-title":"Predicting missing links via local information. The European Physical Journal B","author":"Zhou Tao","year":"2009","unstructured":"Tao Zhou, Linyuan L\u00fc, and Yi-Cheng Zhang. 2009. Predicting missing links via local information. The European Physical Journal B (2009)."},{"key":"e_1_3_2_2_53_1","volume-title":"Beyond homophily in graph neural networks: Current limitations and effective designs. arXiv preprint arXiv:2006.11468","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020. Beyond homophily in graph neural networks: Current limitations and effective designs. arXiv preprint arXiv:2006.11468 (2020)."}],"event":{"name":"KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Washington DC USA","acronym":"KDD '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534678.3539203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:59:58Z","timestamp":1750186798000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539203"}},"subtitle":["Fake Graphs Bring Real Insights for GNNs"],"short-title":[],"issued":{"date-parts":[[2022,8,14]]},"references-count":53,"alternative-id":["10.1145\/3534678.3539203","10.1145\/3534678"],"URL":"https:\/\/doi.org\/10.1145\/3534678.3539203","relation":{},"subject":[],"published":{"date-parts":[[2022,8,14]]},"assertion":[{"value":"2022-08-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}