{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:54:20Z","timestamp":1766138060085,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER IIS-1942929"],"award-info":[{"award-number":["CAREER IIS-1942929"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,14]]},"DOI":"10.1145\/3534678.3539433","type":"proceedings-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:06:12Z","timestamp":1660331172000},"page":"698-708","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Spectral Representation of Networks: The Path of Subgraphs"],"prefix":"10.1145","author":[{"given":"Shengmin","family":"Jin","sequence":"first","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}]},{"given":"Hao","family":"Tian","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}]},{"given":"Jiayu","family":"Li","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}]},{"given":"Reza","family":"Zafarani","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140102"},{"key":"e_1_3_2_1_2_1","volume-title":"A construction of cospectral graphs for the normalized Laplacian. arXiv preprint arXiv:1008.3646","author":"Butler Steve","year":"2010","unstructured":"Steve Butler and Jason Grout. 2010. A construction of cospectral graphs for the normalized Laplacian. arXiv preprint arXiv:1008.3646 (2010)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284680.1284681"},{"volume-title":"Problems in analysis","author":"Cheeger Jeff","key":"e_1_3_2_1_5_1","unstructured":"Jeff Cheeger. 2015. A lower bound for the smallest eigenvalue of the Laplacian. In Problems in analysis. Princeton University Press, 195--200."},{"key":"e_1_3_2_1_6_1","unstructured":"Fan RK Chung and Fan Chung Graham. 1997. Spectral graph theory. Number 92. American Mathematical Soc."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"David Cohen-Steiner Weihao Kong Christian Sohler and Gregory Valiant. 2018. Approximating the Spectrum of a Graph. In SIGKDD. ACM 1263--1271.","DOI":"10.1145\/3219819.3220119"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330891"},{"key":"e_1_3_2_1_9_1","volume-title":"Network Identification and Authentication. In 2019 International Conference on Data Mining (ICDM). IEEE.","author":"Jin Shengmin","year":"2019","unstructured":"Shengmin Jin, Vir V Phoha, and Reza Zafarani. 2019. Network Identification and Authentication. In 2019 International Conference on Data Mining (ICDM). IEEE."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403195"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1957.7.961"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_13_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"volume-title":"Matrix differential calculus with applications in statistics and econometrics","author":"Magnus Jan R","key":"e_1_3_2_1_14_1","unstructured":"Jan R Magnus and Heinz Neudecker. 2019. Matrix differential calculus with applications in statistics and econometrics. John Wiley & Sons."},{"key":"e_1_3_2_1_15_1","volume-title":"graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005","author":"Narayanan Annamalai","year":"2017","unstructured":"Annamalai Narayanan, Mahinthan Chandramohan, Rajasekar Venkatesan, Lihui Chen, Yang Liu, and Shantanu Jaiswal. 2017. graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 (2017)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1970.11992413"},{"key":"e_1_3_2_1_17_1","volume-title":"Using Laplacian Spectrum as Graph Feature Representation. arXiv preprint arXiv:1912.00735","author":"Pineau Edouard","year":"2019","unstructured":"Edouard Pineau. 2019. Using Laplacian Spectrum as Graph Feature Representation. arXiv preprint arXiv:1912.00735 (2019)."},{"key":"e_1_3_2_1_18_1","first-page":"4292","article-title":"The Network Data Repository with Interactive Graph Analytics and Visualization","volume":"15","author":"Rossi Ryan","year":"2015","unstructured":"Ryan Rossi and Nesreen Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization.. In AAAI, Vol. 15. 4292--4293.","journal-title":"AAAI"},{"key":"e_1_3_2_1_19_1","volume-title":"Almost all trees are cospectral. New directions in the theory of graphs","author":"Schwenk Allen J","year":"1973","unstructured":"Allen J Schwenk. 1973. Almost all trees are cospectral. New directions in the theory of graphs (1973), 275--307."},{"key":"e_1_3_2_1_20_1","unstructured":"Anton Tsitsulin Davide Mottin Panagiotis Karras Alexander Bronstein and Emmanuel M\u00fcller. 2018. Netlsd: hearing the shape of a graph. In KDD. 2347--2356."},{"volume-title":"A collection of mathematical problems","key":"e_1_3_2_1_21_1","unstructured":"StanislawMUlam. 1960. A collection of mathematical problems. Vol. 8. Interscience Publishers."},{"key":"e_1_3_2_1_22_1","unstructured":"Saurabh Verma and Zhi-Li Zhang. 2017. Hunt for the unique stable sparse and fast feature learning on graphs. In NeurIPS. 88--98."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.03.011"},{"key":"e_1_3_2_1_24_1","unstructured":"R. Zafarani and H. Liu. 2009. Social Computing Data Repository at ASU. http:\/\/socialcomputing.asu.edu"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783268"}],"event":{"name":"KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Washington DC USA","acronym":"KDD '22"},"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.3539433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534678.3539433","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534678.3539433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:03:03Z","timestamp":1750186983000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,14]]},"references-count":24,"alternative-id":["10.1145\/3534678.3539433","10.1145\/3534678"],"URL":"https:\/\/doi.org\/10.1145\/3534678.3539433","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"}}]}}