{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:53:17Z","timestamp":1758703997520,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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":[[2019,9]]},"DOI":"10.1109\/hpec.2019.8916550","type":"proceedings-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T12:11:36Z","timestamp":1575029496000},"page":"1-6","source":"Crossref","is-referenced-by-count":22,"title":["Write Quick, Run Fast: Sparse Deep Neural Network in 20 Minutes of Development Time via SuiteSparse:GraphBLAS"],"prefix":"10.1109","author":[{"given":"Timothy A.","family":"Davis","sequence":"first","affiliation":[]},{"given":"Mohsen","family":"Aznaveh","sequence":"additional","affiliation":[]},{"given":"Scott","family":"Kolodziej","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Algorithm 9xx: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra","volume":"to appear","author":"davis","year":"2019","journal-title":"ACM Trans Math Softw"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"ref12","first-page":"1","article-title":"On the representation and multiplication of hypersparse matrices","author":"bulu\u00e7","year":"2008","journal-title":"IPDPS08 the IEEE International Symposium on Parallel & Distributed Processing"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547538"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2019.00053"},{"key":"ref4","first-page":"801","article-title":"Efficient sparse coding algorithms","author":"lee","year":"2007","journal-title":"Advances in neural information processing systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916336"},{"key":"ref6","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","author":"han","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref5","article-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding","author":"han","year":"2015","journal-title":"arXiv preprint arXiv 1510 00149"},{"key":"ref8","article-title":"Efficient sparse-winograd convolutional neural networks","author":"liu","year":"2018","journal-title":"arXiv preprint arXiv 1802 02172"},{"key":"ref7","article-title":"Exploring the regularity of sparse structure in convolutional neural networks","author":"mao","year":"2017","journal-title":"arXiv preprint arXiv 1705 08922"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918"},{"journal-title":"The graphblas c api specification","year":"2017","author":"bulu\u00e7","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080254"}],"event":{"name":"2019 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2019,9,24]]},"location":"Waltham, MA, USA","end":{"date-parts":[[2019,9,26]]}},"container-title":["2019 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8910148\/8916214\/08916550.pdf?arnumber=8916550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T14:47:02Z","timestamp":1658155622000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8916550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/hpec.2019.8916550","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}