{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:59Z","timestamp":1750220399446,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,8]]},"DOI":"10.1145\/3487351.3488330","type":"proceedings-article","created":{"date-parts":[[2022,2,19]],"date-time":"2022-02-19T12:16:07Z","timestamp":1645272967000},"page":"48-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Distinguishability of graphs"],"prefix":"10.1145","author":[{"given":"Athanasia","family":"Polychronopoulou","sequence":"first","affiliation":[{"name":"Temple University"}]},{"given":"J.","family":"Alshehri","sequence":"additional","affiliation":[{"name":"Temple University"}]},{"given":"Zoran","family":"Obradovic","sequence":"additional","affiliation":[{"name":"Temple University"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"volume-title":"A graph theoretic approach to enterprise network dynamics","year":"2007","key":"e_1_3_2_1_1_1","unstructured":"Bunke H, Dickinson PJ, Kraetzl M, Wallis WD ( 2007 ) A graph theoretic approach to enterprise network dynamics . Birkh\u00e4user , Boston Bunke H, Dickinson PJ, Kraetzl M, Wallis WD (2007) A graph theoretic approach to enterprise network dynamics. Birkh\u00e4user, Boston"},{"key":"e_1_3_2_1_2_1","volume-title":"Theoretical foundations, algorithms, and applications.\" Proc. Vision Interface","author":"Bunke Horst","year":"2000","unstructured":"Bunke , Horst . \"Graph matching : Theoretical foundations, algorithms, and applications.\" Proc. Vision Interface . Vol. 2000 . 2000 . Bunke, Horst. \"Graph matching: Theoretical foundations, algorithms, and applications.\" Proc. Vision Interface. Vol. 2000. 2000."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-010-0003-x"},{"key":"e_1_3_2_1_4_1","volume-title":"Society for Industrial and Applied Mathematics","author":"Koutra Danai","year":"2013","unstructured":"Koutra , Danai , Joshua T . Vogelstein , and Christos Faloutsos . \" Deltacon : A principled massive-graph similarity function.\" Proceedings of the 2013 SIAM International Conference on Data Mining . Society for Industrial and Applied Mathematics , 2013 . Koutra, Danai, Joshua T. Vogelstein, and Christos Faloutsos. \"Deltacon: A principled massive-graph similarity function.\" Proceedings of the 2013 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0228728"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.041062"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-019-0152-6"},{"issue":"04","key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"P04019","DOI":"10.1088\/1742-5468\/2013\/04\/P04019","article-title":"Quantum-classical transitions in complex networks","volume":"2013","author":"Javarone Marco Alberto","year":"2013","unstructured":"Javarone , Marco Alberto , and Giuliano Armano . \" Quantum-classical transitions in complex networks .\" Journal of Statistical Mechanics: Theory and Experiment 2013 . 04 ( 2013 ): P04019 . Javarone, Marco Alberto, and Giuliano Armano. \"Quantum-classical transitions in complex networks.\" Journal of Statistical Mechanics: Theory and Experiment 2013.04 (2013): P04019.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.4.041012"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/00107151031000110776"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep00605"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.123.260501"},{"key":"e_1_3_2_1_13_1","volume-title":"558--559","author":"Nielsen Michael A","year":"2002","unstructured":"Nielsen , Michael A . , and Isaac Chuang . \"Quantum computation and quantum information.\" ( 2002 ): 558--559 . Nielsen, Michael A., and Isaac Chuang. \"Quantum computation and quantum information.\" (2002): 558--559."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.84.032120"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.062310"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.77.052311"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-006-0289-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.087902"},{"key":"e_1_3_2_1_19_1","volume-title":"Quantum coherence and correlation measures based on affinity.\" arXiv preprint arXiv:2003.13077","author":"Muthuganesan R., V. K.","year":"2020","unstructured":"Muthuganesan , R., V. K. Chandrasekar , and R. Sankaranarayanan . \" Quantum coherence and correlation measures based on affinity.\" arXiv preprint arXiv:2003.13077 ( 2020 ). Muthuganesan, R., V. K. Chandrasekar, and R. Sankaranarayanan. \"Quantum coherence and correlation measures based on affinity.\" arXiv preprint arXiv:2003.13077 (2020)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.052310"},{"key":"e_1_3_2_1_21_1","volume-title":"The case for centrality distance.\" Proceedings of the 10th ACM international workshop on Foundations of mobile computing","author":"Roy Matthieu","year":"2014","unstructured":"Roy , Matthieu , Stefan Schmid , and Gilles Tredan . \" Modeling and measuring graph similarity : The case for centrality distance.\" Proceedings of the 10th ACM international workshop on Foundations of mobile computing . 2014 . Roy, Matthieu, Stefan Schmid, and Gilles Tredan. \"Modeling and measuring graph similarity: The case for centrality distance.\" Proceedings of the 10th ACM international workshop on Foundations of mobile computing. 2014."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3283407"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(94)00248-9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1971.9989788"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_2_1_26_1","unstructured":"Jaccard P. Bulletin de la Societe Vaudoise des Science Naturelles 37 5471901  Jaccard P. Bulletin de la Societe Vaudoise des Science Naturelles 37 5471901"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Passerini Filippo and Simone Severini. \"The von Neumann entropy of networks.\" arXiv preprint arXiv:0812.2597 (2008).  Passerini Filippo and Simone Severini. \"The von Neumann entropy of networks.\" arXiv preprint arXiv:0812.2597 (2008).","DOI":"10.2139\/ssrn.1382662"},{"key":"e_1_3_2_1_28_1","unstructured":"Leskovec J. and Krevl A. SNAP Datasets: Stanford Large Network Dataset Collection http:\/\/snap.stanford.edu\/data  Leskovec J. and Krevl A. SNAP Datasets: Stanford Large Network Dataset Collection http:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"issue":"1","key":"e_1_3_2_1_30_1","first-page":"1","article-title":"Network enhancement as a general method to denoise weighted biological networks","volume":"9","author":"Wang Bo","year":"2018","unstructured":"Wang , Bo , et al. \" Network enhancement as a general method to denoise weighted biological networks .\" Nature communications 9 . 1 ( 2018 ): 1 -- 8 . Wang, Bo, et al. \"Network enhancement as a general method to denoise weighted biological networks.\" Nature communications 9.1 (2018): 1--8.","journal-title":"Nature communications"},{"key":"e_1_3_2_1_31_1","unstructured":"Rozemberczki Benedek Oliver Kiss and Rik Sarkar. \"An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs.\" arXiv preprint arXiv:2003.04819 (2020).  Rozemberczki Benedek Oliver Kiss and Rik Sarkar. \"An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs.\" arXiv preprint arXiv:2003.04819 (2020)."},{"key":"e_1_3_2_1_32_1","volume-title":"Omar Keshk","author":"Barbieri Katherine","year":"2016","unstructured":"Barbieri , Katherine and Omar M. G . Omar Keshk . 2016 . Correlates of War Project Trade Data Set Codebook, Version 4.0. Online : http:\/\/correlatesofwar.org. Barbieri, Katherine and Omar M. G. Omar Keshk. 2016. Correlates of War Project Trade Data Set Codebook, Version 4.0. Online: http:\/\/correlatesofwar.org."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Barbieri Katherine Omar M. G. Keshk and Brian Pollins. 2009. \"TRADING DATA: Evaluating our Assumptions and Coding Rules.\" Conflict Management and Peace Science. 26(5): 471--491.  Barbieri Katherine Omar M. G. Keshk and Brian Pollins. 2009. \"TRADING DATA: Evaluating our Assumptions and Coding Rules.\" Conflict Management and Peace Science. 26(5): 471--491.","DOI":"10.1177\/0738894209343887"}],"event":{"name":"ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Virtual Event Netherlands","acronym":"ASONAM '21"},"container-title":["Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3488330","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487351.3488330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:48Z","timestamp":1750191528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3488330"}},"subtitle":["a case for quantum-inspired measures"],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":33,"alternative-id":["10.1145\/3487351.3488330","10.1145\/3487351"],"URL":"https:\/\/doi.org\/10.1145\/3487351.3488330","relation":{},"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}