{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:38Z","timestamp":1740122558012,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T00:00:00Z","timestamp":1668902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T00:00:00Z","timestamp":1668902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18J11282 and 20J00469","21K13830"],"award-info":[{"award-number":["18J11282 and 20J00469","21K13830"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10623-022-01152-x","type":"journal-article","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T15:02:32Z","timestamp":1668956552000},"page":"1315-1333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cayley sum graphs and their applications to codebooks"],"prefix":"10.1007","volume":"91","author":[{"given":"Shohei","family":"Satake","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujie","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,20]]},"reference":[{"key":"1152_CR1","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.jnt.2006.11.007","volume":"126","author":"N Alon","year":"2007","unstructured":"Alon N.: Large sets in finite fields are sumsets. J. Number Theory 126, 110\u2013118 (2007).","journal-title":"J. Number Theory"},{"key":"1152_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00493-005-0011-9","volume":"25","author":"N Alon","year":"2005","unstructured":"Alon N., R\u00f6dl V.: Sharp bounds for some multicolor Ramsey numbers. Combinatorica 25, 125\u2013141 (2005).","journal-title":"Combinatorica"},{"key":"1152_CR3","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jctb.1999.1906","volume":"76","author":"N Alon","year":"1999","unstructured":"Alon N., R\u00f3nyai L., Szab\u00f3 T.: Norm-graphs: variations and applications. J. Comb. Theory Ser. B 76, 280\u2013290 (1999).","journal-title":"J. Comb. Theory Ser. B"},{"key":"1152_CR4","volume-title":"Algebra","author":"M Artin","year":"1991","unstructured":"Artin M.: Algebra. Prentice Hall Inc, New Jersey (1991)."},{"key":"1152_CR5","first-page":"5","volume":"36","author":"F Bien","year":"1989","unstructured":"Bien F.: Constructions of telephone networks by group representations. Notices Am. Math. Soc. 36, 5\u201322 (1989).","journal-title":"Notices Am. Math. Soc."},{"key":"1152_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of Graphs","author":"AE Brouwer","year":"2012","unstructured":"Brouwer A.E., Haemers W.H.: Spectra of Graphs. Springer, New York (2012)."},{"key":"1152_CR7","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1112\/S0024611597000403","volume":"75","author":"AR Calderbank","year":"1997","unstructured":"Calderbank A.R., Cameron P.J., Kantor W.M., Seidel J.J.: $${\\mathbb{Z} }_4$$-kerdock codes, orthogonal spreads, and extremal Euclidean linesets. Proc. Lond. Math. Soc. 75, 436\u2013480 (1997).","journal-title":"Proc. Lond. Math. Soc."},{"key":"1152_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s E.J., Wakin M.B.: An introduction to compressive sampling. IEEE Signal Process. Mag. 25, 21\u201330 (2008).","journal-title":"IEEE Signal Process. Mag."},{"key":"1152_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-8224-8","volume-title":"An Introduction to Frames and Riesz Bases","author":"O Christensen","year":"2003","unstructured":"Christensen O.: An Introduction to Frames and Riesz Bases. Birkh\u00e4user, Boston (2003)."},{"key":"1152_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1090\/S0894-0347-1989-0965008-X","volume":"2","author":"FRK Chung","year":"1989","unstructured":"Chung F.R.K.: Diameters and eigenvalues. J. Am. Math. Soc. 2, 187\u2013196 (1989).","journal-title":"J. Am. Math. Soc."},{"key":"1152_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/10586458.1996.10504585","volume":"5","author":"JH Conway","year":"1996","unstructured":"Conway J.H., Harding R.H., Sloane N.J.A.: Packing lines, planes, etc.: packings in Grassmannian spaces. Exp. Math. 5, 139\u2013159 (1996).","journal-title":"Exp. Math."},{"key":"1152_CR12","first-page":"272","volume":"20","author":"H Cr\u00e1mer","year":"1921","unstructured":"Cr\u00e1mer H.: On the distribution of primes. Proc. Cam. Philos. Soc. 20, 272\u2013280 (1921).","journal-title":"Proc. Cam. Philos. Soc."},{"key":"1152_CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF03187604","volume":"67","author":"P Delsarte","year":"1977","unstructured":"Delsarte P., Goethals J.M., Seidel J.J.: Spherical codes and designs. Geometriae Dedicate 67, 363\u2013388 (1977).","journal-title":"Geometriae Dedicate"},{"key":"1152_CR14","doi-asserted-by":"crossref","first-page":"4229","DOI":"10.1109\/TIT.2006.880058","volume":"52","author":"C Ding","year":"2006","unstructured":"Ding C.: Complex codebooks from combinatorial designs. IEEE Trans. Inf. Theory 52, 4229\u20134235 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR15","doi-asserted-by":"crossref","first-page":"4245","DOI":"10.1109\/TIT.2007.907343","volume":"53","author":"C Ding","year":"2007","unstructured":"Ding C., Feng T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inf. Theory 53, 4245\u20134250 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10623-007-9140-z","volume":"46","author":"C Ding","year":"2008","unstructured":"Ding C., Feng T.: Codebooks from almost difference sets. Des. Codes Cryptogr. 46, 113\u2013126 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"1152_CR17","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"DL Donoho","year":"2003","unstructured":"Donoho D.L., Elad M.: Optimally sparse representation in general (nonorthogonal) dictionaries via $$\\ell _1$$ minimization. Proc. Natl. Acad. Sci. USA 100, 2197\u20132202 (2003).","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1152_CR18","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1016\/j.laa.2011.06.027","volume":"436","author":"M Fickus","year":"2012","unstructured":"Fickus M., Mixon D.G., Tremain J.C.: Steiner equiangular tight frames. Linear Algebra Appl. 436, 1014\u20131027 (2012).","journal-title":"Linear Algebra Appl."},{"key":"1152_CR19","first-page":"1","volume":"2007","author":"MZ Garaev","year":"2007","unstructured":"Garaev M.Z.: An explicit sum-product estimate in $${\\mathbb{F} }_q$$. Int. Math. Res. Not. 2007, 1\u201311 (2007).","journal-title":"Int. Math. Res. Not."},{"key":"1152_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546907","volume-title":"Signal Design for Good Correlation: For Wireless Communication. Cryptography and Radar","author":"SW Golomb","year":"2005","unstructured":"Golomb S.W., Gong G.: Signal Design for Good Correlation: For Wireless Communication. Cryptography and Radar. Cambridge University Press, Cambridge (2005)."},{"key":"1152_CR21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.endm.2007.07.031","volume":"29","author":"D Grynkiewicz","year":"2007","unstructured":"Grynkiewicz D., Lev V.F., Serra O.: The connectivity of addition Cayley graphs. Electron. Notes Discret. Math. 29, 135\u2013139 (2007).","journal-title":"Electron. Notes Discret. Math."},{"key":"1152_CR22","doi-asserted-by":"crossref","first-page":"32","DOI":"10.37236\/9371","volume":"27","author":"X He","year":"2020","unstructured":"He X., Wigderson Y.: Multicolor Ramsey numbers via pseudorandom graphs. Electron. J. Comb. 27, 32 (2020).","journal-title":"Electron. J. Comb."},{"key":"1152_CR23","doi-asserted-by":"crossref","first-page":"6179","DOI":"10.1109\/TIT.2017.2693204","volume":"63","author":"Z Heng","year":"2017","unstructured":"Heng Z., Ding C., Yue Q.: New constructions of asymptotically optimal codebooks with multiplicative characters. IEEE Trans. Inf. Theory 63, 6179\u20136187 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR24","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory S., Linial N., Wigderson A.: Expander graphs and their applications. Bull. Am. Math. Soc. (N.S.) 43, 439\u2013561 (2006).","journal-title":"Bull. Am. Math. Soc. (N.S.)"},{"key":"1152_CR25","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TIT.2013.2292745","volume":"60","author":"H Hu","year":"2014","unstructured":"Hu H., Wu J.: New constructions of codebooks nearly meeting the Welch bound with equality. IEEE Trans. Inf. Theory 60, 1348\u20131355 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR26","volume-title":"More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies","author":"M Krivelevich","year":"2006","unstructured":"Krivelevich M., Sudakov B.: Pseudo-random graphs. In: Gy\u00f6ri E., Katona G.O.H., Lov\u00e1sz L., Fleiner T. (eds.) More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies, vol. 15. Springer, Berlin (2006)."},{"key":"1152_CR27","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/jgt.21771","volume":"77","author":"J Lenz","year":"2014","unstructured":"Lenz J., Mubayi D.: Multicolor Ramsey numbers for complete bipartite versus complete graphs. J. Graph Theory 77, 19\u201338 (2014).","journal-title":"J. Graph Theory"},{"key":"1152_CR28","first-page":"43","volume":"40","author":"VI Levenshtein","year":"1983","unstructured":"Levenshtein V.I.: Bounds for packing of metric spaces and some of their applications. Probl. Cybern. 40, 43\u2013110 (1983).","journal-title":"Probl. Cybern."},{"key":"1152_CR29","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0022-314X(92)90120-E","volume":"41","author":"W-CW Li","year":"1992","unstructured":"Li W.-C.W., Feng K.Q.: Character sums and abelian Ramanujan graphs. J. Number Theory 41, 199\u2013217 (1992).","journal-title":"J. Number Theory"},{"key":"1152_CR30","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1109\/TIT.2014.2303973","volume":"60","author":"S Li","year":"2014","unstructured":"Li S., Ge G.: Deterministic sensing matrices arising from near orthogonal systems. IEEE Trans. Inf. Theory 60, 2291\u20132302 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR31","doi-asserted-by":"crossref","first-page":"2850","DOI":"10.1109\/TSP.2014.2318139","volume":"62","author":"S Li","year":"2014","unstructured":"Li S., Ge G.: Deterministic construction of sparse sensing matrices via finite geometry. IEEE Trans. Signal Process. 62, 2850\u20132859 (2014).","journal-title":"IEEE Trans. Signal Process."},{"key":"1152_CR32","doi-asserted-by":"crossref","first-page":"5035","DOI":"10.1109\/TIT.2012.2196256","volume":"58","author":"S Li","year":"2012","unstructured":"Li S., Gao F., Ge G., Zhang S.: Deterministic construction of compressed sensing matrices via algebraic curves. IEEE Trans. Inf. Theory 58, 5035\u20135041 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR33","volume-title":"Finite Fields","author":"R Lidl","year":"1984","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1984)."},{"key":"1152_CR34","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1007\/s10623-020-00735-w","volume":"88","author":"W Lu","year":"2020","unstructured":"Lu W., Wu X., Cao X., Chen M.: Six constructions of asymptotically optimal codebooks via the character sums. Des. Codes Cryptogr. 88, 1139\u20131158 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1152_CR35","doi-asserted-by":"crossref","first-page":"6498","DOI":"10.1109\/TIT.2017.2777492","volume":"64","author":"G Luo","year":"2018","unstructured":"Luo G., Cao X.: Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum. IEEE Trans. Inf. Theory 64, 6498\u20136505 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR36","volume-title":"Sequences II","author":"JL Massey","year":"1993","unstructured":"Massey J.L., Mittelholzer T.: Welchs bound and sequence sets for code-division multiple-access systems. In: Capocelli R., De Santis A., Vaccaro U. (eds.) Sequences II. Springer, New York (1993)."},{"unstructured":"Mubayi D., Verstra\u00ebte J.: A note on pseudorandom Ramsey graphs. arXiv:1909.01461","key":"1152_CR37"},{"key":"1152_CR38","volume":"343","author":"Y Qi","year":"2020","unstructured":"Qi Y., Mesnager S., Tang C.: Codebooks from generalized bent $${\\mathbb{Z} }_4$$-valued quadratic forms. Discret. Math. 343, 111736 (2020).","journal-title":"Discret. Math."},{"key":"1152_CR39","doi-asserted-by":"crossref","first-page":"2171","DOI":"10.1063\/1.1737053","volume":"45","author":"JM Renes","year":"2004","unstructured":"Renes J.M., Blume-Kohout R., Scot A., Caves C.: Symmetric informationally complete quantum measurements. J. Math. Phys. 45, 2171\u20132180 (2004).","journal-title":"J. Math. Phys."},{"key":"1152_CR40","volume-title":"Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science","author":"DV Sarwate","year":"1999","unstructured":"Sarwate D.V.: Meeting the Welch bound with equality. In: Ding C., Helleseth T., Niederreiter H. (eds.) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London (1999)."},{"unstructured":"Satake S.: Certain codebooks and the generalized Erd\u0151s\u2013Falconer distance problem (extended abstract). In: Sequences and their Applications (2020).","key":"1152_CR41"},{"key":"1152_CR42","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.laa.2021.08.018","volume":"631","author":"S Satake","year":"2021","unstructured":"Satake S.: On the restricted isometry property of the Paley matrix. Linear Algebra Appl. 631, 35\u201347 (2021).","journal-title":"Linear Algebra Appl."},{"doi-asserted-by":"crossref","unstructured":"Satake S., Gu Y.: Constructions of complex codebooks asymptotically meeting the Welch bound: A graph theoretic approach. In: 2020 IEEE International Symposium on Information Theory (pp. 48\u201353) (2020).","key":"1152_CR43","DOI":"10.1109\/ISIT44484.2020.9174496"},{"doi-asserted-by":"crossref","unstructured":"Satake S., Gu Y.: On compressed sensing matrices breaking the square-root bottleneck. In: 2020 IEEE Information Theory Workshop (pp. 1\u20135) (2020).","key":"1152_CR44","DOI":"10.1109\/ITW46852.2021.9457623"},{"key":"1152_CR45","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser M., Spielman D.: Expander codes. IEEE Trans. Inf. Theory 42, 1710\u20131722 (1996).","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Solymosi J.: Incidences and the spectra of graphs. In: Combinatorial Number Theory and Additive Group Theory. Advanced Courses in Mathematics - CRM Barcelona. Birkh\u00e4user Basel (2009).","key":"1152_CR46","DOI":"10.1007\/978-3-7643-8962-8_22"},{"key":"1152_CR47","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S1063-5203(03)00023-X","volume":"14","author":"T Strohmer","year":"2003","unstructured":"Strohmer T., Heath R.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14, 257\u2013275 (2003).","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1152_CR48","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0020-0190(02)00482-9","volume":"86","author":"T Szab\u00f3","year":"2003","unstructured":"Szab\u00f3 T.: On the spectrum of projective norm-graphs. Inform. Process. Lett. 86, 71\u201374 (2003).","journal-title":"Inform. Process. Lett."},{"key":"1152_CR49","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/LSP.2016.2595106","volume":"23","author":"P Tan","year":"2016","unstructured":"Tan P., Zhou Z., Zhang D.: A construction of codebooks nearly achieving the Levenstein bound. IEEE Signal Process. Lett. 23, 1306\u20131309 (2016).","journal-title":"IEEE Signal Process. Lett."},{"key":"1152_CR50","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","volume":"20","author":"L Welch","year":"1974","unstructured":"Welch L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inf. Theory 20, 397\u2013399 (1974).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR51","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0003-4916(89)90322-9","volume":"191","author":"W Wootters","year":"1989","unstructured":"Wootters W., Fields B.: Optimal state-determination by mutually unbiased measurements. Ann. Phys. 191, 363\u2013381 (1989).","journal-title":"Ann. Phys."},{"key":"1152_CR52","doi-asserted-by":"crossref","first-page":"1900","DOI":"10.1109\/TIT.2005.846411","volume":"51","author":"P Xia","year":"2005","unstructured":"Xia P., Zhou S., Giannakis G.B.: Achieving the Welch bound with difference sets. IEEE Trans. Inf. Theory 51, 1900\u20131907 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR53","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.2014.2375259","volume":"61","author":"G Xu","year":"2015","unstructured":"Xu G., Xu Z.: Compressed sensing matrices from Fourier matrices. IEEE Trans. Inf. Theory 61, 469\u2013478 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR54","doi-asserted-by":"crossref","first-page":"5522","DOI":"10.1109\/TIT.2012.2196021","volume":"58","author":"NY Yu","year":"2012","unstructured":"Yu N.Y.: A construction of codebooks associated with binary sequences. IEEE Trans. Inf. Theory 58, 5522\u20135533 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR55","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01388652","volume":"4","author":"G Z\u00e9mor","year":"1994","unstructured":"Z\u00e9mor G.: Hash functions and Cayley graphs. Des. Codes Cryptogr. 4, 381\u2013394 (1994).","journal-title":"Des. Codes Cryptogr."},{"key":"1152_CR56","doi-asserted-by":"crossref","first-page":"2507","DOI":"10.1109\/TIT.2011.2176531","volume":"58","author":"A Zhang","year":"2012","unstructured":"Zhang A., Feng K.: Two classes of codebooks nearly meeting the Welch bound. IEEE Trans. Inf. Theory 58, 2507\u20132511 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1152_CR57","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10623-011-9549-2","volume":"63","author":"A Zhang","year":"2012","unstructured":"Zhang A., Feng K.: Construction of cyclotomic codebooks nearly meeting the Welch bound. Des. Codes Cryptogr. 63, 209\u2013224 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"1152_CR58","doi-asserted-by":"crossref","first-page":"521","DOI":"10.3934\/amc.2011.5.521","volume":"5","author":"Z Zhou","year":"2011","unstructured":"Zhou Z., Tang X.: New nearly optimal codebooks from relative difference sets. Adv. Math. Commun. 5, 521\u2013527 (2011).","journal-title":"Adv. Math. Commun."},{"key":"1152_CR59","doi-asserted-by":"crossref","first-page":"7382","DOI":"10.1109\/TIT.2014.2353052","volume":"60","author":"Z Zhou","year":"2014","unstructured":"Zhou Z., Ding C., Li N.: New families of codebooks achieving the Levenshtein bound. IEEE Trans. Inf. Theory 60, 7382\u20137387 (2014).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01152-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01152-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01152-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T07:06:54Z","timestamp":1680678414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01152-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,20]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1152"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01152-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,11,20]]},"assertion":[{"value":"27 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}