{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:09:25Z","timestamp":1757455765560,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T00:00:00Z","timestamp":1617667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T00:00:00Z","timestamp":1617667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we develop methods to solve two problems related to time series (TS) analysis using quantum computing: reconstruction and classification. We formulate the task of reconstructing a given TS from a training set of data as an unconstrained binary optimization (QUBO) problem, which can be solved by both quantum annealers and gate-model quantum processors. We accomplish this by discretizing the TS and converting the reconstruction to a set cover problem, allowing us to perform a one-versus-all method of reconstruction. Using the solution to the reconstruction problem, we show how to extend this method to perform semi-supervised classification of TS data. We present results indicating our method is competitive with current semi- and unsupervised classification techniques, but using less data than classical techniques.<\/jats:p>","DOI":"10.1007\/s42484-021-00042-0","type":"journal-article","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T09:02:36Z","timestamp":1617699756000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Semi-supervised time series classification method for quantum computing"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1839-3757","authenticated-orcid":false,"given":"Sheir","family":"Yarkoni","sequence":"first","affiliation":[]},{"given":"Andrii","family":"Kleshchonok","sequence":"additional","affiliation":[]},{"given":"Yury","family":"Dzerin","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Neukart","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Hilbert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,6]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Acharya J, Das H, Milenkovic O, Orlitsky A, Pan S (2010) On reconstructing a string from its substring compositions. 1238\u20131242 07","DOI":"10.1109\/ISIT.2010.5513668"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.is.2015.04.007","volume":"53","author":"S Aghabozorgi","year":"2015","unstructured":"Aghabozorgi S, Shirkhorshidi AS, Wah TY (2015) Time-series clustering \u2013 a decade review. Inf Syst 53:16\u201338","journal-title":"Inf Syst"},{"issue":"4","key":"42_CR3","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/080734479","volume":"50","author":"D Aharonov","year":"2008","unstructured":"Aharonov D, Van Dam W, Kempe J, Landau Z, Lloyd S, Regev O (2008) Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev 50(4):755\u2013787","journal-title":"SIAM Rev"},{"issue":"02","key":"42_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10994-012-5316-5","volume":"90","author":"E Aimeur","year":"2013","unstructured":"Aimeur E, Brassard G, Gambs S (2013) Quantum speed-up for unsupervised learning. Mach Learn 90(02):261\u2013287","journal-title":"Mach Learn"},{"issue":"23","key":"42_CR5","first-page":"e215","volume":"101","author":"G AL","year":"2003","unstructured":"AL G, LAN A, L G, JM I, Hausdorff amd PC, RG M, JE M, Moody G, C-K P, Stanley H (2003) Mit-bih long-term ecg database. physionet.org\/content\/ltdb\/1.0.0\/. PhysioBank, PhysioToolkit, and PhysioNet: Components of a New Research Resource for Complex Physiologic Signals. Circulation 101(23):e215-e220","journal-title":"Circulation"},{"key":"42_CR6","unstructured":"Alexander C, Shi L, Akhmametyeva S (2018) Using quantum mechanics to cluster time series. arXiv"},{"issue":"7779","key":"42_CR7","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute F, Arya K, Babbush R, Bacon D, Bardin JC, Barends R, Biswas R, Boixo S, Brandao FG, Buell DA et al (2019) Quantum supremacy using a programmable superconducting processor. Nature 574(7779):505\u2013510","journal-title":"Nature"},{"issue":"3","key":"42_CR8","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10618-016-0483-9","volume":"31","author":"A Bagnall","year":"2017","unstructured":"Bagnall A, Lines J, Bostrom A, Large J, Keogh E (2017) The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Mining Knowl Disc 31 (3):606\u2013660","journal-title":"Data Mining Knowl Disc"},{"key":"42_CR9","unstructured":"Bagnall A, Lines J, Vickers W, Keogh E The uea & ucr time series classification repository. www.timeseriesclassification.com. Accessed: 2020-02-01"},{"issue":"10","key":"42_CR10","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F Barahona","year":"1982","unstructured":"Barahona F (1982) On the computational complexity of ising spin glass models. J Phys A Math Gen 15(10):3241","journal-title":"J Phys A Math Gen"},{"key":"42_CR11","unstructured":"Chinatown DHA (2020). . http:\/\/www.pedestrian.melbourne.vic.gov.au. Accessed: 2020-02-01"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.neucom.2018.03.067","volume":"307","author":"M Christ","year":"2018","unstructured":"Christ M, Braun N, Neuffer J, Kempa-Liehr AW (2018) Time series feature extraction on basis of scalable hypothesis tests (tsfresh \u2013 a python package). Neurocomputing 307:72\u201377","journal-title":"Neurocomputing"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Chu S, Keogh EJ, Hart DM, Pazzani MJ (2002) Iterative deepening dynamic time warping for time series. In: SDM","DOI":"10.1137\/1.9781611972726.12"},{"key":"42_CR14","unstructured":"D-Wave Systems (2021) D-Wave Dimod Package. https:\/\/docs.ocean.dwavesys.com\/projects\/dimod\/"},{"key":"42_CR15","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv:1411.4028"},{"issue":"3-4","key":"42_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1089\/106652799318328","volume":"6","author":"AM Frieze","year":"1999","unstructured":"Frieze AM, Preparata FP, Upfal E (1999) Optimal reconstruction of a sequence from its probes. J Comput Biol 6(3-4):361\u2013368","journal-title":"J Comput Biol"},{"issue":"1","key":"42_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","volume":"24","author":"T Fu","year":"2011","unstructured":"Fu T (2011) A review on time series data mining. Eng Appl Artif Intell 24(1):164\u2013181","journal-title":"Eng Appl Artif Intell"},{"issue":"13","key":"42_CR18","first-page":"13","volume":"68","author":"WH Gomaa","year":"2013","unstructured":"Gomaa WH, Fahmy AA, et al. (2013) A survey of text similarity approaches. Int J Comput Appl 68(13):13\u201318","journal-title":"Int J Comput Appl"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Gonzalez JA, Zolhavarieh S, Aghabozorgi S, Teh YW (2014) A review of subsequence time series clustering. The Scientific World Journal 312521","DOI":"10.1155\/2014\/312521"},{"issue":"1","key":"42_CR20","doi-asserted-by":"publisher","first-page":"3007","DOI":"10.1038\/s41467-019-10988-2","volume":"10","author":"HR Grimsley","year":"2019","unstructured":"Grimsley HR, Economou SE, Barnes E, Mayhall NJ (2019) An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nat Commun 10(1):3007","journal-title":"Nat Commun"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Guo C, Li H, Pan D (2010) An improved piecewise aggregate approximation based on statistical features for time series mining. In: Bi Y, Williams M-A (eds) Knowledge Science, Engineering and Management. Springer, Berlin, pp 234\u2013244","DOI":"10.1007\/978-3-642-15280-1_23"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Hautamaki V, Nykanen P, Franti P (2008) Time-series clustering by approximate prototypes. In: 2008 19th International conference on pattern recognition, pp 1\u20134","DOI":"10.1109\/ICPR.2008.4761105"},{"issue":"4","key":"42_CR23","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/s10618-013-0322-1","volume":"28","author":"J Hills","year":"2014","unstructured":"Hills J, Lines J, Baranauskas E, Mapp J, Bagnall A (2014) Classification of time series by shapelet transformation. Data Min Knowl Disc 28(4):851\u2013881","journal-title":"Data Min Knowl Disc"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Horn D, Gottlieb A (2001) The method of quantum clustering. In: Proceedings of the 14th international conference on neural information processing systems: natural and synthetic, NIPS\u201901, pp769\u2013776, Cambridge, MA, USA, MIT Press","DOI":"10.7551\/mitpress\/1120.003.0103"},{"key":"42_CR25","unstructured":"Iwama K, Teruyama J, Tsuyama S (2018) Reconstructing strings from substrings: Optimal randomized and average-case algorithms. arXiv:1808.00674"},{"issue":"7346","key":"42_CR26","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson MW, Amin MHS, Gildert S, Lanting T, Hamze F, Dickson N, Harris R, Berkley AJ, Johansson J, Bunyk P, Chapple EM, Enderud C, Hilton JP, Karimi K, Ladizinsky E, Ladizinsky N, Oh T, Perminov I, Rich C, Thom MC, Tolkacheva E, Truncik CJS, Uchaikin S, Wang J, Wilson B, Rose G (2011) Quantum annealing with manufactured spins. Nature 473(7346):194\u2013198","journal-title":"Nature"},{"key":"42_CR27","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki T, Nishimori H (1998) Quantum annealing in the transverse ising model. Phys Rev E 58:5355\u20135363","journal-title":"Phys Rev E"},{"key":"42_CR28","doi-asserted-by":"crossref","unstructured":"Karp R (1972) Reducibility among combinatorial problems, volume 85. Complexity of Computer Computations","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"42_CR29","unstructured":"Keogh E, Lin J, Fu A (2005) Hot sax: Efficiently finding the most unusual time series subsequence. In: Proceedings of the Fifth IEEE international conference on data mining, ICDM \u201905, pp 226\u2013233, USA, IEEE Computer Society"},{"issue":"2","key":"42_CR30","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s11128-017-1809-2","volume":"17","author":"V Kumar","year":"2018","unstructured":"Kumar V, Bass G, Tomlin C, Dulny J (2018) Quantum annealing for combinatorial clustering. Quantum Inf Process 17(2):39","journal-title":"Quantum Inf Process"},{"issue":"11","key":"42_CR31","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","volume":"38","author":"TW Liao","year":"2005","unstructured":"Liao TW (2005) Clustering of time series data\u2014a survey. Pattern Recogn 38(11):1857\u20131874","journal-title":"Pattern Recogn"},{"key":"42_CR32","doi-asserted-by":"crossref","unstructured":"Lin J, Keogh E, Lonardi S, Chiu B (2003) A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD workshop on research issues in data mining and knowledge Discovery, DMKD \u201903, page 2\u201311, New York, NY, USA. Association for Computing Machinery","DOI":"10.1145\/882082.882086"},{"key":"42_CR33","unstructured":"Lin J, Keogh E, Lonardi S, Patel P (2002) Finding motifs in time series. Proceedings of the Second Workshop on Temporal Data Mining 10"},{"key":"42_CR34","unstructured":"Lloyd S, Mohseni M, Rebentrost P (2013) Quantum algorithms for supervised and unsupervised machine learning"},{"key":"42_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas A (2014) Ising formulations of many np problems. Front Phys 2:5","journal-title":"Front Phys"},{"issue":"1","key":"42_CR36","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1038\/s41534-019-0209-0","volume":"5","author":"AJ McCaskey","year":"2019","unstructured":"McCaskey AJ, Parks ZP, Jakowski J, Moore SV, Morris TD, Humble TS, Pooser RC (2019) Quantum chemistry as a benchmark for near-term quantum computers. npj Quantum Inform 5(1):99","journal-title":"npj Quantum Inform"},{"key":"42_CR37","doi-asserted-by":"crossref","unstructured":"Mueen A, Keogh E, Young N (2011) Logical-shapelets: an expressive primitive for time series classification. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1154\u20131162. ACM","DOI":"10.1145\/2020408.2020587"},{"key":"42_CR38","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3389\/fict.2017.00029","volume":"4","author":"F Neukart","year":"2017","unstructured":"Neukart F, Compostella G, Seidel C, von Dollen D, Yarkoni S, Parney B (2017) Traffic flow optimization using a quantum annealer. Frontiers in ICT 4:29","journal-title":"Frontiers in ICT"},{"key":"42_CR39","doi-asserted-by":"publisher","first-page":"55","DOI":"10.3389\/fphy.2018.00055","volume":"6","author":"F Neukart","year":"2018","unstructured":"Neukart F, Dollen DV, Seidel C (2018) Quantum-assisted cluster analysis on a quantum annealing device. Front Phys 6:55","journal-title":"Front Phys"},{"key":"42_CR40","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3389\/fcomp.2019.00002","volume":"1","author":"N Nishimura","year":"2019","unstructured":"Nishimura N, Tanahashi K, Suganuma K, Miyama MJ, Ohzeki M (2019) Item listing optimization for e-commerce websites based on diversity. Front Comput Sci 1:2","journal-title":"Front Comput Sci"},{"key":"42_CR41","doi-asserted-by":"crossref","unstructured":"Patel P, Keogh EJ, Lin J, Lonardi S (2002) Mining motifs in massive time series databases. . In: 2002 IEEE International conference on data mining, 2002. Proceedings, pp 370\u2013377","DOI":"10.1109\/ICDM.2002.1183925"},{"key":"42_CR42","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum Computing in the NISQ era and beyond. Quantum 2:79","journal-title":"Quantum"},{"key":"42_CR43","doi-asserted-by":"crossref","unstructured":"Ratanamahatana CA, Keogh EJ (2005) Three myths about dynamic time warping data mining. In: Kargupta H, Srivastava J, Kamath C, Goodman A (eds) SDM, pp 506\u2013510. SIAM","DOI":"10.1137\/1.9781611972757.50"},{"key":"42_CR44","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3389\/fict.2016.00023","volume":"3","author":"J Raymond","year":"2016","unstructured":"Raymond J, Yarkoni S, Andriyash E (2016) Global warming: Temperature estimation in annealers. Front ICT 3:23","journal-title":"Front ICT"},{"issue":"1","key":"42_CR45","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoust Speech Signal Process 26(1):43\u201349","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"42_CR46","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer P, H\u00f6gqvist M (2012) Sfa: a symbolic fourier approximation and index for similarity search in high dimensional datasets. In: Proceedings of the 15th International conference on extending database technology, pp 516\u2013527. ACM","DOI":"10.1145\/2247596.2247656"},{"issue":"1","key":"42_CR47","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/3051126","volume":"12","author":"P Senin","year":"2018","unstructured":"Senin P, Lin J, Wang X, Oates T, Gandhi S, Boedihardjo AP, Chen C, Frankenstein S. (2018) Grammarviz 3.0: Interactive discovery of variable-length time series patterns. ACM Trans Knowl Discov Data 12(1):10:1\u201310:28","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"2","key":"42_CR48","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1089\/cmb.1995.2.333","volume":"2","author":"SS Skiena","year":"1995","unstructured":"Skiena SS, Sundaram G (1995) Reconstructing strings from substrings. J Comput Biol 2 (2):333\u2013353","journal-title":"J Comput Biol"},{"issue":"1","key":"42_CR49","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TITS.2019.2891235","volume":"21","author":"T Stollenwerk","year":"2020","unstructured":"Stollenwerk T, O\u2019Gorman B, Venturelli D, Mandr\u00e0 S, Rodionova O, Ng H, Sridhar B, Rieffel EG, Biswas R (2020) Quantum annealing applied to de-conflicting optimal trajectories for air traffic management. IEEE Trans Intell Transp Syst 21(1):285\u2013297","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"42_CR50","doi-asserted-by":"crossref","unstructured":"Streif M, Neukart F, Leib M (2019) Solving quantum chemistry problems with a d-wave quantum annealer. In: Feld S, Linnhoff-Popien C (eds) Quantum technology and optimization problems. Springer International Publishing, Cham, pp 111\u2013122","DOI":"10.1007\/978-3-030-14082-3_10"},{"key":"42_CR51","doi-asserted-by":"crossref","unstructured":"Van Dam W, Mosca M, Vazirani U (2001) How powerful is adiabatic quantum computation?. In: Proceedings 42nd IEEE symposium on foundations of computer science. pp 279\u2013287 IEEE","DOI":"10.1109\/SFCS.2001.959902"},{"issue":"1","key":"42_CR52","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s42484-019-00001-w","volume":"1","author":"D Venturelli","year":"2019","unstructured":"Venturelli D, Kondratyev A (2019) Reverse quantum annealing approach to portfolio optimization problems. Quantum Mach Intell 1(1):17\u201330","journal-title":"Quantum Mach Intell"},{"key":"42_CR53","unstructured":"Venturelli D, Marchand DJ, Rojo G (2015) Quantum annealing implementation of job-shop scheduling. arXiv:1506.08479"},{"key":"42_CR54","unstructured":"Verdon G, Broughton M, Biamonte J (2017) A quantum algorithm to train neural networks using low-depth circuits"},{"key":"42_CR55","doi-asserted-by":"crossref","unstructured":"Vlachos M, Gunopulos D, Kollios G (2002) Discovering similar multidimensional trajectories. In: Proceedings 18th international conference on data engineering. pp 673\u2013684","DOI":"10.1109\/ICDE.2002.994784"},{"issue":"1","key":"42_CR56","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1038\/s41597-020-0495-6","volume":"7","author":"P Wagner","year":"2020","unstructured":"Wagner P, Strodthoff N, Bousseljot R-D, Kreiseler D, Lunze FI, Samek W, Schaeffter T (2020) Ptb-xl, a large publicly available electrocardiography dataset. Scient Data 7(1):154","journal-title":"Scient Data"},{"key":"42_CR57","doi-asserted-by":"publisher","first-page":"318","DOI":"10.26421\/QIC15.3-4-7","volume":"15","author":"N Wiebe","year":"2015","unstructured":"Wiebe N, Kapoor A, Svore K (2015) Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning. Quantum Inform Comput 15:318\u2013358 03","journal-title":"Quantum Inform Comput"},{"key":"42_CR58","unstructured":"Xiaodong F, Changling C, Changling L, Shao H (2002) An improved process data compression algorithm. In: Proceedings of the 4th world congress on intelligent control and automation (Cat. no.02EX527) volume 3, vol 3, pp 2190\u20132193"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-021-00042-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-021-00042-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-021-00042-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T17:07:34Z","timestamp":1724778454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-021-00042-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,6]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s42484-021-00042-0","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"type":"print","value":"2524-4906"},{"type":"electronic","value":"2524-4914"}],"subject":[],"published":{"date-parts":[[2021,4,6]]},"assertion":[{"value":"23 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}