{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T05:53:04Z","timestamp":1655704384108},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T00:00:00Z","timestamp":1646697600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US NSF","award":["1652492"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441817","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:36:17Z","timestamp":1615005377000},"source":"Crossref","is-referenced-by-count":1,"title":["Joint Subgraph-to-Subgraph Transitions: Generalizing Triadic Closure for Powerful and Interpretable Graph Modeling"],"prefix":"10.1145","author":[{"given":"Justus Isaiah","family":"Hibshman","sequence":"first","affiliation":[{"name":"University of Notre Dame, Notre Dame, IN, USA"}]},{"given":"Daniel","family":"Gonzalez","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, IN, USA"}]},{"given":"Satyaki","family":"Sikdar","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, IN, USA"}]},{"given":"Tim","family":"Weninger","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 412--429","author":"AbuOda Ghadeer","year":"2019","unstructured":"Ghadeer AbuOda , Gianmarco De Francisci Morales , and Ashraf Aboulnaga . 2019 . Link prediction via higher-order motif features . In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 412--429 . Ghadeer AbuOda, Gianmarco De Francisci Morales, and Ashraf Aboulnaga. 2019. Link prediction via higher-order motif features. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 412--429."},{"key":"e_1_3_2_1_2_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 , Vol. 25 , 3 ( 2003 ), 211--230. Lada A Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Social networks, Vol. 25, 3 (2003), 211--230."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"e_1_3_2_1_4_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. science , Vol. 286 , 5439 ( 1999 ), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9686-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.042806"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143874"},{"key":"e_1_3_2_1_8_1","volume-title":"Social networks","author":"Granovetter Mark S","unstructured":"Mark S Granovetter . 1977. The strength of weak ties . In Social networks . Elsevier , 347--367. Mark S Granovetter. 1977. The strength of weak ties. In Social networks. Elsevier, 347--367."},{"key":"e_1_3_2_1_9_1","volume-title":"G.","author":"Grohe Martin","year":"2017","unstructured":"Martin Grohe , Kristian Kersting , Martin Mladenov , and Pascal Schweitzer . 2017. Color refinement and its applications. Van den Broeck , G. ; Kersting, K .; Natarajan, S ( 2017 ), 30. Martin Grohe, Kristian Kersting, Martin Mladenov, and Pascal Schweitzer. 2017. Color refinement and its applications. Van den Broeck, G.; Kersting, K.; Natarajan, S (2017), 30."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/PASSAT\/SocialCom.2011.15"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the Mining and Learning on Graphs workshop .","author":"Kasat Hemant","year":"2019","unstructured":"Hemant Kasat , Sanket Markan , Manish Gupta , and Vikram Pudi . 2019 . Temporal Link Prediction in Dynamic Networks . In Proceedings of the Mining and Learning on Graphs workshop . Hemant Kasat, Sanket Markan, Manish Gupta, and Vikram Pudi. 2019. Temporal Link Prediction in Dynamic Networks. In Proceedings of the Mining and Learning on Graphs workshop ."},{"key":"e_1_3_2_1_13_1","volume-title":"Variational Graph Auto-Encoders. NIPS Workshop on Bayesian Deep Learning","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016 . Variational Graph Auto-Encoders. NIPS Workshop on Bayesian Deep Learning (2016). Thomas N Kipf and Max Welling. 2016. Variational Graph Auto-Encoders. NIPS Workshop on Bayesian Deep Learning (2016)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/15\/6\/063008"},{"key":"e_1_3_2_1_15_1","volume-title":"On automorphisms of certain classes of graphs. Avtomatika i Telemehanika","author":"Leman AA","year":"1970","unstructured":"AA Leman . 1970. On automorphisms of certain classes of graphs. Avtomatika i Telemehanika , Vol. 2 ( 1970 ), 75--82. AA Leman. 1970. On automorphisms of certain classes of graphs. Avtomatika i Telemehanika, Vol. 2 (1970), 75--82."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_3_2_1_17_1","volume-title":"Limitations, Evaluation. arXiv preprint arXiv:2005.11817","author":"Liu Penghang","year":"2020","unstructured":"Penghang Liu , Valerio Guarrasi , and A Erdem Sariy\u00fcce . 2020. Temporal Network Motifs: Models , Limitations, Evaluation. arXiv preprint arXiv:2005.11817 ( 2020 ). Penghang Liu, Valerio Guarrasi, and A Erdem Sariy\u00fcce. 2020. Temporal Network Motifs: Models, Limitations, Evaluation. arXiv preprint arXiv:2005.11817 (2020)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_23_1","volume-title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs. In ICML 2020 Workshop on Graph Representation Learning .","author":"Rossi Emanuele","year":"2020","unstructured":"Emanuele Rossi , Ben Chamberlain , Fabrizio Frasca , Davide Eynard , Federico Monti , and Michael Bronstein . 2020 a . Temporal Graph Networks for Deep Learning on Dynamic Graphs. In ICML 2020 Workshop on Graph Representation Learning . Emanuele Rossi, Ben Chamberlain, Fabrizio Frasca, Davide Eynard, Federico Monti, and Michael Bronstein. 2020 a. Temporal Graph Networks for Deep Learning on Dynamic Graphs. In ICML 2020 Workshop on Graph Representation Learning ."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3382688"},{"key":"e_1_3_2_1_25_1","volume-title":"Simple and Effective Graph Autoencoders with One-Hop Linear Models. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD) .","author":"Salha Guillaume","year":"2020","unstructured":"Guillaume Salha , Romain Hennequin , and Michalis Vazirgiannis . 2020 . Simple and Effective Graph Autoencoders with One-Hop Linear Models. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD) . Guillaume Salha, Romain Hennequin, and Michalis Vazirgiannis. 2020. Simple and Effective Graph Autoencoders with One-Hop Linear Models. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD) ."},{"key":"e_1_3_2_1_26_1","volume-title":"Gravity-Inspired Graph Autoencoders for Directed Link Prediction. In ACM International Conference on Information and Knowledge Management (CIKM) .","author":"Salha Guillaume","year":"2019","unstructured":"Guillaume Salha , Stratis Limnios , Romain Hennequin , Viet Anh Tran , and Michalis Vazirgiannis . 2019 . Gravity-Inspired Graph Autoencoders for Directed Link Prediction. In ACM International Conference on Information and Knowledge Management (CIKM) . Guillaume Salha, Stratis Limnios, Romain Hennequin, Viet Anh Tran, and Michalis Vazirgiannis. 2019. Gravity-Inspired Graph Autoencoders for Directed Link Prediction. In ACM International Conference on Information and Knowledge Management (CIKM) ."},{"key":"e_1_3_2_1_27_1","first-page":"32","article-title":"Directed closure measures for networks with reciprocity","volume":"5","author":"Seshadhri C","year":"2017","unstructured":"C Seshadhri , Ali Pinar , Nurcan Durak , and Tamara G Kolda . 2017 . Directed closure measures for networks with reciprocity . Journal of Complex Networks , Vol. 5 , 1 (2017), 32 -- 47 . C Seshadhri, Ali Pinar, Nurcan Durak, and Tamara G Kolda. 2017. Directed closure measures for networks with reciprocity. Journal of Complex Networks, Vol. 5, 1 (2017), 32--47.","journal-title":"Journal of Complex Networks"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488502"},{"key":"e_1_3_2_1_29_1","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Weisfeiler Boris","year":"1968","unstructured":"Boris Weisfeiler and Andrei A Lehman . 1968 . A reduction of a graph to a canonical form and an algebra arising during this reduction . Nauchno-Technicheskaya Informatsia , Vol. 2 , 9 (1968), 12 -- 16 . Boris Weisfeiler and Andrei A Lehman. 1968. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia, Vol. 2, 9 (1968), 12--16.","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0789-0"},{"key":"e_1_3_2_1_31_1","volume-title":"Austin R Benson, and Johan Ugander","author":"Yin Hao","year":"2019","unstructured":"Hao Yin , Austin R Benson, and Johan Ugander . 2019 . Measuring directed triadic closure with closure coefficients. arXiv preprint arXiv:1905.10683 (2019). Hao Yin, Austin R Benson, and Johan Ugander. 2019. Measuring directed triadic closure with closure coefficients. arXiv preprint arXiv:1905.10683 (2019)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3097996"}],"event":{"name":"WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining","location":"Virtual Event Israel","acronym":"WSDM '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441817","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T15:36:05Z","timestamp":1646753765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":32,"alternative-id":["10.1145\/3437963.3441817","10.1145\/3437963"],"URL":"http:\/\/dx.doi.org\/10.1145\/3437963.3441817","relation":{},"published":{"date-parts":[[2021,3,8]]}}}