{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:34:06Z","timestamp":1772724846346,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFB0201305"],"award-info":[{"award-number":["2016YFB0201305"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFB0200803"],"award-info":[{"award-number":["2016YFB0200803"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFB0200300"],"award-info":[{"award-number":["2016YFB0200300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61521092"],"award-info":[{"award-number":["61521092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91430218"],"award-info":[{"award-number":["91430218"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["31327901"],"award-info":[{"award-number":["31327901"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472395"],"award-info":[{"award-number":["61472395"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61432018"],"award-info":[{"award-number":["61432018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["752321"],"award-info":[{"award-number":["752321"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2017YFB0202105"],"award-info":[{"award-number":["2017YFB0202105"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10766-018-0604-8","type":"journal-article","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T23:15:47Z","timestamp":1546298147000},"page":"403-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Register-Aware Optimizations for Parallel Sparse Matrix\u2013Matrix Multiplication"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7596-7011","authenticated-orcid":false,"given":"Junhong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangming","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"issue":"4","key":"604_CR1","doi-asserted-by":"publisher","first-page":"C123","DOI":"10.1137\/110838844","volume":"34","author":"N Bell","year":"2012","unstructured":"Bell, N., Dalton, S., Olson, L.: Exposing fine-grained parallelism in algebraic multigrid methods. SIAM J. Sci. Comput. 34(4), C123\u2013C152 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"604_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-006-1224-z","volume":"47","author":"P D\u2019Alberto","year":"2007","unstructured":"D\u2019Alberto, P., Nicolau, A.: R-kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks. Algorithmica 47(2), 203\u2013213 (2007)","journal-title":"Algorithmica"},{"issue":"11","key":"604_CR3","doi-asserted-by":"publisher","first-page":"6135","DOI":"10.1007\/s11227-018-2525-0","volume":"74","author":"F Zhang","year":"2018","unstructured":"Zhang, F., Lin, H., Zhai, J., Cheng, J., Xiang, D., Li, J., Chai, Y., Du, X.: An adaptive breadth-first search algorithm on integrated architectures. J. Supercomput. 74(11), 6135\u20136155 (2018)","journal-title":"J. Supercomput."},{"issue":"6","key":"604_CR4","doi-asserted-by":"publisher","first-page":"e33","DOI":"10.1093\/nar\/gkx1313","volume":"46","author":"A Azad","year":"2018","unstructured":"Azad, A., Pavlopoulos, G.A., Ouzounis, C.A., Kyrpides, N.C., Bulu\u00e7, A.: Hipmcl: a high-performance parallel implementation of the markov clustering algorithm for large-scale networks. Nucleic Acids Res. 46(6), e33 (2018)","journal-title":"Nucleic Acids Res."},{"key":"604_CR5","doi-asserted-by":"crossref","unstructured":"Mattson, T.G., Yang, C., McMillan, S., Bulu\u00e7, A., Moreira, J.E.: GraphBLAS C API: Ideas for future versions of the specification. In: IEEE High Performance Extreme Computing Conference (HPEC) (2017)","DOI":"10.1109\/HPEC.2017.8091095"},{"key":"604_CR6","doi-asserted-by":"crossref","unstructured":"Davis, T.A.: Graph algorithms via SuiteSparse: GraphBLAS: triangle counting and k-truss. In: IEEE High Performance Extreme Computing Conference (HPEC) (2018)","DOI":"10.1109\/HPEC.2018.8547538"},{"issue":"4","key":"604_CR7","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2699470","volume":"41","author":"S Dalton","year":"2015","unstructured":"Dalton, S., Olson, L., Bell, N.: Optimizing sparse matrix-matrix multiplication for the gpu. ACM Trans. Math. Softw. 41(4), 25:1\u201325:20 (2015)","journal-title":"ACM Trans. Math. Softw."},{"key":"604_CR8","unstructured":"Demouth, J.: Sparse matrix-matrix multiplication on the GPU. GTC \u201912 (2012)"},{"key":"604_CR9","doi-asserted-by":"crossref","unstructured":"Kunchum, R., Chaudhry, A., Sukumaran-Rajam, A., Niu, Q., Nisa, I., Sadayappan, P.: On improving performance of sparse matrix-matrix multiplication on gpus. In: Proceedings of the International Conference on Supercomputing (ICS \u201917), pp. 14:1\u201314:11 (2017)","DOI":"10.1145\/3079079.3079106"},{"issue":"8","key":"604_CR10","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1109\/TPDS.2017.2656893","volume":"28","author":"K Akbudak","year":"2017","unstructured":"Akbudak, K., Aykanat, C.: Exploiting locality in sparse matrix-matrix multiplication on many-core architectures. IEEE Trans. Parallel Distrib. Syst. 28(8), 2258\u20132271 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"604_CR11","doi-asserted-by":"crossref","unstructured":"Nagasaka, Y., Nukada, A., Matsuoka, S.: High-performance and memory-saving sparse general matrix-matrix multiplication for nvidia pascal gpu. In: 2017 46th International Conference on Parallel Processing (ICPP), pp. 101\u2013110 (Aug 2017)","DOI":"10.1109\/ICPP.2017.19"},{"issue":"4","key":"604_CR12","doi-asserted-by":"publisher","first-page":"C170","DOI":"10.1137\/110848244","volume":"34","author":"A Bulu\u00e7","year":"2012","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Parallel sparse matrix\u2013matrix multiplication and indexing: implementation and experiments. SIAM J. Sci. Comput. 34(4), C170\u2013C191 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"604_CR13","doi-asserted-by":"publisher","first-page":"C624","DOI":"10.1137\/15M104253X","volume":"38","author":"A Azad","year":"2016","unstructured":"Azad, A., Ballard, G., Bulu\u00e7, A., Demmel, J., Grigori, L., Schwartz, O., Toledo, S., Williams, S.: Exploiting multiple levels of parallelism in sparse matrix\u2013matrix multiplication. SIAM J. Sci. Comput. 38(6), C624\u2013C651 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"604_CR14","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/3015144","volume":"3","author":"G Ballard","year":"2016","unstructured":"Ballard, G., Druinsky, A., Knight, N., Schwartz, O.: Hypergraph partitioning for sparse matrix\u2013matrix multiplication. ACM Trans. Parallel Comput. 3(3), 18:1\u201318:34 (2016)","journal-title":"ACM Trans. Parallel Comput."},{"issue":"1","key":"604_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1077464.1077466","volume":"1","author":"R Yuster","year":"2005","unstructured":"Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Trans. Algorithms 1(1), 2\u201313 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"604_CR16","doi-asserted-by":"crossref","unstructured":"Liu, J., He, X., Liu, W., Tan, G.: Register-based implementation of the sparse general matrix-matrix multiplication on gpus. In: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP \u201918), pp. 407\u2013408 (2018)","DOI":"10.1145\/3178487.3178529"},{"key":"604_CR17","unstructured":"Liu, W.: Parallel and Scalable Sparse Basic Linear Algebra Subprograms. PhD thesis, University of Copenhagen (2015)"},{"issue":"C","key":"604_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jpdc.2015.06.010","volume":"85","author":"W Liu","year":"2015","unstructured":"Liu, W., Vinter, B.: A framework for general sparse matrix\u2013matrix multiplication on gpus and heterogeneous processors. J. Parallel Distrib. Comput. 85(C), 47\u201361 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"12","key":"604_CR19","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.jpdc.2014.07.003","volume":"74","author":"HC Edwards","year":"2014","unstructured":"Edwards, H.C., Trott, C.R., Sunderland, D.: Kokkos: enabling manycore performance portability through polymorphic memory access patterns. J. Parallel Distrib. Comput. 74(12), 3202\u20133216 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"604_CR20","doi-asserted-by":"crossref","unstructured":"Nagasaka, Y., Matsuoka, S., Azad, A., Bulu\u00e7, A.: High-performance sparse matrix-matrix products on intel knl and multicore architectures. In: Proceedings of the 47th International Conference on Parallel Processing Companion (ICPP \u201918) Workshop, pp. 34:1\u201334:10 (2018)","DOI":"10.1145\/3229710.3229720"},{"issue":"4","key":"604_CR21","doi-asserted-by":"publisher","first-page":"C429","DOI":"10.1137\/17M1121378","volume":"40","author":"F Gremse","year":"2018","unstructured":"Gremse, F., Kpper, K., Naumann, U.: Memory-efficient sparse matrix\u2013matrix multiplication by row merging on many-core architectures. SIAM J. Sci. Comput. 40(4), C429\u2013C449 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"604_CR22","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Challenges and advances in parallel sparse matrix\u2013matrix multiplication. In: 2008 37th International Conference on Parallel Processing, pp. 503\u2013510 (Sept 2008)","DOI":"10.1109\/ICPP.2008.45"},{"key":"604_CR23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.parco.2018.06.009","volume":"78","author":"M Deveci","year":"2018","unstructured":"Deveci, M., Trott, C., Rajamanickam, S.: Multithreaded sparse matrix\u2013matrix multiplication for many-core and gpu architectures. Parallel Comput. 78, 33\u201346 (2018)","journal-title":"Parallel Comput."},{"issue":"3","key":"604_CR24","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/355791.355796","volume":"4","author":"FG Gustavson","year":"1978","unstructured":"Gustavson, F.G.: Two fast algorithms for sparse matrices: multiplication and permuted transposition. ACM Trans. Math. Softw. 4(3), 250\u2013269 (1978)","journal-title":"ACM Trans. Math. Softw."},{"key":"604_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, F., Wu, B., Zhai, J., He, B., Chen, W.: FinePar: Irregularity-aware fine-grained workload partitioning on integrated architectures. In: Proceedings of the 2017 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pp. 27\u201338 (2017)","DOI":"10.1109\/CGO.2017.7863726"},{"issue":"3","key":"604_CR26","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TPDS.2016.2586074","volume":"28","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhai, J., He, B., Zhang, S., Chen, W.: Understanding co-running behaviors on integrated cpu\/gpu architectures. IEEE Trans. Parallel Distrib. Syst. 28(3), 905\u2013918 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"604_CR27","doi-asserted-by":"publisher","first-page":"46:1","DOI":"10.1145\/3218823","volume":"44","author":"G Tan","year":"2018","unstructured":"Tan, G., Liu, J., Li, J.: Design and implementation of adaptive spmv library for multicore and many-core architecture. ACM Trans. Math. Softw. 44(4), 46:1\u201346:25 (2018)","journal-title":"ACM Trans. Math. Softw."},{"key":"604_CR28","doi-asserted-by":"crossref","unstructured":"Liu, W., Vinter, B.: CSR5: An efficient storage format for cross-platform sparse matrix-vector multiplication. In: Proceedings of the 29th ACM on International Conference on Supercomputing (ICS \u201915), pp. 339\u2013350 (2015)","DOI":"10.1145\/2751205.2751209"},{"key":"604_CR29","doi-asserted-by":"crossref","unstructured":"Liu, W., Vinter, B.: An efficient gpu general sparse matrix-matrix multiplication for irregular data. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium (IPDPS \u201914), pp. 370\u2013381 (May 2014)","DOI":"10.1109\/IPDPS.2014.47"},{"issue":"1","key":"604_CR30","doi-asserted-by":"publisher","first-page":"C54","DOI":"10.1137\/130948811","volume":"37","author":"F Gremse","year":"2015","unstructured":"Gremse, F., H\u00f6fter, A., Schwen, L.O., Kiessling, F., Naumann, U.: Gpu-accelerated sparse matrix\u2013matrix multiplication by iterative row merging. SIAM J. Sci. Comput. 37(1), C54\u2013C71 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"604_CR31","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/0613024","volume":"13","author":"J Gilbert","year":"1992","unstructured":"Gilbert, J., Moler, C., Schreiber, R.: Sparse matrices in matlab: design and implementation. SIAM J. Matrix Anal. Appl. 13(1), 333\u2013356 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"604_CR32","doi-asserted-by":"crossref","unstructured":"Hou, K., Liu, W., Wang, H., Feng, W.c.: Fast segmented sort on gpus. In: Proceedings of the International Conference on Supercomputing (ICS \u201917), pp. 12:1\u201312:10 (2017)","DOI":"10.1145\/3079079.3079105"},{"key":"604_CR33","doi-asserted-by":"crossref","unstructured":"Anh, P.N.Q., Fan, R., Wen, Y.: Balanced hashing and efficient gpu sparse general matrix-matrix multiplication. In: Proceedings of the 2016 International Conference on Supercomputing (ICS \u201916), pp. 36:1\u201336:12 (2016)","DOI":"10.1145\/2925426.2926273"},{"key":"604_CR34","doi-asserted-by":"crossref","unstructured":"Li, A., Song, S.L., Liu, W., Liu, X., Kumar, A., Corporaal, H.: Locality-aware cta clustering for modern gpus. In: Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS \u201917), pp. 297\u2013311 (2017)","DOI":"10.1145\/3037697.3037709"},{"key":"604_CR35","doi-asserted-by":"crossref","unstructured":"Li, A., Liu, W., Wang, L., Barker, K., Song, S.L.: Warp-Consolidation: A Novel Execution Model for GPUS (ICS \u201918) (2018)","DOI":"10.1145\/3205289.3205294"},{"key":"604_CR36","doi-asserted-by":"crossref","unstructured":"Rawat, P.S., Rastello, F., Sukumaran-Rajam, A., Pouchet, L.N., Rountev, A., Sadayappan, P.: Register optimizations for stencils on gpus. In: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP \u201918), pp. 168\u2013182 (2018)","DOI":"10.1145\/3178487.3178500"},{"key":"604_CR37","unstructured":"Blelloch, G.E., Heroux, M.A., Zagha, M.: Segmented operations for sparse matrix computation on vector multiprocessors. Technical report, CMU (1993)"},{"issue":"C","key":"604_CR38","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.parco.2015.04.004","volume":"49","author":"W Liu","year":"2015","unstructured":"Liu, W., Vinter, B.: Speculative segmented sum for sparse matrix-vector multiplication on heterogeneous processors. Parallel Comput. 49(C), 179\u2013193 (2015)","journal-title":"Parallel Comput."},{"issue":"1","key":"604_CR39","first-page":"1:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"604_CR40","doi-asserted-by":"crossref","unstructured":"Dalton, S., Baxter, S., Merrill, D., Olson, L., Garland, M.: Optimizing sparse matrix operations on gpus using merge path. In: 2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS \u201915), pp. 407\u2013416 (May 2015)","DOI":"10.1109\/IPDPS.2015.98"},{"key":"604_CR41","doi-asserted-by":"crossref","unstructured":"Li, A., Liu, W., Kristensen, M.R.B., Vinter, B., Wang, H., Hou, K., Marquez, A., Song, S.L.: Exploring and analyzing the real impact of modern on-package memory on hpc scientific kernels (SC \u201917), pp. 26:1\u201326:14 (2017)","DOI":"10.1145\/3126908.3126931"},{"key":"604_CR42","doi-asserted-by":"crossref","unstructured":"Xie, X., Liang, Y., Li, X., Wu, Y., Sun, G., Wang, T., Fan, D.: Enabling coordinated register allocation and thread-level parallelism optimization for gpus. In: 2015 48th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 395\u2013406 (Dec 2015)","DOI":"10.1145\/2830772.2830813"},{"key":"604_CR43","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-49583-5_34","volume-title":"Algorithms and Architectures for Parallel Processing","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Liu, J., Luo, Y., Tan, G.: Locality of computation for stencil optimization. In: Carretero, J., Garcia-Blas, J., Ko, R.K., Mueller, P., Nakano, K. (eds.) Algorithms and Architectures for Parallel Processing, pp. 449\u2013456. Springer International Publishing, Cham (2016)"},{"key":"604_CR44","doi-asserted-by":"crossref","unstructured":"Liu, J., Tan, G., Luo, Y., Li, J., Mo, Z., Sun, N.: An autotuning protocol to rapidly build autotuners. ACM Trans. Parallel Comput. (2018)","DOI":"10.1145\/3291527"},{"key":"604_CR45","doi-asserted-by":"crossref","unstructured":"Li, J., Tan, G., Chen, M., Sun, N.: SMAT: An input adaptive auto-tuner for sparse matrix-vector multiplication. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201913), pp. 117\u2013126 (2013)","DOI":"10.1145\/2491956.2462181"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-018-0604-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-018-0604-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-018-0604-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:46:47Z","timestamp":1577839607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-018-0604-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["604"],"URL":"https:\/\/doi.org\/10.1007\/s10766-018-0604-8","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]},"assertion":[{"value":"21 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}