{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T12:27:59Z","timestamp":1780489679932,"version":"3.54.1"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T00:00:00Z","timestamp":1594512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP19K20213, JP18F18120"],"award-info":[{"award-number":["JP19K20213, JP18F18120"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2020,10,31]]},"abstract":"<jats:p>\n            Given a text\n            <jats:italic>T<\/jats:italic>\n            of length\n            <jats:italic>n<\/jats:italic>\n            , we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of\n            <jats:italic>T<\/jats:italic>\n            in O(\n            <jats:italic>c<\/jats:italic>\n            \u221a lg\n            <jats:italic>n<\/jats:italic>\n            +\n            <jats:italic>m<\/jats:italic>\n            lg\n            <jats:italic>m<\/jats:italic>\n            lg\n            <jats:italic>n<\/jats:italic>\n            lg\n            <jats:sup>*<\/jats:sup>\n            <jats:italic>n<\/jats:italic>\n            ) time with O(\n            <jats:italic>m<\/jats:italic>\n            ) words of space under the premise that the space of\u00a0\n            <jats:italic>T<\/jats:italic>\n            is rewritable, where\n            <jats:italic>m<\/jats:italic>\n            \u2264\n            <jats:italic>n<\/jats:italic>\n            is the number of suffixes to be sorted (provided online and arbitrarily), and\n            <jats:italic>c<\/jats:italic>\n            is the number of characters with\n            <jats:italic>m<\/jats:italic>\n            \u2264\n            <jats:italic>c<\/jats:italic>\n            \u2264\n            <jats:italic>n<\/jats:italic>\n            that must be compared for distinguishing the designated suffixes.\n          <\/jats:p>","DOI":"10.1145\/3398681","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T12:39:25Z","timestamp":1594125565000},"page":"1-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Deterministic Sparse Suffix Sorting in the Restore Model"],"prefix":"10.1145","volume":"16","author":[{"given":"Johannes","family":"Fischer","sequence":"first","affiliation":[{"name":"Department of Computer Science, TU Dortmund, Dortmund, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomohiro","family":"I","sequence":"additional","affiliation":[{"name":"Kyushu Institute of Technology, Kawazu, Iizuka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-4444","authenticated-orcid":false,"given":"Dominik","family":"K\u00f6ppl","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Kyushu University, Fukuoka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the SODA. 819--828","author":"Alstrup Stephen","year":"2000","unstructured":"Stephen Alstrup , Gerth St\u00f8lting Brodal , and Theis Rauhe . 2000 . Pattern matching in dynamic texts . In Proceedings of the SODA. 819--828 . Stephen Alstrup, Gerth St\u00f8lting Brodal, and Theis Rauhe. 2000. Pattern matching in dynamic texts. In Proceedings of the SODA. 819--828."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365721"},{"key":"e_1_2_1_3_1","volume-title":"Encyclopedia of Algorithms","author":"Bannai Hideo","unstructured":"Hideo Bannai . 2016. Grammar compression . In Encyclopedia of Algorithms . Springer , 861--866. Hideo Bannai. 2016. Grammar compression. In Encyclopedia of Algorithms. Springer, 861--866."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the SODA. 360--369","author":"Bentley Jon Louis","year":"1997","unstructured":"Jon Louis Bentley and Robert Sedgewick . 1997 . Fast algorithms for sorting and searching strings . In Proceedings of the SODA. 360--369 . Jon Louis Bentley and Robert Sedgewick. 1997. Fast algorithms for sorting and searching strings. In Proceedings of the SODA. 360--369."},{"key":"e_1_2_1_5_1","article-title":"Sparse text indexing in small space","volume":"12","author":"Bille Philip","year":"2016","unstructured":"Philip Bille , Johannes Fischer , Inge Li G\u00f8rtz , Tsvi Kopelowitz , Benjamin Sach , and Hjalte Wedel Vildh\u00f8j . 2016 . Sparse text indexing in small space . ACM Trans. Algor. 12 , 3 (2016), 39:1--39:19. Philip Bille, Johannes Fischer, Inge Li G\u00f8rtz, Tsvi Kopelowitz, Benjamin Sach, and Hjalte Wedel Vildh\u00f8j. 2016. Sparse text indexing in small space. ACM Trans. Algor. 12, 3 (2016), 39:1--39:19.","journal-title":"ACM Trans. Algor."},{"key":"e_1_2_1_6_1","first-page":"65","article-title":"Longest common extensions in sublinear space","volume":"9133","author":"Bille Philip","year":"2015","unstructured":"Philip Bille , Inge Li G\u00f8rtz , Mathias B\u00e6k Tejs Knudsen , Moshe Lewenstein , and Hjalte Wedel Vildh\u00f8j . 2015 . Longest common extensions in sublinear space . In Proceedings of the CPM (LNCS) , Vol. 9133. 65 -- 76 . Philip Bille, Inge Li G\u00f8rtz, Mathias B\u00e6k Tejs Knudsen, Moshe Lewenstein, and Hjalte Wedel Vildh\u00f8j. 2015. Longest common extensions in sublinear space. In Proceedings of the CPM (LNCS), Vol. 9133. 65--76.","journal-title":"Proceedings of the CPM (LNCS)"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2013.06.003"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.74"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00080-6"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the SODA. 321--330","author":"Cormode Graham","unstructured":"Graham Cormode and S. Muthukrishnan . 2005. Substring compression problems . In Proceedings of the SODA. 321--330 . Graham Cormode and S. Muthukrishnan. 2005. Substring compression problems. In Proceedings of the SODA. 321--330."},{"key":"e_1_2_1_11_1","article-title":"The string edit distance matching problem with moves","volume":"3","author":"Cormode Graham","year":"2007","unstructured":"Graham Cormode and S. Muthukrishnan . 2007 . The string edit distance matching problem with moves . ACM Trans. Algor. 3 , 1 (2007), 2:1--2:19. Graham Cormode and S. Muthukrishnan. 2007. The string edit distance matching problem with moves. ACM Trans. Algor. 3, 1 (2007), 2:1--2:19.","journal-title":"ACM Trans. Algor."},{"key":"e_1_2_1_12_1","first-page":"483","article-title":"Deterministic sparse suffix sorting on rewritable texts","volume":"9644","author":"Fischer Johannes","year":"2016","unstructured":"Johannes Fischer , Tomohiro I, and Dominik K\u00f6ppl . 2016 . Deterministic sparse suffix sorting on rewritable texts . In Proceedings of the LATIN (LNCS) , Vol. 9644. 483 -- 496 . Johannes Fischer, Tomohiro I, and Dominik K\u00f6ppl. 2016. Deterministic sparse suffix sorting on rewritable texts. In Proceedings of the LATIN (LNCS), Vol. 9644. 483--496.","journal-title":"Proceedings of the LATIN (LNCS)"},{"key":"e_1_2_1_13_1","article-title":"No sorting? Better searching! ACM","volume":"4","author":"Franceschini Gianni","year":"2008","unstructured":"Gianni Franceschini and Roberto Grossi . 2008 . No sorting? Better searching! ACM Trans. Algor. 4 , 1 (2008), 2:1--2:13. Gianni Franceschini and Roberto Grossi. 2008. No sorting? Better searching! ACM Trans. Algor. 4, 1 (2008), 2:1--2:13.","journal-title":"Trans. Algor."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the International Conference on Grammatical Inference (Workshop and Conference Proceedings)","volume":"57","author":"Fukunaga Shouhei","year":"2016","unstructured":"Shouhei Fukunaga , Yoshimasa Takabatake , Tomohiro I, and Hiroshi Sakamoto . 2016 . Online grammar compression for frequent pattern discovery . In Proceedings of the International Conference on Grammatical Inference (Workshop and Conference Proceedings) , Vol. 57 . 93--104. Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, and Hiroshi Sakamoto. 2016. Online grammar compression for frequent pattern discovery. In Proceedings of the International Conference on Grammatical Inference (Workshop and Conference Proceedings), Vol. 57. 93--104."},{"key":"e_1_2_1_15_1","first-page":"1","article-title":"Edit distance with block operations","volume":"112","author":"Ganczorz Michal","year":"2018","unstructured":"Michal Ganczorz , Pawel Gawrychowski , Artur Jez , and Tomasz Kociumaka . 2018 . Edit distance with block operations . In Proceedings of the ESA (LIPIcs) , Vol. 112. 33: 1 -- 33 :14. Michal Ganczorz, Pawel Gawrychowski, Artur Jez, and Tomasz Kociumaka. 2018. Edit distance with block operations. In Proceedings of the ESA (LIPIcs), Vol. 112. 33:1--33:14.","journal-title":"Proceedings of the ESA (LIPIcs)"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.99"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.27"},{"key":"e_1_2_1_18_1","volume-title":"Shannon","author":"Goldberg Andrew V.","year":"1987","unstructured":"Andrew V. Goldberg , Serge A. Plotkin , and Gregory E . Shannon . 1987 . Parallel symmetry-breaking in sparse graphs. In Proceedings of the STOC. 315--324. Andrew V. Goldberg, Serge A. Plotkin, and Gregory E. Shannon. 1987. Parallel symmetry-breaking in sparse graphs. In Proceedings of the STOC. 315--324."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the PSC. 111--125","author":"Goto Keisuke","year":"2019","unstructured":"Keisuke Goto . 2019 . Optimal time and space construction of suffix arrays and LCP arrays for integer alphabets . In Proceedings of the PSC. 111--125 . Keisuke Goto. 2019. Optimal time and space construction of suffix arrays and LCP arrays for integer alphabets. In Proceedings of the PSC. 111--125."},{"key":"e_1_2_1_20_1","first-page":"1","article-title":"Longest common extensions with recompression","volume":"78","author":"Tomohiro","year":"2017","unstructured":"Tomohiro I. 2017 . Longest common extensions with recompression . In Proceedings of the CPM (LIPIcs) , Vol. 78. 18: 1 -- 18 :15. Tomohiro I. 2017. Longest common extensions with recompression. In Proceedings of the CPM (LIPIcs), Vol. 78. 18:1--18:15.","journal-title":"Proceedings of the CPM (LIPIcs)"},{"key":"e_1_2_1_21_1","first-page":"386","article-title":"Faster sparse suffix sorting","volume":"25","author":"Tomohiro","year":"2014","unstructured":"Tomohiro I, Juha K\u00e4rkk\u00e4inen , and Dominik Kempa . 2014 . Faster sparse suffix sorting . In Proceedings of the STACS (LIPIcs) , Vol. 25. 386 -- 396 . Tomohiro I, Juha K\u00e4rkk\u00e4inen, and Dominik Kempa. 2014. Faster sparse suffix sorting. In Proceedings of the STACS (LIPIcs), Vol. 25. 386--396.","journal-title":"Proceedings of the STACS (LIPIcs)"},{"key":"e_1_2_1_22_1","first-page":"5","article-title":"The suffix binary search tree and suffix AVL tree","volume":"1","author":"Irving Robert W.","year":"2003","unstructured":"Robert W. Irving and Lorna Love . 2003 . The suffix binary search tree and suffix AVL tree . J. Disc. Algor. 1 , 5 -- 6 (2003), 387--408. Robert W. Irving and Lorna Love. 2003. The suffix binary search tree and suffix AVL tree. J. Disc. Algor. 1, 5--6 (2003), 387--408.","journal-title":"J. Disc. Algor."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_2_1_24_1","first-page":"204","article-title":"LCP array construction using (or less) I\/Os","volume":"9954","author":"K\u00e4rkk\u00e4inen Juha","year":"2016","unstructured":"Juha K\u00e4rkk\u00e4inen and Dominik Kempa . 2016 . LCP array construction using (or less) I\/Os . In Proceedings of the SPIRE (LNCS) , Vol. 9954. 204 -- 217 . Juha K\u00e4rkk\u00e4inen and Dominik Kempa. 2016. LCP array construction using (or less) I\/Os. In Proceedings of the SPIRE (LNCS), Vol. 9954. 204--217.","journal-title":"Proceedings of the SPIRE (LNCS)"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217858"},{"key":"e_1_2_1_26_1","first-page":"219","article-title":"Sparse suffix trees","volume":"1090","author":"K\u00e4rkk\u00e4inen Juha","year":"1996","unstructured":"Juha K\u00e4rkk\u00e4inen and Esko Ukkonen . 1996 . Sparse suffix trees . In Proceedings of the COCOON (LNCS) , Vol. 1090. 219 -- 230 . Juha K\u00e4rkk\u00e4inen and Esko Ukkonen. 1996. Sparse suffix trees. In Proceedings of the COCOON (LNCS), Vol. 1090. 219--230.","journal-title":"Proceedings of the COCOON (LNCS)"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp275"},{"key":"e_1_2_1_28_1","volume-title":"Starikovskaya","author":"Kolpakov Roman","year":"2011","unstructured":"Roman Kolpakov , Gregory Kucherov , and Tatiana A . Starikovskaya . 2011 . Pattern matching on sparse suffix trees. In Proceedings of the Data Compression, Communications and Processing . 92--97. Roman Kolpakov, Gregory Kucherov, and Tatiana A. Starikovskaya. 2011. Pattern matching on sparse suffix trees. In Proceedings of the Data Compression, Communications and Processing. 92--97."},{"key":"e_1_2_1_29_1","volume-title":"Optimal in-place suffix sorting. ArXiv abs\/1610.08305","author":"Li Zhize","year":"2016","unstructured":"Zhize Li , Jian Li , and Hongwei Huo . 2016. Optimal in-place suffix sorting. ArXiv abs\/1610.08305 ( 2016 ). Zhize Li, Jian Li, and Hongwei Huo. 2016. Optimal in-place suffix sorting. ArXiv abs\/1610.08305 (2016)."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2012.07.009"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the SODA. 213--222","author":"Mehlhorn Kurt","year":"1994","unstructured":"Kurt Mehlhorn , R. Sundar , and Christian Uhrig . 1994 . Maintaining dynamic sequences under equality-tests in polylogarithmic time . In Proceedings of the SODA. 213--222 . Kurt Mehlhorn, R. Sundar, and Christian Uhrig. 1994. Maintaining dynamic sequences under equality-tests in polylogarithmic time. In Proceedings of the SODA. 213--222."},{"key":"e_1_2_1_32_1","first-page":"1","article-title":"Fully dynamic data structure for LCE queries in compressed space","volume":"58","author":"Nishimoto Takaaki","year":"2016","unstructured":"Takaaki Nishimoto , Tomohiro I, Shunsuke Inenaga , Hideo Bannai , and Masayuki Takeda . 2016 . Fully dynamic data structure for LCE queries in compressed space . In Proceedings of the MFCS (LIPIcs) , Vol. 58. 72: 1 -- 72 :15. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. 2016. Fully dynamic data structure for LCE queries in compressed space. In Proceedings of the MFCS (LIPIcs), Vol. 58. 72:1--72:15.","journal-title":"Proceedings of the MFCS (LIPIcs)"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.188"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369909"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.98"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242471.1242472"},{"key":"e_1_2_1_37_1","volume-title":"Encyclopedia of Algorithms","author":"Rahman Naila","unstructured":"Naila Rahman and Rajeev Raman . 2008. Rank and select operations on binary strings . In Encyclopedia of Algorithms . Springer , 748--751. Naila Rahman and Rajeev Raman. 2008. Rank and select operations on binary strings. In Encyclopedia of Algorithms. Springer, 748--751."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195164"},{"key":"e_1_2_1_39_1","volume-title":"A space-saving approximation algorithm for grammar-based compression. IEICE Trans. 92-D, 2","author":"Sakamoto Hiroshi","year":"2009","unstructured":"Hiroshi Sakamoto , Shirou Maruyama , Takuya Kida , and Shinichi Shimozono . 2009. A space-saving approximation algorithm for grammar-based compression. IEICE Trans. 92-D, 2 ( 2009 ), 158--165. Hiroshi Sakamoto, Shirou Maruyama, Takuya Kida, and Shinichi Shimozono. 2009. A space-saving approximation algorithm for grammar-based compression. IEICE Trans. 92-D, 2 (2009), 158--165."},{"key":"e_1_2_1_40_1","volume-title":"siEDM: An efficient string index and search algorithm for edit distance with moves. Algorithms 9, 2","author":"Takabatake Yoshimasa","year":"2016","unstructured":"Yoshimasa Takabatake , Kenta Nakashima , Tetsuji Kuboyama , Yasuo Tabei , and Hiroshi Sakamoto . 2016. siEDM: An efficient string index and search algorithm for edit distance with moves. Algorithms 9, 2 ( 2016 ), 26:1--26:18. Yoshimasa Takabatake, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, and Hiroshi Sakamoto. 2016. siEDM: An efficient string index and search algorithm for edit distance with moves. Algorithms 9, 2 (2016), 26:1--26:18."},{"key":"e_1_2_1_41_1","first-page":"338","article-title":"Improved ESP-index: A practical self-index for highly repetitive texts","volume":"8504","author":"Takabatake Yoshimasa","year":"2014","unstructured":"Yoshimasa Takabatake , Yasuo Tabei , and Hiroshi Sakamoto . 2014 . Improved ESP-index: A practical self-index for highly repetitive texts . In Proceedings of the SEA (LNCS) , Vol. 8504. 338 -- 350 . Yoshimasa Takabatake, Yasuo Tabei, and Hiroshi Sakamoto. 2014. Improved ESP-index: A practical self-index for highly repetitive texts. In Proceedings of the SEA (LNCS), Vol. 8504. 338--350.","journal-title":"Proceedings of the SEA (LNCS)"},{"key":"e_1_2_1_42_1","first-page":"1","article-title":"Deterministic sub-linear space LCE data structures with efficient construction","volume":"54","author":"Tanimura Yuka","year":"2016","unstructured":"Yuka Tanimura , Tomohiro I, Hideo Bannai , Shunsuke Inenaga , Simon J. Puglisi , and Masayuki Takeda . 2016 . Deterministic sub-linear space LCE data structures with efficient construction . In Proceedings of the CPM (LIPIcs) , Vol. 54. 1: 1 -- 1 :10. Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, and Masayuki Takeda. 2016. Deterministic sub-linear space LCE data structures with efficient construction. In Proceedings of the CPM (LIPIcs), Vol. 54. 1:1--1:10.","journal-title":"Proceedings of the CPM (LIPIcs)"},{"key":"e_1_2_1_43_1","first-page":"1","article-title":"Small-space LCE data structure with constant-time queries","volume":"83","author":"Tanimura Yuka","year":"2017","unstructured":"Yuka Tanimura , Takaaki Nishimoto , Hideo Bannai , Shunsuke Inenaga , and Masayuki Takeda . 2017 . Small-space LCE data structure with constant-time queries . In Proceedings of the MFCS (LIPIcs) , Vol. 83. 10: 1 -- 10 :15. Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda. 2017. Small-space LCE data structure with constant-time queries. In Proceedings of the MFCS (LIPIcs), Vol. 83. 10:1--10:15.","journal-title":"Proceedings of the MFCS (LIPIcs)"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt042"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3398681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:31Z","timestamp":1750199611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,12]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10,31]]}},"alternative-id":["10.1145\/3398681"],"URL":"https:\/\/doi.org\/10.1145\/3398681","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,12]]},"assertion":[{"value":"2018-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}