{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:04Z","timestamp":1773377584617,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517814","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2649-2654","source":"Crossref","is-referenced-by-count":3,"title":["On Greedy Approaches to Hierarchical Aggregation"],"prefix":"10.1109","author":[{"given":"Alexandra","family":"Porter","sequence":"first","affiliation":[{"name":"Stanford University,Department of Computer Science,Stanford,CA"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Stanford University,Departments of Computer Science and Electrical Engineering,Stanford,CA"}]}],"member":"263","reference":[{"key":"ref10","article-title":"On greedy approaches to hierarchical aggregation","author":"porter","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref12","article-title":"Graph attention networks","author":"veli?kovi?","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref13","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"ying","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref4","article-title":"Redundancy-free computation graphs for graph neural networks","author":"jia","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref3","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref6","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158545"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref9","first-page":"548","article-title":"Learning to discover social circles in ego networks","volume":"2012","author":"mcauley","year":"2012","journal-title":"NIPS"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517814.pdf?arnumber=9517814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:29Z","timestamp":1773347669000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517814\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517814","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}