{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T06:13:09Z","timestamp":1758089589196,"version":"3.44.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004750","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004750","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/dac63849.2025.11133067","type":"proceedings-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:35:41Z","timestamp":1757957741000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Can Short Hypervectors Drive Feature-Rich GNNs? Strengthening the Graph Representation of Hyperdimensional Computing for Memory-efficient GNNs"],"prefix":"10.1109","author":[{"given":"Jihe","family":"Wang","sequence":"first","affiliation":[{"name":"Northwestern Polytechnical University,School of Computer Science,Xi’an,China"}]},{"given":"Yuxi","family":"Han","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University,Engineering Research Center of Embedded System Integration Ministry of Education,Xi’an,China"}]},{"given":"Danghui","family":"Wang","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University,Engineering Research Center of Embedded System Integration Ministry of Education,Xi’an,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3059762"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3524067"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.23919\/DATE54114.2022.9774533"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323813"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD56317.2022.00087"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-009-9009-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2020.2988388"},{"key":"ref8","article-title":"From stars to subgraphs: Uplifting any GNN with local structure awareness","author":"Zhao","year":"2022","journal-title":"ICLR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3538531"},{"article-title":"Tudataset: A collection of benchmark datasets for learning with graphs","volume-title":"ICML","author":"Morris","key":"ref10"},{"key":"ref11","first-page":"1157","article-title":"Understanding hyperdimensional computing for parallel single-pass learning","volume":"35","author":"Yu","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-43415-0_9"},{"key":"ref13","first-page":"4776","article-title":"How powerful are khop message passing graph neural networks","volume":"35","author":"Feng","year":"2022","journal-title":"Advances in NIPS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/s22041477"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247736"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2991\/assehr.k.201010.019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31041-7_35"},{"key":"ref18","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019","journal-title":"ICLR"},{"key":"ref19","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"International Conference on Learning Representations (ICLR)","author":"Kipf"},{"key":"ref20","first-page":"566","article-title":"Graph Attention Networks","volume":"11731","author":"Petar Veli\u010dkovi\u0107","year":"2018","journal-title":"ICLR"},{"key":"ref21","article-title":"Mag-gnn: reinforcement learning boosted graph neural network","author":"Kong","year":"2023","journal-title":"NIPS"},{"key":"ref22","article-title":"Scalable kernels for graphs with continuous attributes","volume":"26","author":"Feragen","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"}],"event":{"name":"2025 62nd ACM\/IEEE Design Automation Conference (DAC)","start":{"date-parts":[[2025,6,22]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2025,6,25]]}},"container-title":["2025 62nd ACM\/IEEE Design Automation Conference (DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11132383\/11132091\/11133067.pdf?arnumber=11133067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T05:50:55Z","timestamp":1758001855000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11133067\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/dac63849.2025.11133067","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}