{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T12:16:10Z","timestamp":1771330570788,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61872299"],"award-info":[{"award-number":["61872299"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2021,12,31]]},"abstract":"<jats:p>\n            This article proposes a low I\/O intensity-aware scheduling scheme on garbage collection (GC) in SSDs for minimizing the I\/O long-tail latency to ensure I\/O responsiveness. The basic idea is to assemble partial GC operations by referring to several determinable factors (e.g., I\/O characteristics) and dispatch them to be processed together in idle time slots of I\/O processing. To this end, it first makes use of\n            <jats:italic>Fourier<\/jats:italic>\n            transform to explore the time slots having relative sparse I\/O requests for conducting time-consuming GC operations, as the number of affected I\/O requests can be limited. After that, it constructs a mathematical model to further figure out the types and quantities of partial GC operations, which are supposed to be dealt with in the explored idle time slots, by taking the factors of I\/O intensity, read\/write ratio, and the SSD use state into consideration. Through a series of simulation experiments based on several realistic disk traces, we illustrate that the proposed GC scheduling mechanism can noticeably reduce the long-tail latency by between 5.5% and 232.3% at the 99.99th percentile, in contrast to state-of-the-art methods.\n          <\/jats:p>","DOI":"10.1145\/3460433","type":"journal-article","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T18:36:15Z","timestamp":1629311775000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Low I\/O Intensity-aware Partial GC Scheduling to Reduce Long-tail Latency in SSDs"],"prefix":"10.1145","volume":"18","author":[{"given":"Zhibing","family":"Sha","sequence":"first","affiliation":[{"name":"Southwest University of China, China"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"Southwest University of China, China"}]},{"given":"Lihao","family":"Song","sequence":"additional","affiliation":[{"name":"Southwest University of China, China"}]},{"given":"Jiewen","family":"Tang","sequence":"additional","affiliation":[{"name":"Southwest University of China, China"}]},{"given":"Min","family":"Huang","sequence":"additional","affiliation":[{"name":"Southwest University of China, China"}]},{"given":"Zhigang","family":"Cai","sequence":"additional","affiliation":[{"name":"Southwest University of China, China"}]},{"given":"Lianju","family":"Qian","sequence":"additional","affiliation":[{"name":"Chengdu SGK Semiconductor Co, Ltd, China"}]},{"given":"Jianwei","family":"Liao","sequence":"additional","affiliation":[{"name":"Southwest University of China, China"}]},{"given":"Zhiming","family":"Liu","sequence":"additional","affiliation":[{"name":"Southwest University of China, China"}]}],"member":"320","published-online":{"date-parts":[[2021,8,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"W. Choi and M. Kandemir. 2018. Parallelizing garbage collection with I\/O to improve flash resource utilization. In HPDC\u201918.  W. Choi and M. Kandemir. 2018. Parallelizing garbage collection with I\/O to improve flash resource utilization. In HPDC\u201918.","DOI":"10.1145\/3208040.3208048"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"S. Choudhuri and T. Givargis. 2008. Deterministic service guarantees for NAND flash using partial block cleaning. In CODES+ISSS\u201908.  S. Choudhuri and T. Givargis. 2008. Deterministic service guarantees for NAND flash using partial block cleaning. In CODES+ISSS\u201908.","DOI":"10.1145\/1450135.1450141"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"J. Cui Y. Zhang and J. Huang. 2018. ShadowGC: Cooperative garbage collection with multi-level buffer for performance improvement in NAND flash-based SSDs. In DATE\u201918.  J. Cui Y. Zhang and J. Huang. 2018. ShadowGC: Cooperative garbage collection with multi-level buffer for performance improvement in NAND flash-based SSDs. In DATE\u201918.","DOI":"10.23919\/DATE.2018.8342206"},{"key":"#cr-split#-e_1_2_1_4_1.1","doi-asserted-by":"crossref","unstructured":"C. Gao L. Shi and Y. Di. 2018. Exploiting chip idleness for minimizing garbage collection-induced chip access conflict on SSDs. ACM Trans. Des. Automat. Electron. Syst.2018. DOI:https:\/\/doi.org\/10.1145\/3131850 10.1145\/3131850","DOI":"10.1145\/3131850"},{"key":"#cr-split#-e_1_2_1_4_1.2","doi-asserted-by":"crossref","unstructured":"C. Gao L. Shi and Y. Di. 2018. Exploiting chip idleness for minimizing garbage collection-induced chip access conflict on SSDs. ACM Trans. Des. Automat. Electron. Syst.2018. DOI:https:\/\/doi.org\/10.1145\/3131850","DOI":"10.1145\/3131850"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"S. Hahn J. Kim and S. Lee. 2015. To collect or not to collect: Just-in-time garbage collection for high-performance SSDs with long lifetimes. In DAC.  S. Hahn J. Kim and S. Lee. 2015. To collect or not to collect: Just-in-time garbage collection for high-performance SSDs with long lifetimes. In DAC.","DOI":"10.1145\/2744769.2744918"},{"key":"#cr-split#-e_1_2_1_6_1.1","doi-asserted-by":"crossref","unstructured":"T. Hatanakay R. Yajima and T. Horiuchi. 2010. Ferroelectric (Fe)-NAND flash memory with batch write algorithm and smart data store to the nonvolatile page buffer for data center application high-speed and highly reliable enterprise solid-state drives. IEEE Solid-state Circ. 2010. DOI:https:\/\/doi.org\/10.1109\/JSSC.2010.2061650 10.1109\/JSSC.2010.2061650","DOI":"10.1109\/JSSC.2010.2061650"},{"key":"#cr-split#-e_1_2_1_6_1.2","doi-asserted-by":"crossref","unstructured":"T. Hatanakay R. Yajima and T. Horiuchi. 2010. Ferroelectric (Fe)-NAND flash memory with batch write algorithm and smart data store to the nonvolatile page buffer for data center application high-speed and highly reliable enterprise solid-state drives. IEEE Solid-state Circ. 2010. DOI:https:\/\/doi.org\/10.1109\/JSSC.2010.2061650","DOI":"10.1109\/JSSC.2010.2061650"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"D. Hong and J. Park. 2019. Improving SSD performance using adaptive restricted-copyback operations. In NVMSA\u201919.  D. Hong and J. Park. 2019. Improving SSD performance using adaptive restricted-copyback operations. In NVMSA\u201919.","DOI":"10.1109\/NVMSA.2019.8863524"},{"key":"e_1_2_1_8_1","volume-title":"Trans. Comput., 2013","author":"Hu Y.","year":"2012","unstructured":"Y. Hu , H. Jiang , and D. Feng . 2013. Exploring and exploiting the multilevel parallelism inside SSDs for improved performance and endurance . Trans. Comput., 2013 . DOI:https:\/\/doi.org\/10.1109\/TC. 2012 .60 10.1109\/TC.2012.60 Y. Hu, H. Jiang, and D. Feng. 2013. Exploring and exploiting the multilevel parallelism inside SSDs for improved performance and endurance. Trans. Comput., 2013. DOI:https:\/\/doi.org\/10.1109\/TC.2012.60"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"M. Jung R. Prabhakar and M. Kandemir. 2012. Taking garbage collection overheads off the critical path in SSDs. In Middleware\u201912.  M. Jung R. Prabhakar and M. Kandemir. 2012. Taking garbage collection overheads off the critical path in SSDs. In Middleware\u201912.","DOI":"10.1007\/978-3-642-35170-9_9"},{"key":"e_1_2_1_10_1","volume-title":"Technol. Comput. Aided Des., 2019","author":"Jung M.","year":"2019","unstructured":"M. Jung , W. Choi , and M. Kwon . 2019. Design of a host interface logic for GC-Free SSDs. J . Technol. Comput. Aided Des., 2019 . DOI:https:\/\/doi.org\/10.1109\/TCAD. 2019 .2919035 10.1109\/TCAD.2019.2919035 M. Jung, W. Choi, and M. Kwon. 2019. Design of a host interface logic for GC-Free SSDs. J. Technol. Comput. Aided Des., 2019. DOI:https:\/\/doi.org\/10.1109\/TCAD.2019.2919035"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"W. Kang D. Shin and S. Yoo. 2017. Reinforcement learning-assisted garbage collection to mitigate long-tail latency in SSD. Trans. Embed. Comput. Syst.2017.  W. Kang D. Shin and S. Yoo. 2017. Reinforcement learning-assisted garbage collection to mitigate long-tail latency in SSD. Trans. Embed. Comput. Syst.2017.","DOI":"10.1145\/3195970.3196034"},{"key":"e_1_2_1_12_1","unstructured":"B. Kim H. Yang and S. Min. 2018. AutoSSD: An autonomic SSD architecture. In ATC\u201918.  B. Kim H. Yang and S. Min. 2018. AutoSSD: An autonomic SSD architecture. In ATC\u201918."},{"key":"e_1_2_1_13_1","unstructured":"S. Kim J. Bae and H. Jang. 2019. Practical erase suspension for modern low-latency SSDs. In ATC\u201919.  S. Kim J. Bae and H. Jang. 2019. Practical erase suspension for modern low-latency SSDs. In ATC\u201919."},{"key":"e_1_2_1_14_1","unstructured":"J. Kim K. Lim and Y. Jung. 2019. Alleviating garbage collection interference through spatial separation in all flash arrays. In ATC\u201919.  J. Kim K. Lim and Y. Jung. 2019. Alleviating garbage collection interference through spatial separation in all flash arrays. In ATC\u201919."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"C. Lee T. Kumano and T. Matsuki. 2017. Understanding storage traffic characteristics on enterprise virtual desktop infrastructure. In SYSTOR\u201917.  C. Lee T. Kumano and T. Matsuki. 2017. Understanding storage traffic characteristics on enterprise virtual desktop infrastructure. In SYSTOR\u201917.","DOI":"10.1145\/3078468.3078479"},{"key":"#cr-split#-e_1_2_1_16_1.1","doi-asserted-by":"crossref","unstructured":"J. Lee Y. Kim and G. Shipman. 2013. Preemptible I\/O scheduling of garbage collection for solid state drives. In J. Technol. Comput. Aided Des.2013. DOI:https:\/\/doi.org\/10.1109\/TCAD.2012.2227479 10.1109\/TCAD.2012.2227479","DOI":"10.1109\/TCAD.2012.2227479"},{"key":"#cr-split#-e_1_2_1_16_1.2","doi-asserted-by":"crossref","unstructured":"J. Lee Y. Kim and G. Shipman. 2013. Preemptible I\/O scheduling of garbage collection for solid state drives. In J. Technol. Comput. Aided Des.2013. DOI:https:\/\/doi.org\/10.1109\/TCAD.2012.2227479","DOI":"10.1109\/TCAD.2012.2227479"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"J. Li X. Xu and X. Peng. 2019. Pattern-based write scheduling and read balance-oriented wear-leveling for solid state drivers. In MSST\u201919.  J. Li X. Xu and X. Peng. 2019. Pattern-based write scheduling and read balance-oriented wear-leveling for solid state drivers. In MSST\u201919.","DOI":"10.1109\/MSST.2019.00-10"},{"key":"e_1_2_1_18_1","volume-title":"Novel and Hybrid Algorithms for Time Series Prediction","author":"Masters N.","unstructured":"N. Masters . 1995. Novel and Hybrid Algorithms for Time Series Prediction . John Wiley & Sons, Inc. . N. Masters. 1995. Novel and Hybrid Algorithms for Time Series Prediction. John Wiley & Sons, Inc.."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.enpol.2013.04.045"},{"key":"e_1_2_1_20_1","volume-title":"Comput. Electric. Eng., 2019","author":"Nguyen H.","year":"2019","unstructured":"H. Nguyen , M. Naeem , and N. Wichitaksorn . 2019. A smart system for short-term price prediction using time series models . Comput. Electric. Eng., 2019 . DOI:https:\/\/doi.org\/10.1016\/j.compeleceng. 2019 .04.013 10.1016\/j.compeleceng.2019.04.013 H. Nguyen, M. Naeem, and N. Wichitaksorn. 2019. A smart system for short-term price prediction using time series models. Comput. Electric. Eng., 2019. DOI:https:\/\/doi.org\/10.1016\/j.compeleceng.2019.04.013"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"C. Matsui C. Sun and K. Takeuchi. 2017. Design of hybrid SSDs with storage class memory and NAND flash memory. In PIEEE\u201917.  C. Matsui C. Sun and K. Takeuchi. 2017. Design of hybrid SSDs with storage class memory and NAND flash memory. In PIEEE\u201917.","DOI":"10.1109\/JPROC.2017.2716958"},{"key":"e_1_2_1_22_1","unstructured":"MSRC Traces. http:\/\/iotta.snia.org\/traces\/388.  MSRC Traces. http:\/\/iotta.snia.org\/traces\/388."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"N. Shahidi M. Arjomand and M. Jung. 2016. Exploring the potentials of parallel garbage collection in SSDs for enterprise storage systems. In SC\u201916.  N. Shahidi M. Arjomand and M. Jung. 2016. Exploring the potentials of parallel garbage collection in SSDs for enterprise storage systems. In SC\u201916.","DOI":"10.1109\/SC.2016.47"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"H. Sorensen D. Jones and M. Heideman. 1987. Real-valued fast Fourier transform algorithms. In TASSP\u201987.  H. Sorensen D. Jones and M. Heideman. 1987. Real-valued fast Fourier transform algorithms. In TASSP\u201987.","DOI":"10.1109\/TASSP.1987.1165220"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"F. Wu J. Zhou and S. Wang. 2018. FastGC: Accelerate garbage collection via an efficient copyback-based data migration in SSDs. In DAC\u201918.  F. Wu J. Zhou and S. Wang. 2018. FastGC: Accelerate garbage collection via an efficient copyback-based data migration in SSDs. In DAC\u201918.","DOI":"10.1109\/DAC.2018.8465931"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"G. Wu and X. He. 2014. Reducing SSD read latency via NAND flash program and erase suspension. In FAST\u201914.  G. Wu and X. He. 2014. Reducing SSD read latency via NAND flash program and erase suspension. In FAST\u201914.","DOI":"10.1016\/j.sysarc.2013.12.002"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"S. Yan H. Li and M. Hao. 2017. Tiny-tail flash: Near-perfect elimination of garbage collection tail latencies in NAND SSDs. In FAST\u201917.  S. Yan H. Li and M. Hao. 2017. Tiny-tail flash: Near-perfect elimination of garbage collection tail latencies in NAND SSDs. In FAST\u201917.","DOI":"10.1145\/3121133"},{"key":"#cr-split#-e_1_2_1_28_1.1","doi-asserted-by":"crossref","unstructured":"Q. Zhang Q. Li and L. Wang. 2015. Lazy-RTGC: A real-time lazy garbage collection mechanism with jointly optimizing average and worst performance for NAND flash memory storage systems. ACM Trans. Des. Automat. Electron. Syst.2015. DOI:https:\/\/doi.org\/10.1145\/2746236 10.1145\/2746236","DOI":"10.1145\/2746236"},{"key":"#cr-split#-e_1_2_1_28_1.2","doi-asserted-by":"crossref","unstructured":"Q. Zhang Q. Li and L. Wang. 2015. Lazy-RTGC: A real-time lazy garbage collection mechanism with jointly optimizing average and worst performance for NAND flash memory storage systems. ACM Trans. Des. Automat. Electron. Syst.2015. DOI:https:\/\/doi.org\/10.1145\/2746236","DOI":"10.1145\/2746236"},{"key":"#cr-split#-e_1_2_1_29_1.1","doi-asserted-by":"crossref","unstructured":"Y. Gala G. Moshe and J. Shehbaz. 2021. SSD-based workload characteristics and their performance implications. ACM Trans. Stor.2021. DOI:https:\/\/doi.org\/10.1145\/3423137 10.1145\/3423137","DOI":"10.1145\/3423137"},{"key":"#cr-split#-e_1_2_1_29_1.2","doi-asserted-by":"crossref","unstructured":"Y. Gala G. Moshe and J. Shehbaz. 2021. SSD-based workload characteristics and their performance implications. ACM Trans. Stor.2021. DOI:https:\/\/doi.org\/10.1145\/3423137","DOI":"10.1145\/3423137"},{"key":"e_1_2_1_30_1","unstructured":"YCSB RocksDB SSD Traces. 2020. Retrieved from http:\/\/iotta.snia.org\/traces\/28568.  YCSB RocksDB SSD Traces. 2020. Retrieved from http:\/\/iotta.snia.org\/traces\/28568."},{"key":"e_1_2_1_31_1","unstructured":"MP5515. Retrieved from https:\/\/www.monolithicpower.com\/en\/mp5515.html.  MP5515. Retrieved from https:\/\/www.monolithicpower.com\/en\/mp5515.html."},{"key":"e_1_2_1_32_1","unstructured":"Samsung 970 EVO Datasheet. Retrieved from https:\/\/www.samsung.com\/semiconductor\/global.semi.static\/Samsung_NVMe_SSD_970_EVO_Data_Sheet_Rev.1.0.pdf.  Samsung 970 EVO Datasheet. Retrieved from https:\/\/www.samsung.com\/semiconductor\/global.semi.static\/Samsung_NVMe_SSD_970_EVO_Data_Sheet_Rev.1.0.pdf."},{"key":"e_1_2_1_33_1","unstructured":"F. Ulaby E. Michielssen and U. Ravaioli. 2010. Fundamentals of Applied Electromagnetics (6th ed.). Prentice Hall.  F. Ulaby E. Michielssen and U. Ravaioli. 2010. Fundamentals of Applied Electromagnetics (6th ed.). Prentice Hall."},{"key":"#cr-split#-e_1_2_1_34_1.1","doi-asserted-by":"crossref","unstructured":"M. Bouksiaa and F. Trahay. 2019. Using differential execution analysis to identify thread interference. IEEE Trans. Parallel Distrib. Syst.2019. DOI:https:\/\/doi.org\/10.1109\/TPDS.2019.2927481 10.1109\/TPDS.2019.2927481","DOI":"10.1109\/TPDS.2019.2927481"},{"key":"#cr-split#-e_1_2_1_34_1.2","doi-asserted-by":"crossref","unstructured":"M. Bouksiaa and F. Trahay. 2019. Using differential execution analysis to identify thread interference. IEEE Trans. Parallel Distrib. Syst.2019. DOI:https:\/\/doi.org\/10.1109\/TPDS.2019.2927481","DOI":"10.1109\/TPDS.2019.2927481"},{"key":"#cr-split#-e_1_2_1_35_1.1","doi-asserted-by":"crossref","unstructured":"B. Mao S. Wu and L. Duan. 2017. Improving the SSD performance by exploiting request characteristics and internal parallelism. J. Technol. Comput. Aided Des.2017. DOI:https:\/\/doi.org\/10.1109\/TCAD.2017.2697961 10.1109\/TCAD.2017.2697961","DOI":"10.1109\/TCAD.2017.2697961"},{"key":"#cr-split#-e_1_2_1_35_1.2","doi-asserted-by":"crossref","unstructured":"B. Mao S. Wu and L. Duan. 2017. Improving the SSD performance by exploiting request characteristics and internal parallelism. J. Technol. Comput. Aided Des.2017. DOI:https:\/\/doi.org\/10.1109\/TCAD.2017.2697961","DOI":"10.1109\/TCAD.2017.2697961"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"T. Chen Y. Chang and C. Ho. 2016. Enabling sub-blocks erase management to boost the performance of 3D NAND flash memory. In DAC\u201916.  T. Chen Y. Chang and C. Ho. 2016. Enabling sub-blocks erase management to boost the performance of 3D NAND flash memory. In DAC\u201916.","DOI":"10.1145\/2897937.2898018"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"H. Chang C. Ho Y. Chang. 2016. How to enable software isolation and boost system performance with sub-block erase over 3D flash memory. In CODES+ISSS\u201916.  H. Chang C. Ho Y. Chang. 2016. How to enable software isolation and boost system performance with sub-block erase over 3D flash memory. In CODES+ISSS\u201916.","DOI":"10.1145\/2968456.2968475"},{"key":"e_1_2_1_38_1","volume-title":"PEN: Design and evaluation of partial-erase for 3D NAND-based high density SSDs. In FAST\u201918.","author":"Liu C.","year":"2018","unstructured":"C. Liu , J. Kotra and M. Jung . 2018 . PEN: Design and evaluation of partial-erase for 3D NAND-based high density SSDs. In FAST\u201918. C. Liu, J. Kotra and M. Jung. 2018. PEN: Design and evaluation of partial-erase for 3D NAND-based high density SSDs. In FAST\u201918."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:04Z","timestamp":1750191424000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12,31]]}},"alternative-id":["10.1145\/3460433"],"URL":"https:\/\/doi.org\/10.1145\/3460433","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,18]]},"assertion":[{"value":"2020-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}