{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:04:18Z","timestamp":1764842658740,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN 400673-2012"],"award-info":[{"award-number":["RGPIN 400673-2012"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00453-022-01047-2","type":"journal-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T09:02:46Z","timestamp":1667552566000},"page":"1754-1785","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Constructing the first (and coolest) fixed-content universal\u00a0cycle"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7364-2993","authenticated-orcid":false,"given":"Joe","family":"Sawada","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6816-4368","authenticated-orcid":false,"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"issue":"1","key":"1047_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/net.21591","volume":"65","author":"T Avila","year":"2015","unstructured":"Avila, T., Corber\u00e1n, A., Plana, I., Sanchis, J.M.: The stacker crane problem and the directed general routing problem. Networks 65(1), 43\u201355 (2015)","journal-title":"Networks"},{"issue":"4\/5","key":"1047_CR2","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"KS Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4\/5), 240\u2013242 (1980)","journal-title":"Inf. Process. Lett."},{"issue":"R4","key":"1047_CR3","first-page":"1","volume":"17","author":"G Brockman","year":"2010","unstructured":"Brockman, G., Kay, B., Snively, E.E.: On universal cycles of labeled graphs. Electron. J. Comb. 17(R4), 1 (2010)","journal-title":"Electron. J. Comb."},{"key":"1047_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2021.102166","volume":"127","author":"A Cantwell","year":"2021","unstructured":"Cantwell, A., Geraci, J., Godbole, A., Padilla, C.: Graph universal cycles of combinatorial objects. Adv. Appl. Math. 127, 102166 (2021)","journal-title":"Adv. Appl. Math."},{"issue":"6","key":"1047_CR5","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s11390-007-9094-7","volume":"22","author":"Y Cheng","year":"2007","unstructured":"Cheng, Y.: Generating combinations by three basic operations. J. Comput. Sci. Technol. 22(6), 909\u2013913 (2007)","journal-title":"J. Comput. Sci. Technol."},{"issue":"1","key":"1047_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"F Chung","year":"1992","unstructured":"Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discret. Math. 110(1), 43\u201359 (1992)","journal-title":"Discret. Math."},{"issue":"3\u20134","key":"1047_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1080\/03081089308818261","volume":"35","author":"RC Compton","year":"1993","unstructured":"Compton, R.C., Gill Williamson, S.: Doubly adjacent gray codes for the symmetric group. Linear Multilinear Algebra 35(3\u20134), 237\u2013293 (1993)","journal-title":"Linear Multilinear Algebra"},{"issue":"05","key":"1047_CR8","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/71.159045","volume":"3","author":"PF Corbett","year":"1992","unstructured":"Corbett, P.F.: Rotator graphs: an efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel Distrib. Syst. 3(05), 622\u2013626 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1047_CR9","first-page":"758","volume":"49","author":"NG de Bruijn","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Proc. Koninklijke Nederlandse Academie van Wetenschappen 49, 758\u2013764 (1946)","journal-title":"Proc. Koninklijke Nederlandse Academie van Wetenschappen"},{"key":"1047_CR10","unstructured":"de Bruijn, N. G.: Acknowledgement of priority to c. flye sainte-marie on the counting of circular arrangements of $$2^{n}$$ zeros and ones that show each n-letter word exactly once. (1975)"},{"key":"1047_CR11","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Graham, R.\u00a0L.: Products of universal cycles, In A Lifetime of Puzzles. Demaine, E., Demaine, M., Rodgers, T.: eds., A K Peters\/CRC Press, pp 35\u201355, (2008)","DOI":"10.1201\/b10573-6"},{"key":"1047_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2018.03.006","volume":"72","author":"PB Dragon","year":"2018","unstructured":"Dragon, P.B., Hernandez, O.I., Sawada, J., Williams, A., Wong, D.: Constructing de Bruijn sequences with co-lexicographic order: The k-ary grandmama sequence. Eur. J. Comb. 72, 1\u201311 (2018)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"1047_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0196-6774(86)90025-8","volume":"7","author":"T Etzion","year":"1986","unstructured":"Etzion, T.: An algorithm for constructing $$m$$-ary de Bruijn sequences. J. Algorithms 7(3), 331\u2013340 (1986)","journal-title":"J. Algorithms"},{"issue":"3","key":"1047_CR14","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/TIT.1984.1056919","volume":"30","author":"T Etzion","year":"1984","unstructured":"Etzion, T., Lempel, A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inform. Theory 30(3), 480\u2013484 (1984)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1047_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(86)90089-0","volume":"61","author":"H Fredricksen","year":"1986","unstructured":"Fredricksen, H., Kessler, I.: An algorithm for generating necklaces of beads in two colors. Discrete Math. 61(2), 181\u2013188 (1986)","journal-title":"Discrete Math."},{"key":"1047_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in $$k$$ colors and $$k$$-ary de Bruijn sequences. Discrete Math. 23, 207\u2013210 (1978)","journal-title":"Discrete Math."},{"key":"1047_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2018.06.039","volume":"743","author":"D Gabric","year":"2018","unstructured":"Gabric, D., Sawada, J.: Constructing de Bruijn sequences by concatenating smaller universal cycles. Theoret. Comput. Sci. 743, 12\u201322 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"1047_CR18","doi-asserted-by":"publisher","first-page":"2977","DOI":"10.1016\/j.disc.2018.07.010","volume":"341","author":"D Gabric","year":"2018","unstructured":"Gabric, D., Sawada, J., Williams, A., Wong, D.: A framework for constructing de Bruijn sequences via simple successor rules. Discret. Math. 341(11), 2977\u20132987 (2018)","journal-title":"Discret. Math."},{"issue":"1","key":"1047_CR19","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.2019.2928292","volume":"66","author":"D Gabric","year":"2020","unstructured":"Gabric, D., Sawada, J., Williams, A., Wong, D.: A successor rule framework for constructing $$k$$-ary de Bruijn sequences and universal cycles. IEEE Trans. Inf. Theory 66(1), 679\u2013687 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"01","key":"1047_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1142\/S0129054119400033","volume":"30","author":"AL Gao","year":"2019","unstructured":"Gao, A.L., Kitaev, S., Steiner, W., Zhang, P.B.: On a greedy algorithm to construct universal cycles for permutations. Int. J. Found. Comput. Sci. 30(01), 61\u201372 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"1047_CR21","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1215\/ijm\/1255631587","volume":"5","author":"EN Gilbert","year":"1961","unstructured":"Gilbert, E.N., Riordan, J.: Symmetry types of periodic sequences. Illinois J. Math. 5(4), 657\u2013665 (1961)","journal-title":"Illinois J. Math."},{"key":"1047_CR22","doi-asserted-by":"crossref","unstructured":"Golomb, S.\u00a0W.: Shift register sequences: secure and limited-access code generators, efficiency code generators, prescribed property generators, mathematical models. World Scientific, 3rd edition, (2017)","DOI":"10.1142\/9361"},{"key":"1047_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C.: Ueber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Math. Ann. 6, 30\u201332 (1873)","journal-title":"Math. Ann."},{"issue":"2","key":"1047_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00453-011-9544-z","volume":"64","author":"AE Holroyd","year":"2012","unstructured":"Holroyd, A.E., Ruskey, F., Williams, A.: Shorthand universal cycles for permutations. Algorithmica 64(2), 215\u2013245 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"1047_CR25","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1137\/120886807","volume":"27","author":"V Horan","year":"2013","unstructured":"Horan, V., Hurlbert, G.: Universal cycles for weak orders. SIAM J. Discrete Math. 27(3), 1360\u20131371 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"17","key":"1047_CR26","doi-asserted-by":"publisher","first-page":"5341","DOI":"10.1016\/j.disc.2009.04.002","volume":"309","author":"B Jackson","year":"2009","unstructured":"Jackson, B., Stevens, B., Hurlbert, G.: Research problems on Gray codes and universal cycles. Discret. Math. 309(17), 5341\u20135348 (2009)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"1047_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(93)90330-V","volume":"117","author":"BW Jackson","year":"1993","unstructured":"Jackson, B.W.: Universal cycles of k-subsets and k-permutations. Discret. Math. 117(1\u20133), 141\u2013150 (1993)","journal-title":"Discret. Math."},{"issue":"17","key":"1047_CR28","doi-asserted-by":"publisher","first-page":"5264","DOI":"10.1016\/j.disc.2007.11.004","volume":"309","author":"JR Johnson","year":"2009","unstructured":"Johnson, J.R.: Universal cycles for permutations. Discret. Math. 309(17), 5264\u20135270 (2009)","journal-title":"Discret. Math."},{"key":"1047_CR29","unstructured":"Knuth, D.: The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1. Number pt. 1. Pearson Education (2014)"},{"issue":"23","key":"1047_CR30","doi-asserted-by":"publisher","first-page":"3303","DOI":"10.1016\/j.disc.2010.07.016","volume":"310","author":"A Leitner","year":"2010","unstructured":"Leitner, A., Godbole, A.: Universal cycles of classes of restricted words. Discret. Math. 310(23), 3303\u20133309 (2010)","journal-title":"Discret. Math."},{"issue":"23","key":"1047_CR31","doi-asserted-by":"publisher","first-page":"3303","DOI":"10.1016\/j.disc.2010.07.016","volume":"310","author":"A Leitner","year":"2010","unstructured":"Leitner, A., Godbole, A.: Universal cycles of classes of restricted words. Discret. Math. 310(23), 3303\u20133309 (2010)","journal-title":"Discret. Math."},{"issue":"12","key":"1047_CR32","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1090\/S0002-9904-1934-05988-3","volume":"40","author":"MH Martin","year":"1934","unstructured":"Martin, M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40(12), 859\u2013864 (1934)","journal-title":"Bull. Am. Math. Soc."},{"key":"1047_CR33","doi-asserted-by":"crossref","unstructured":"Rankin, R.\u00a0A.: A campanological problem in group theory. In Mathematical Proceedings of the Cambridge Philosophical Society, vol.\u00a044, pp 17\u201325. Cambridge University Press, (1948)","DOI":"10.1017\/S030500410002394X"},{"issue":"1","key":"1047_CR34","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jcta.2011.07.005","volume":"119","author":"F Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: Binary bubble languages and cool-lex Gray codes. J. Combin. Theory Ser. A 119(1), 155\u2013169 (2012)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"1047_CR35","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/100808782","volume":"26","author":"F Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: De Bruijn sequences for fixed-weight binary strings. SIAM J. Discret. Math. 26(2), 605\u2013617 (2012)","journal-title":"SIAM J. Discret. Math."},{"issue":"17","key":"1047_CR36","doi-asserted-by":"publisher","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F Ruskey","year":"2009","unstructured":"Ruskey, F., Williams, A.: The coolest way to generate combinations. Discret. Math. 309(17), 5305\u20135320 (2009)","journal-title":"Discret. Math."},{"issue":"3","key":"1047_CR37","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1798596.1798598","volume":"6","author":"F Ruskey","year":"2010","unstructured":"Ruskey, F., Williams, A.: An explicit universal cycle for the $$(n-1)$$-permutations of an $$n$$-set. ACM Trans. Algorithm 6(3), 45 (2010)","journal-title":"ACM Trans. Algorithm"},{"key":"1047_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2021.06.008","volume":"882","author":"W Rytter","year":"2021","unstructured":"Rytter, W., Zuba, W.: Syntactic view of sigma-tau generation of permutations. Theoret. Comput. Sci. 882, 49\u201362 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"1047_CR39","unstructured":"Sarbazi-Azad, H.: Stupid sort: A new sorting algorithm. Newsletter of Computing Science Department, Univ. of Glasgow Vol. 599, 4 (2000)"},{"key":"1047_CR40","unstructured":"Sawada, J.: De Bruijn Sequence and Universal Cycle Constructions. http:\/\/debruijnsequence.org\/. Accessed: 2021-12-31"},{"issue":"1","key":"1047_CR41","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0304-3975(03)00049-5","volume":"301","author":"J Sawada","year":"2003","unstructured":"Sawada, J.: A fast algorithm to generate necklaces with fixed content. Theoret. Comput. Sci. 301(1), 477\u2013489 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"1047_CR42","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A.: A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theoret. Comput. Sci. 502, 46\u201354, (2013). Generation of Combinatorial Structures","DOI":"10.1016\/j.tcs.2012.01.013"},{"key":"1047_CR43","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A.: A Hamilton path for the sigma-tau problem. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 568\u2013575. SIAM, (2018)","DOI":"10.1137\/1.9781611975031.37"},{"issue":"1","key":"1047_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3359589","volume":"16","author":"J Sawada","year":"2019","unstructured":"Sawada, J., Williams, A.: Solving the sigma-tau problem. ACM Trans. Algorithms 16(1), 1\u201317 (2019)","journal-title":"ACM Trans. Algorithms"},{"key":"1047_CR45","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A.: A universal cycle for strings with fixed-content (which are also known as multiset permutations). In Workshop on Algorithms and Data Structures, pp 599\u2013612. Springer, (2021)","DOI":"10.1007\/978-3-030-83508-8_43"},{"key":"1047_CR46","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A., Wong, D.L Universal cycles for weight-range binary strings. In In: Lecroq T., Mouchard L. (eds) Combinatorial Algorithms (IWOCA 2013), pp 388\u2013401. Springer, (2013)","DOI":"10.1007\/978-3-642-45278-9_33"},{"issue":"1","key":"1047_CR47","doi-asserted-by":"publisher","first-page":"P1.24","DOI":"10.37236\/5517","volume":"23","author":"J Sawada","year":"2016","unstructured":"Sawada, J., Williams, A., Wong, D.: Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles. Electron. J. Comb. 23(1), P1.24 (2016)","journal-title":"Electron. J. Comb."},{"key":"1047_CR48","unstructured":"Steinhaus, H.: One hundred problems in elementary mathematics. Courier Corporation, (1979)"},{"issue":"4","key":"1047_CR49","doi-asserted-by":"publisher","first-page":"785","DOI":"10.7155\/jgaa.00278","volume":"16","author":"B Stevens","year":"2012","unstructured":"Stevens, B., Williams, A.: Hamilton cycles in restricted and incomplete rotator graphs. J. Graph Algorithms Appl. 16(4), 785\u2013810 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"1047_CR50","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1080\/00029890.1999.12005023","volume":"106","author":"RG Swan","year":"1999","unstructured":"Swan, R.G.: A simple proof of rankin\u2019s campanological theorem. Am. Math. Mon. 106(2), 159\u2013161 (1999)","journal-title":"Am. Math. Mon."},{"key":"1047_CR51","first-page":"203","volume":"28","author":"T van Aardenne-Ehrenfest","year":"1951","unstructured":"van Aardenne-Ehrenfest, T.: Circuits and trees in oriented linear graphs. Simon Stevin 28, 203\u2013217 (1951)","journal-title":"Simon Stevin"},{"key":"1047_CR52","doi-asserted-by":"crossref","unstructured":"Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201909, pp 987\u2013996, USA, (2009). SIAM","DOI":"10.1137\/1.9781611973068.107"},{"key":"1047_CR53","unstructured":"Williams, A.: Shift Gray codes. PhD thesis, University of Victoria, (2009)"},{"key":"1047_CR54","doi-asserted-by":"crossref","unstructured":"Williams, A.: The greedy gray code algorithm. In Workshop on Algorithms and Data Structures, pp 525\u2013536. Springer, (2013)","DOI":"10.1007\/978-3-642-40104-6_46"},{"issue":"6","key":"1047_CR55","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s00373-017-1778-3","volume":"33","author":"D Wong","year":"2017","unstructured":"Wong, D.: A new universal cycle for permutations. Graphs Combin. 33(6), 1393\u20131399 (2017)","journal-title":"Graphs Combin."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01047-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01047-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01047-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T03:34:47Z","timestamp":1685158487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01047-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,4]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1047"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01047-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,11,4]]},"assertion":[{"value":"18 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no known conflicts of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The research of Joe Sawada is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant RGPIN-2018-04211.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statement"}}]}}