{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T03:35:58Z","timestamp":1767843358383,"version":"3.49.0"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)-Faculty Early Career","doi-asserted-by":"publisher","award":["5409260"],"award-info":[{"award-number":["5409260"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"NSF-Computing and Communication Foundations","doi-asserted-by":"crossref","award":["221232"],"award-info":[{"award-number":["221232"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3302830","type":"journal-article","created":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T18:20:34Z","timestamp":1691432434000},"page":"87533-87542","source":"Crossref","is-referenced-by-count":4,"title":["Promise and Limitations of Supervised Optimal Transport-Based Graph Summarization via Information Theoretic Measures"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8896-8109","authenticated-orcid":false,"given":"Sepideh","family":"Neshatfar","sequence":"first","affiliation":[{"name":"School of Computing and Information Science, University of Maine, Orono, ME, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3082-9915","authenticated-orcid":false,"given":"Abram","family":"Magner","sequence":"additional","affiliation":[{"name":"College of Engineering and Applied Sciences, University at Albany, Albany, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0854-5422","authenticated-orcid":false,"given":"Salimeh Yasaei","family":"Sekeh","sequence":"additional","affiliation":[{"name":"School of Computing and Information Science, University of Maine, Orono, ME, USA"}]}],"member":"263","reference":[{"key":"ref13","article-title":"The information bottleneck method","author":"tishby","year":"2000","journal-title":"arXiv physics\/0004057"},{"key":"ref24","article-title":"Scalable kernels for graphs with continuous attributes","volume":"26","author":"feragen","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref12","author":"cover","year":"2006","journal-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)"},{"key":"ref23","article-title":"New York city taxi trip data (2010–2013)","author":"donovan","year":"2016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683351"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/e21080787"},{"key":"ref20","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462306"},{"key":"ref22","first-page":"1","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref21","first-page":"1","article-title":"Matching networks for one shot learning","volume":"29","author":"vinyals","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62466-8_9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007086"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066138"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref18","first-page":"4452","article-title":"Graph coarsening with preserved spectral properties","author":"jin","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref8","first-page":"6932","article-title":"Gromov-Wasserstein learning for graph matching and node embedding","volume":"97","author":"xu","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20335"},{"key":"ref9","first-page":"1","article-title":"Solving graph compression via optimal transport","author":"garg","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymeth.2020.05.014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330912"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3186727"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449796"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/10005208\/10210378-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10210378.pdf?arnumber=10210378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T18:18:28Z","timestamp":1694456308000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10210378\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3302830","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}