{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:15:12Z","timestamp":1778040912800,"version":"3.51.4"},"reference-count":67,"publisher":"International Association for Cryptologic Research","issue":"1","license":[{"start":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T00:00:00Z","timestamp":1759795200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,12,2]]},"abstract":"<jats:p>Recently, the UK National Cyber Security Centre (NCSC) introduced two authenticated encryption schemes, GLEVIAN and VIGORNIAN (ePrint 2023\/1379). They claimed that these constructions achieve nonce-misuse resistance and security under release of unverified plaintext, both in the multi-user setting and in the standard cipher model. Despite their efforts to deliver a simple description with a simple proof, their bottom-up description of the schemes looks overwhelming and misses details (such as the order of subkeys).<\/jats:p>\n                  <jats:p>In this work, we aim to give context to the schemes: we present them in an alternative top-down interpretation, most importantly with a compact description of their umbrella mode VIGLEVORNIAN, clarify certain unexplained design choices, and observe various aspects where the schemes could have been designed more efficiently. Based on these observations, we present a new authenticated encryption mode, overlineVIGLEVORNIAN, that is designed to (i) resemble the UK NCSC description as much as possible while (ii) being more efficient without any sacrifice in security and (iii) using weaker security assumptions (universality of the underlying hash function and PRP-security of the underlying block cipher). We demonstrate that our new umbrella mode overlineVIGLEVORNIAN and its two variants overlineGLEVIAN and overlineVIGORNIAN not only outperform the two UK NCSC modes, but also the comparable block cipher based nonce-misuse resistant authenticated encryption schemes in literature (GCM-SIV and aaa-bbb-ddd).<\/jats:p>","DOI":"10.62056\/anxra6qiu","type":"journal-article","created":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T18:09:08Z","timestamp":1777918148000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["Understanding and Simplifying the UK NCSC Modes GLEVIAN and VIGORNIAN"],"prefix":"10.62056","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6679-1878","authenticated-orcid":false,"given":"Bart","family":"Mennink","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02jz4aj89","id-type":"ROR","asserted-by":"publisher"}],"name":"Maastricht University","place":["Maastricht, The Netherlands"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"48349","published-online":{"date-parts":[[2026,5,4]]},"reference":[{"key":"ref1:CAESAR","volume-title":"CAESAR: Competition for Authenticated Encryption: Security,\n  Applicability, and Robustness","year":"2014"},{"key":"ref2:DBLP:journals\/joc\/DobraunigEMS21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/S00145-021-09398-9","article-title":"Ascon v1.2: Lightweight Authenticated Encryption and\n  Hashing","volume":"34","author":"Christoph Dobraunig","year":"2021","journal-title":"J. Cryptol."},{"key":"ref3:DEMS16","volume-title":"Ascon v1.2","author":"Christoph Dobraunig","year":"2016"},{"key":"ref4:Wu16","volume-title":"ACORN: A Lightweight Authenticated Cipher (v3)","author":"Hongjun Wu","year":"2016"},{"key":"ref5:DBLP:conf\/sacrypt\/WuP13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-662-43414-7_10","article-title":"AEGIS: A Fast Authenticated Encryption Algorithm","volume":"8282","author":"Hongjun Wu","year":"2013"},{"key":"ref6:WP16","volume-title":"AEGIS: A Fast Authenticated Encryption Algorithm (v1.1)","author":"Hongjun Wu","year":"2016"},{"key":"ref7:DBLP:journals\/joc\/KrovetzR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/S00145-021-09399-8","article-title":"The Design and Evolution of OCB","volume":"34","author":"Ted Krovetz","year":"2021","journal-title":"J. Cryptol."},{"key":"ref8:KR16","volume-title":"OCB (v1.1)","author":"Ted Krovetz","year":"2016"},{"key":"ref9:DBLP:journals\/joc\/JeanNPS21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/S00145-021-09397-W","article-title":"The Deoxys AEAD Family","volume":"34","author":"J\u00e9r\u00e9my Jean","year":"2021","journal-title":"J. Cryptol."},{"key":"ref10:JNPS16","volume-title":"Deoxys v1.41","author":"J\u00e9r\u00e9my Jean","year":"2016"},{"key":"ref11:DBLP:journals\/joc\/AndreevaBDLMNTY24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/S00145-024-09492-8","article-title":"The COLM Authenticated Encryption Scheme","volume":"37","author":"Elena Andreeva","year":"2024","journal-title":"J. Cryptol."},{"key":"ref12:ABD+16","volume-title":"COLM v1","author":"Elena Andreeva","year":"2016"},{"key":"ref13:Lightweight","volume-title":"Lightweight Cryptography","author":"NIST","year":"2019"},{"key":"ref14:asconnist","volume-title":"Ascon v1.2","author":"Christoph Dobraunig","year":"2019"},{"key":"ref15:DBLP:books\/sp\/DaemenR02","series-title":"Information Security and Cryptography","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael: AES - The Advanced Encryption\n  Standard","author":"Joan Daemen","year":"2002","ISBN":"https:\/\/id.crossref.org\/isbn\/3540425802"},{"key":"ref16:accordionproposal2024","volume-title":"Proposal of Requirements for an Accordion Mode: Discussion\n  Draft for the NIST Accordion Mode Workshop 2024","author":"Yu Long Chen","year":"2024"},{"key":"ref17:DBLP:conf\/eurocrypt\/RogawayS06","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11761679_23","article-title":"A Provable-Security Treatment of the Key-Wrap Problem","volume":"4004","author":"Phillip Rogaway","year":"2006"},{"key":"ref18:DBLP:conf\/eurocrypt\/HoangKR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-46800-5_2","article-title":"Robust Authenticated-Encryption AEZ and the Problem That\n  It Solves","volume":"9056","author":"Viet Tung Hoang","year":"2015"},{"key":"ref19:cryptoeprint:2023\/1379","volume-title":"GLEVIAN and VIGORNIAN: Robust beyond-birthday AEAD\n  modes","author":"Peter Campbell","year":"2023"},{"key":"ref20:DBLP:conf\/asiacrypt\/ShrimptonT13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-42033-7_21","article-title":"A Modular Framework for Building Variable-Input-Length\n  Tweakable Ciphers","volume":"8269","author":"Thomas Shrimpton","year":"2013"},{"key":"ref21:SPmodes","doi-asserted-by":"crossref","DOI":"10.6028\/NIST.SP.800-38a","volume-title":"NIST Special Publication 800-38A: Recommendation for Block\n  Cipher Modes of Operation: Methods and Techniques","author":"Morris Dworkin","year":"2001"},{"key":"ref22:DBLP:conf\/crypto\/LiskovRW02","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","article-title":"Tweakable Block Ciphers","volume":"2442","author":"Moses D. Liskov","year":"2002"},{"key":"ref23:DBLP:conf\/asiacrypt\/Rogaway04","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30539-2_2","article-title":"Efficient Instantiations of Tweakable Blockciphers and\n  Refinements to Modes OCB and PMAC","volume":"3329","author":"Phillip Rogaway","year":"2004"},{"key":"ref24:DBLP:conf\/indocrypt\/McGrewV04","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-30556-9_27","article-title":"The Security and Performance of the Galois\/Counter Mode\n  (GCM) of Operation","volume":"3348","author":"David A. McGrew","year":"2004"},{"key":"ref25:DBLP:conf\/asiacrypt\/AndreevaBLMMY14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-662-45611-8_6","article-title":"How to Securely Release Unverified Plaintext in\n  Authenticated Encryption","volume":"8873","author":"Elena Andreeva","year":"2014"},{"key":"ref26:DBLP:conf\/crypto\/AshurDL17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63697-9_1","article-title":"Boosting Authenticated Encryption Robustness with Minimal\n  Modifications","volume":"10403","author":"Tomer Ashur","year":"2017"},{"key":"ref27:DBLP:conf\/eurocrypt\/BellareBM00","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","article-title":"Public-Key Encryption in a Multi-user Setting: Security\n  Proofs and Improvements","volume":"1807","author":"Mihir Bellare","year":"2000"},{"key":"ref28:DBLP:conf\/crypto\/MouhaL15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-47989-6_10","article-title":"Multi-key Security: The Even-Mansour Construction\n  Revisited","volume":"9215","author":"Nicky Mouha","year":"2015"},{"key":"ref29:DBLP:conf\/eurocrypt\/BoseHT18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-319-78381-9_18","article-title":"Revisiting AES-GCM-SIV: Multi-user Security, Faster Key\n  Derivation, and Better Bounds","volume":"10820","author":"Priyanka Bose","year":"2018"},{"key":"ref30:DBLP:conf\/eurocrypt\/DuttaNT19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-030-17653-2_15","article-title":"Beyond Birthday Bound Secure MAC in Faulty Nonce Model","volume":"11476","author":"Avijit Dutta","year":"2019"},{"key":"ref31:DBLP:conf\/fse\/AbedFLLW16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-52993-5_2","article-title":"RIV for Robust Authenticated Encryption","volume":"9783","author":"Farzaneh Abed","year":"2016"},{"key":"ref32:DBLP:conf\/ima\/BarwellPS15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-27239-9_6","article-title":"Rogue Decryption Failures: Reconciling AE Robustness\n  Notions","volume":"9496","author":"Guy Barwell","year":"2015"},{"key":"ref33:DBLP:conf\/ccs\/GueronL15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/2810103.2813613","article-title":"GCM-SIV: Full Nonce Misuse-Resistant Authenticated\n  Encryption at Under One Cycle per Byte","author":"Shay Gueron","year":"2015"},{"key":"ref34:DBLP:conf\/eurocrypt\/DobraunigMMT25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-031-91107-1_3","article-title":"Efficient Instances of Docked Double Decker with AES, and\n  Application to Authenticated Encryption","volume":"15601","author":"Christoph Dobraunig","year":"2025"},{"key":"ref35:DBLP:journals\/tosc\/IwataKMP20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.13154\/TOSC.V2020.I1.43-120","article-title":"Duel of the Titans: The Romulus and Remus Families of\n  Lightweight AEAD Algorithms","volume":"2020","author":"Tetsu Iwata","year":"2020","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref36:DBLP:journals\/tosc\/BertoniDHPAK17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.46586\/tosc.v2017.i4.1-38","article-title":"Farfalle: parallel permutation-based cryptography","volume":"2017","author":"Guido Bertoni","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref37:DBLP:journals\/tosc\/DobraunigEMMMPU20","doi-asserted-by":"publisher","first-page":"390","DOI":"10.13154\/TOSC.V2020.IS1.390-416","article-title":"Isap v2.0","volume":"2020","author":"Christoph Dobraunig","year":"2020","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref38:DBLP:journals\/tosc\/IwataS17","doi-asserted-by":"publisher","first-page":"240","DOI":"10.13154\/TOSC.V2017.I4.240-267","article-title":"Reconsidering the Security Bound of AES-GCM-SIV","volume":"2017","author":"Tetsu Iwata","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref39:DBLP:conf\/fse\/Iwata06","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11799313_20","article-title":"New Blockcipher Modes of Operation with Beyond the Birthday\n  Bound Security","volume":"4047","author":"Tetsu Iwata","year":"2006"},{"key":"ref40:DBLP:conf\/crypto\/DegabrieleK22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-031-15985-5_10","article-title":"Overloading the Nonce: Rugged PRPs, Nonce-Set AEAD, and\n  Order-Resilient Channels","volume":"13510","author":"Jean Paul Degabriele","year":"2022"},{"key":"ref41:DBLP:conf\/crypto\/Taylor93","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-48329-2_4","article-title":"An Integrity Check Value Algorithm for Stream Ciphers","volume":"773","author":"Richard Taylor","year":"1993"},{"key":"ref42:cryptoeprint:2016\/1087","volume-title":"CENC is Optimally Secure","author":"Tetsu Iwata","year":"2016"},{"key":"ref43:DBLP:journals\/tosc\/BhattacharyaN18","doi-asserted-by":"publisher","first-page":"314","DOI":"10.13154\/TOSC.V2018.I1.314-335","article-title":"Revisiting Variable Output Length XOR Pseudorandom\n  Function","volume":"2018","author":"Srimanta Bhattacharya","year":"2018","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref44:Freedman1977","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1080\/01621459.1977.10480637","article-title":"A Remark on the Difference between Sampling with and\n  without Replacement","volume":"72","author":"David Freedman","year":"1977","journal-title":"Journal of the American Statistical Association"},{"key":"ref45:DBLP:conf\/crypto\/BellareKR94","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","article-title":"The Security of Cipher Block Chaining","volume":"839","author":"Mihir Bellare","year":"1994"},{"key":"ref46:DBLP:conf\/eurocrypt\/BellareR06","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","article-title":"The Security of Triple Encryption and a Framework for\n  Code-Based Game-Playing Proofs","volume":"4004","author":"Mihir Bellare","year":"2006"},{"key":"ref47:cryptoeprint:2008\/078","volume-title":"A Short Proof of the PRP\/PRF Switching Lemma","author":"Donghoon Chang","year":"2008"},{"key":"ref48:DBLP:conf\/crypto\/HallWKS98","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/BFB0055742","article-title":"Building PRFs from PRPs","volume":"1462","author":"Chris Hall","year":"1998"},{"key":"ref49:DBLP:conf\/crypto\/ImpagliazzoR88","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/0-387-34799-2_2","article-title":"Limits on the Provable Consequences of One-way\n  Permutations","volume":"403","author":"Russell Impagliazzo","year":"1988"},{"key":"ref50:cryptoeprint:2017\/168","volume-title":"AES-GCM-SIV: Specification and Analysis","author":"Shay Gueron","year":"2017"},{"key":"ref51:irtf-cfrg-aead-limits-09","volume-title":"Usage Limits on AEAD Algorithms","author":"Felix G\u00fcnther","year":"2024"},{"key":"ref52:DBLP:conf\/crypto\/Kocher96","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","article-title":"Timing Attacks on Implementations of Diffie-Hellman, RSA,\n  DSS, and Other Systems","volume":"1109","author":"Paul C. Kocher","year":"1996"},{"key":"ref53:DBLP:conf\/ih\/KuhnA98","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-49380-8_10","article-title":"Soft Tempest: Hidden Data Transmission Using\n  Electromagnetic Emanations","volume":"1525","author":"Markus G. Kuhn","year":"1998"},{"key":"ref54:DBLP:conf\/crypto\/KocherJJ99","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","article-title":"Differential Power Analysis","volume":"1666","author":"Paul C. Kocher","year":"1999"},{"key":"ref55:DBLP:conf\/focs\/DziembowskiP08","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/FOCS.2008.56","article-title":"Leakage-Resilient Cryptography","author":"Stefan Dziembowski","year":"2008"},{"key":"ref56:DBLP:conf\/eurocrypt\/Pietrzak09","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-01001-9_27","article-title":"A Leakage-Resilient Mode of Operation","volume":"5479","author":"Krzysztof Pietrzak","year":"2009"},{"key":"ref57:DBLP:conf\/ccs\/YuSPY10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/1866307.1866324","article-title":"Practical leakage-resilient pseudorandom generators","author":"Yu Yu","year":"2010"},{"key":"ref58:DBLP:conf\/ches\/FaustPS12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-33027-8_13","article-title":"Practical Leakage-Resilient Symmetric Cryptography","volume":"7428","author":"Sebastian Faust","year":"2012"},{"key":"ref59:DBLP:series\/isc\/StandaertPYQYO10","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-14452-3_5","article-title":"Leakage Resilient Cryptography in Practice","author":"Fran\u00e7ois-Xavier Standaert","year":"2010"},{"key":"ref60:DBLP:conf\/crypto\/DodisP10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-14623-7_2","article-title":"Leakage-Resilient Pseudorandom Functions and Side-Channel\n  Attacks on Feistel Networks","volume":"6223","author":"Yevgeniy Dodis","year":"2010"},{"key":"ref61:DBLP:conf\/crypto\/GrubbsLR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63697-9_3","article-title":"Message Franking via Committing Authenticated Encryption","volume":"10403","author":"Paul Grubbs","year":"2017"},{"key":"ref62:DBLP:conf\/uss\/LenGR21","first-page":"195","article-title":"Partitioning Oracle Attacks","author":"Julia Len","year":"2021"},{"key":"ref63:DBLP:conf\/uss\/AlbertiniDGKLS22","first-page":"3291","article-title":"How to Abuse and Fix Authenticated Encryption Without Key\n  Commitment","author":"Ange Albertini","year":"2022"},{"key":"ref64:DBLP:conf\/esorics\/ChanR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-031-17146-8_14","article-title":"On Committing Authenticated-Encryption","volume":"13555","author":"John Chan","year":"2022"},{"key":"ref65:DBLP:conf\/eurocrypt\/BellareH22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/978-3-031-07085-3_29","article-title":"Efficient Schemes for Committing Authenticated\n  Encryption","volume":"13276","author":"Mihir Bellare","year":"2022"},{"key":"ref66:DBLP:conf\/focs\/Zhandry12","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/FOCS.2012.37","article-title":"How to Construct Quantum Random Functions","author":"Mark Zhandry","year":"2012"},{"key":"ref67:DBLP:journals\/tosc\/KaplanLLN16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.13154\/TOSC.V2016.I1.71-94","article-title":"Quantum Differential and Linear Cryptanalysis","volume":"2016","author":"Marc Kaplan","year":"2016","journal-title":"IACR Trans. Symmetric Cryptol."}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:01:09Z","timestamp":1778040069000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/3\/1\/6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,4]]},"references-count":67,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,5,4]]}},"URL":"https:\/\/doi.org\/10.62056\/anxra6qiu","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,4]]},"assertion":[{"value":"2025-10-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-4-51"}}