{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:06:13Z","timestamp":1771038373998,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010418","name":"institute for information and communications technology promotion","doi-asserted-by":"publisher","award":["2017-0-00520"],"award-info":[{"award-number":["2017-0-00520"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12095-021-00547-2","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:04:26Z","timestamp":1642032266000},"page":"849-874","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Differential uniformity and linearity of S-boxes by multiplicative complexity"],"prefix":"10.1007","volume":"14","author":[{"given":"Yongjin","family":"Jeon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seungjun","family":"Baek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hangi","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giyoon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongsung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,13]]},"reference":[{"key":"547_CR1","unstructured":"Adomnicai, A., Berger, T.P., Clavier, C., Francq, J., Huynh, P., Lallemand, V., Le Gouguec, K., Minier, M., Reynaud, L., Thomas, G.: Lilliput-AE: a new lightweight tweakable block cipher for authenticated encryption with associated data. Submitted to NIST Lightweight Project (2019)"},{"key":"547_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I, Lecture Notes in Computer Science, vol. 9056, pp. 430\u2013454. Springer. https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17 (2015)","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"547_CR3","unstructured":"Andreeva, E., Bilgin, B., Bogdanov, A., Luykx, A., Mendel, F., Mennink, B., Mouha, N., Wang, Q., Yasuda, K.: PRIMATEs v1.02. CAESAR submission. http:\/\/competitions.cr.yp.to\/round2\/primatesv102.pdf (2015)"},{"key":"547_CR4","doi-asserted-by":"publisher","unstructured":"Beierle, C., Jean, J., K\u00f6lbl, S., Leander, G., Moradi, A., Peyrin, T., Sasaki, Y., Sasdrich, P., Sim, S.M.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II, Lecture Notes in Computer Science, vol. 9815, pp. 123\u2013153. Springer. https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5(2016)","DOI":"10.1007\/978-3-662-53008-5_5"},{"issue":"9","key":"547_CR5","doi-asserted-by":"publisher","first-page":"4160","DOI":"10.1109\/TIT.2006.880036","volume":"52","author":"TP Berger","year":"2006","unstructured":"Berger, T.P., Canteaut, A., Charpin, P., Laigle-Chapuy, Y.: On almost perfect nonlinear functions over $\\text {F}_{2}^{\\text {n}}$. IEEE Trans. Inf. Theory 52 (9), 4160\u20134170 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.880036","journal-title":"IEEE Trans. Inf. Theory"},{"key":"547_CR6","doi-asserted-by":"publisher","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. In: Menezes, A., Vanstone, S.A. (eds.) Advances in Cryptology - CRYPTO \u201990, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings, Lecture Notes in Computer Science, vol. 537, pp. 2\u201321. Springer. https:\/\/doi.org\/10.1007\/3-540-38424-3_1 (1990)","DOI":"10.1007\/3-540-38424-3_1"},{"issue":"1","key":"547_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.46586\/tosc.v2020.i1.144-184","volume":"2020","author":"B Bilgin","year":"2020","unstructured":"Bilgin, B., Meyer, L.D., Duval, S., Levi, I., Standaert, F.: Low AND depth and efficient inverses: a guide on S-boxes for low-latency masking. IACR Trans. Symmetric Cryptol. 2020(1), 144\u2013184 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i1.144-184","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"547_CR8","doi-asserted-by":"publisher","unstructured":"Bilgin, B., Nikova, S., Nikov, V., Rijmen, V., St\u00fctz, G.: Threshold implementations of all 3 \u00d73 and 4 \u00d74 S-boxes. In: Prouff, E., Schaumont, P. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2012 - 14th International Workshop, Leuven, Belgium, September 9-12, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7428, pp. 76\u201391. Springer. https:\/\/doi.org\/10.1007\/978-3-642-33027-8_5 (2012)","DOI":"10.1007\/978-3-642-33027-8_5"},{"key":"547_CR9","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: An ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2007, 9th International Workshop, Vienna, Austria, September 10-13, 2007, Proceedings, Lecture Notes in Computer Science, vol. 4727, pp. 450\u2013466. Springer. https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31 (2007)","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"547_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2018.02.023","volume":"720","author":"J Boyar","year":"2018","unstructured":"Boyar, J., Find, M.G.: Multiplicative complexity of vector valued Boolean functions. Theor. Comput. Sci. 720, 36\u201346 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.02.023","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"547_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J Boyar","year":"2013","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptol. 26(2), 280\u2013312 (2013). https:\/\/doi.org\/10.1007\/s00145-012-9124-7","journal-title":"J. Cryptol."},{"key":"547_CR12","doi-asserted-by":"publisher","unstructured":"Boyar, J., Peralta, R.: Concrete multiplicative complexity of symmetric functions. In: Kralovic, R., Urzyczyn, P. (eds.) Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Star\u00e1 Lesn\u00e1, Slovakia, August 28-September 1, 2006, Proceedings, Lecture Notes in Computer Science, vol. 4162, pp. 179\u2013189. Springer. https:\/\/doi.org\/10.1007\/11821069_16 (2006)","DOI":"10.1007\/11821069_16"},{"issue":"1","key":"547_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(99)00182-6","volume":"235","author":"J Boyar","year":"2000","unstructured":"Boyar, J., Peralta, R., Pochuev, D.: On the multiplicative complexity of Boolean functions over the basis (\u2227, \u2295, 1). Theor. Comput. Sci. 235(1), 43\u201357 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00182-6","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"547_CR14","doi-asserted-by":"publisher","first-page":"398","DOI":"10.46586\/tosc.v2017.i1.398-404","volume":"2017","author":"D Bozilov","year":"2017","unstructured":"Bozilov, D., Bilgin, B., Sahin, H.A.: A note on 5-bit quadratic permutations\u2019 classification. IACR Trans. Symmetric Cryptol. 2017(1), 398\u2013404 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.398-404","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"547_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ffa.2018.11.008","volume":"56","author":"A Canteaut","year":"2019","unstructured":"Canteaut, A., Perrin, L.: On CCZ-equivalence, extended-affine equivalence, and function twisting. Finite Fields Their Appl. 56, 209\u2013246 (2019). https:\/\/doi.org\/10.1016\/j.ffa.2018.11.008","journal-title":"Finite Fields Their Appl."},{"issue":"1","key":"547_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ffa.2005.07.003","volume":"13","author":"C Carlet","year":"2007","unstructured":"Carlet, C., Ding, C.: Nonlinearities of S-boxes. Finite Fields Their Appl. 13(1), 121\u2013135 (2007). https:\/\/doi.org\/10.1016\/j.ffa.2005.07.003","journal-title":"Finite Fields Their Appl."},{"key":"547_CR17","doi-asserted-by":"publisher","unstructured":"Chabaud, F., Vaudenay, S.: Links between differential and linear cryptanalysis. In: Santis, A.D. (ed.) Advances in Cryptology - EUROCRYPT \u201994, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings, Lecture Notes in Computer Science, vol. 950, pp. 356\u2013365. Springer. https:\/\/doi.org\/10.1007\/BFb0053450 (1994)","DOI":"10.1007\/BFb0053450"},{"key":"547_CR18","doi-asserted-by":"publisher","unstructured":"Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D., Zaverucha, G.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017, pp. 1825\u20131842. ACM. https:\/\/doi.org\/10.1145\/3133956.3133997 (2017)","DOI":"10.1145\/3133956.3133997"},{"issue":"3","key":"547_CR19","first-page":"165","volume":"6","author":"N Courtois","year":"2013","unstructured":"Courtois, N., Mourouzis, T., Hulme, D.: Exact logic minimization and multiplicative complexity of concrete algebraic and cryptographic circuits. Int. J. Adv. Intell. Syst. 6(3), 165\u2013176 (2013)","journal-title":"Int. J. Adv. Intell. Syst."},{"key":"547_CR20","unstructured":"Courtois, N.T.: How fast can be algebraic attacks on block ciphers? In: Biham, E., Handschuh, H., Lucks, S., Rijmen, V. (eds.) Symmetric Cryptography, 07.01. - 12.01.2007, Dagstuhl Seminar Proceedings, vol. 07021. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2007\/1013 (2007)"},{"key":"547_CR21","unstructured":"Courtois, N.T., Hulme, D., Mourouzis, T.: Solving Circuit Optimisation Problems in Cryptography and Cryptanalysis. IACR Cryptol. ePrint Arch. 2011, 475. http:\/\/eprint.iacr.org\/2011\/475 (2011)"},{"key":"547_CR22","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The block cipher rijndael. In: Quisquater, J., Schneier, B. (eds.) Smart Card Research and Applications, This International Conference, CARDIS \u201998, Louvain-la-Neuve, Belgium, September 14-16, 1998, Proceedings, Lecture Notes in Computer Science, vol. 1820, pp. 277\u2013284. Springer. https:\/\/doi.org\/10.1007\/10721064_26 (1998)","DOI":"10.1007\/10721064_26"},{"key":"547_CR23","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: ZKBoo: Faster zero-knowledge for boolean circuits. In: Holz, T., Savage, S. (eds.) 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, pp. 1069\u20131083. USENIX Association. https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/giacomelli (2016)"},{"issue":"S1","key":"547_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.46586\/tosc.v2020.iS1.31-59","volume":"2020","author":"D Goudarzi","year":"2020","unstructured":"Goudarzi, D., Jean, J., K\u00f6lbl, S., Peyrin, T., Rivain, M., Sasaki, Y., Sim, S.M.: Pyjamask: Block Cipher and Authenticated Encryption with Highly Efficient Masked Implementation. IACR Trans. Symmetric Cryptol. 2020 (S1), 31\u201359 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.iS1.31-59","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"547_CR25","doi-asserted-by":"publisher","unstructured":"Grosso, V., Leurent, G., Standaert, F., Varici, K.: LS-designs: Bitslice encryption for efficient masked software implementations. In: Cid, C., Rechberger, C. (eds.) Fast Software Encryption - 21st International Workshop, FSE 2014, London, UK, March 3-5, 2014. Revised Selected Papers, Lecture Notes in Computer Science, vol. 8540, pp. 18\u201337. Springer. https:\/\/doi.org\/10.1007\/978-3-662-46706-0_2 (2014)","DOI":"10.1007\/978-3-662-46706-0_2"},{"key":"547_CR26","doi-asserted-by":"publisher","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I, Lecture Notes in Computer Science, vol. 8616, pp. 554\u2013571. Springer. https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31 (2014)","DOI":"10.1007\/978-3-662-44371-2_31"},{"issue":"2","key":"547_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s13389-017-0160-y","volume":"8","author":"G Hatzivasilis","year":"2018","unstructured":"Hatzivasilis, G., Fysarakis, K., Papaefstathiou, I., Manifavas, C.: A review of lightweight block ciphers. J. Cryptogr. Eng. 8(2), 141\u2013184 (2018). https:\/\/doi.org\/10.1007\/s13389-017-0160-y","journal-title":"J. Cryptogr. Eng."},{"key":"547_CR28","unstructured":"Kim, H., Jeon, Y., Kim, G., Kim, J., Sim, B., Han, D., Seo, H., Kim, S., Hong, S., Sung, J., Hong, D.: A New Method for Designing Lightweight S-boxes with High Differential and Linear Branch Numbers, and Its Application. IACR Cryptol. ePrint Arch. 2020, 1582. https:\/\/eprint.iacr.org\/2020\/1582 (2020)"},{"key":"547_CR29","doi-asserted-by":"publisher","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) Advances in Cryptology - CRYPTO \u201996, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings, Lecture Notes in Computer Science, vol. 1109, pp. 104\u2013113. Springer. https:\/\/doi.org\/10.1007\/3-540-68697-5_9 (1996)","DOI":"10.1007\/3-540-68697-5_9"},{"key":"547_CR30","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, Lecture Notes in Computer Science, vol. 5126, pp. 486\u2013498. Springer. https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40 (2008)","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"547_CR31","doi-asserted-by":"publisher","unstructured":"Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) Advances in Cryptology - EUROCRYPT \u201993, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings, Lecture Notes in Computer Science, vol. 765, pp. 386\u2013397. Springer. https:\/\/doi.org\/10.1007\/3-540-48285-7_33 (1993)","DOI":"10.1007\/3-540-48285-7_33"},{"key":"547_CR32","doi-asserted-by":"publisher","unstructured":"Songhori, E.M., Hussain, S.U., Sadeghi, A., Schneider, T., Koushanfar, F.: TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, May 17-21, 2015, pp. 411\u2013428. IEEE Computer Society. https:\/\/doi.org\/10.1109\/SP.2015.32 (2015)","DOI":"10.1109\/SP.2015.32"},{"key":"547_CR33","doi-asserted-by":"publisher","unstructured":"Stoffelen, K.: Optimizing s-box implementations for several criteria using SAT solvers. In: Peyrin, T. (ed.) Fast Software Encryption - 23rd International Conference, FSE 2016, Bochum, Germany, March 20-23, 2016, Revised Selected Papers, Lecture Notes in Computer Science, vol. 9783, pp. 140\u2013160. Springer. https:\/\/doi.org\/10.1007\/978-3-662-52993-5_8 (2016)","DOI":"10.1007\/978-3-662-52993-5_8"},{"key":"547_CR34","doi-asserted-by":"publisher","unstructured":"Testa, E., Soeken, M., Amar\u00f9, L. G., Micheli, G.D.: Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications. In: Proceedings of the 56th Annual Design Automation Conference 2019, DAC 2019, Las Vegas, NV, USA, June 02-06, 2019, p. 74. ACM. https:\/\/doi.org\/10.1145\/3316781.3317893 (2019)","DOI":"10.1145\/3316781.3317893"},{"key":"547_CR35","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, pp. 162\u2013167. IEEE Computer Society. https:\/\/doi.org\/10.1109\/SFCS.1986.25(1986)","DOI":"10.1109\/SFCS.1986.25"},{"issue":"2","key":"547_CR36","first-page":"135","volume":"52","author":"P Zajac","year":"2015","unstructured":"Zajac, P.: Constructing S-boxes with low multiplicative complexity. Stud. Sci. Math. Hung. 52(2), 135\u2013153 (2015)","journal-title":"Stud. Sci. Math. Hung."},{"issue":"3","key":"547_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s12095-014-0100-y","volume":"6","author":"P Zajac","year":"2014","unstructured":"Zajac, P., J\u00f3kay, M.: Multiplicative complexity of bijective 4\u00d74 S-boxes. Cryptogr. Commun. 6 (3), 255\u2013277 (2014). https:\/\/doi.org\/10.1007\/s12095-014-0100-y","journal-title":"Cryptogr. Commun."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00547-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00547-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00547-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T05:13:46Z","timestamp":1654578826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00547-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,13]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["547"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00547-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,13]]},"assertion":[{"value":"28 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}