{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:44:02Z","timestamp":1760060642111,"version":"build-2065373602"},"reference-count":72,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:00:00Z","timestamp":1757116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>This article introduces the innovative Quantum Dining Information Brokers Problem, presenting a novel entanglement-based quantum protocol to address it. The scenario involves n information brokers, all located in distinct geographical regions, engaging in a metaphorical virtual dinner. The objective is for each broker to share a unique piece of information with all the others simultaneously. Unlike previous approaches, this protocol enables a fully parallel, single-step communication exchange among all the brokers, regardless of their physical locations. A key feature of this protocol is its ability to ensure that both the anonymity and privacy of all the participants are preserved, meaning that no broker can discern the identity of the sender of any received information. At its core, the Quantum Dining Information Brokers Problem serves as a conceptual framework for achieving anonymous, untraceable, and massively parallel information exchange in a distributed system. The proposed protocol introduces three significant advancements. First, while quantum protocols for one-to-many simultaneous information transmission have been developed, this is, to the best of our knowledge, one of the first quantum protocols to facilitate many-to-many simultaneous information exchange. Second, it guarantees complete anonymity and untraceability for all senders, a critical improvement over sequential applications of one-to-many protocols, which fail to ensure such robust anonymity. Third, leveraging quantum entanglement, the protocol operates in a fully distributed manner, accommodating brokers in diverse spatial locations. This approach marks a substantial advancement in secure, scalable, and anonymous communication, with potential applications in distributed environments where privacy and parallelism are paramount.<\/jats:p>","DOI":"10.3390\/fi17090408","type":"journal-article","created":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T11:51:12Z","timestamp":1757332272000},"page":"408","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A GHZ-Based Protocol for the Dining Information Brokers Problem"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3741-1271","authenticated-orcid":false,"given":"Theodore","family":"Andronikos","sequence":"first","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3669-0453","authenticated-orcid":false,"given":"Constantinos","family":"Bitsakos","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4424-9951","authenticated-orcid":false,"given":"Konstantinos","family":"Nikas","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7811-4831","authenticated-orcid":false,"given":"Georgios I.","family":"Goumas","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4890-8427","authenticated-orcid":false,"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2025,9,6]]},"reference":[{"key":"ref_1","unstructured":"Chow, J., Dial, O., and Gambetta, J. (2025, January 07). IBM Quantum Breaks the 100-Qubit Processor Barrier. Available online: https:\/\/www.ibm.com\/quantum\/blog\/127-qubit-quantum-processor-eagle\/."},{"key":"ref_2","unstructured":"IBM (2025, January 07). IBM Unveils 400 Qubit-Plus Quantum Processor. Available online: https:\/\/newsroom.ibm.com\/2022-11-09-IBM-Unveils-400-Qubit-Plus-Quantum-Processor-and-Next-Generation-IBM-Quantum-System-Two\/."},{"key":"ref_3","unstructured":"Gambetta, J. (2025, January 07). The Hardware and Software for the Era of Quantum Utility Is Here. Available online: https:\/\/www.ibm.com\/quantum\/blog\/quantum-roadmap-2033\/."},{"key":"ref_4","unstructured":"IBM (2025, January 07). IBM Launches Its Most Advanced Quantum Computers, Fueling New Scientific Value and Progress Towards Quantum Advantage. Available online: https:\/\/newsroom.ibm.com\/2024-11-13-ibm-launches-its-most-advanced-quantum-computers,-fueling-new-scientific-value-and-progress-towards-quantum-advantage\/."},{"key":"ref_5","unstructured":"Neven, H. (2025, January 07). Meet Willow, Our State-of-the-Art Quantum Chip. Available online: https:\/\/blog.google\/technology\/research\/google-willow-quantum-chip\/."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Garisto, D. (2025, January 07). Google Uncovers How Quantum Computers Can Beat Today\u2019s Best Supercomputers. Available online: https:\/\/www.nature.com\/articles\/d41586-024-03288-3\/.","DOI":"10.1038\/d41586-024-03288-3"},{"key":"ref_7","unstructured":"Aasen, D., Aghaee, M., Alam, Z., Andrzejczuk, M., Antipov, A., Astafev, M., Avilovas, L., Barzegar, A., Bauer, B., and Becker, J. (2025). Roadmap to fault tolerant quantum computation using topological qubit arrays. arXiv."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/s41586-024-08445-2","article-title":"Interferometric single-shot parity measurement in InAs\u2013Al hybrid devices","volume":"638","author":"Aghaee","year":"2025","journal-title":"Nature"},{"key":"ref_9","unstructured":"Microsoft (2025, February 21). Microsoft\u2019s Majorana 1 Chip Carves New Path for Quantum Computing. Available online: https:\/\/news.microsoft.com\/source\/features\/innovation\/microsofts-majorana-1-chip-carves-new-path-for-quantum-computing\/."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1126\/science.ado6285","article-title":"Beyond-classical computation in quantum simulation","volume":"388","author":"King","year":"2025","journal-title":"Science"},{"key":"ref_11","unstructured":"Davide, C. (2025, March 17). Fresh \u2019Quantum Advantage\u2019 Claim Made by Computing Firm D-Wave. Available online: https:\/\/www.nature.com\/articles\/d41586-025-00765-1\/."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"090601","DOI":"10.1103\/PhysRevLett.134.090601","article-title":"Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor","volume":"134","author":"Gao","year":"2025","journal-title":"Phys. Rev. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Sanders, B.C. (2025, March 17). Superconducting Quantum Computing Beyond 100 Qubits. Available online: https:\/\/physics.aps.org\/articles\/v18\/45\/.","DOI":"10.1103\/Physics.18.45"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6041","DOI":"10.1109\/TNSM.2024.3452326","article-title":"Multipartite Entanglement Distribution in the Quantum Internet: Knowing When to Stop!","volume":"21","author":"Cacciapuoti","year":"2024","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.1109\/TCOMM.2023.3344140","article-title":"Quantum MAC: Genuine Entanglement Access Control via Many-Body Dicke States","volume":"72","author":"Illiano","year":"2024","journal-title":"IEEE Trans. Commun."},{"key":"ref_16","unstructured":"Photonic (2025, January 07). Photonic Demonstrates Distributed Entanglement Between Modules, Marking Significant Milestone Toward Scalable Quantum Computing and Networking. Available online: https:\/\/photonic.com\/news\/photonic-demonstrates-distributed-entanglement-between-modules\/."},{"key":"ref_17","unstructured":"Nu Quantum (2025, January 07). Announcing the Qubit-Photon Interface (QPI): Towards Unlocking Modular and Scalable Distributed Quantum Computing. Available online: https:\/\/www.nu-quantum.com\/news\/qubit-photon-interface-qpi-towards-unlocking-modular-and-scalable-distributed-quantum-computing\/."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1038\/s41586-024-08404-x","article-title":"Distributed quantum computing across an optical network link","volume":"638","author":"Main","year":"2025","journal-title":"Nature"},{"key":"ref_19","unstructured":"Oxford News (2025, February 07). First Distributed Quantum Algorithm Brings Quantum Supercomputers Closer. Available online: https:\/\/www.ox.ac.uk\/news\/2025-02-06-first-distributed-quantum-algorithm-brings-quantum-supercomputers-closer\/."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","article-title":"The dining cryptographers problem: Unconditional sender and recipient untraceability","volume":"1","author":"Chaum","year":"1988","journal-title":"J. Cryptol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","article-title":"Untraceable electronic mail, return addresses, and digital pseudonyms","volume":"24","author":"Chaum","year":"1981","journal-title":"Commun. ACM"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"von Ahn, L., Bortz, A., and Hopper, N.J. (2003, January 27\u201330). k-anonymous message transmission. Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS03, Washingtion, DC, USA.","DOI":"10.1145\/948125.948128"},{"key":"ref_23","unstructured":"Boykin, P.O. (2002). Information Security and Quantum Mechanics: Security of Quantum Protocols. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Christandl, M., and Wehner, S. (2005). Quantum Anonymous Transmissions. Advances in Cryptology\u2014ASIACRYPT 2005, Springer.","DOI":"10.1007\/11593447_12"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Bouda, J., and Sprojcar, J. (2007, January 2\u20136). Anonymous Transmission of Quantum Information. Proceedings of the 2007 First International Conference on Quantum, Nano, and Micro Technologies (ICQNM\u201907), Guadeloupe, French Caribbean.","DOI":"10.1109\/ICQNM.2007.2"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Brassard, G., Broadbent, A., Fitzsimons, J., Gambs, S., and Tapp, A. (2007). Anonymous Quantum Communication, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-540-76900-2_28"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Broadbent, A., and Tapp, A. (2007). Information-Theoretic Security Without an Honest Majority, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-540-76900-2_25"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"022323","DOI":"10.1103\/PhysRevA.80.022323","article-title":"Two-way protocols for quantum cryptography with a nonmaximally entangled qubit pair","volume":"80","author":"Shimizu","year":"2009","journal-title":"Phys. Rev. A"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1007\/s11433-010-4109-8","article-title":"Quantum communications with an anonymous receiver","volume":"53","author":"Wang","year":"2010","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Shi, R., Su, Q., Guo, Y., and Lee, M.H. (2011, January 16\u201318). Quantum Secure Communication Based on Nonmaximally Entangled Qubit Pair and Dining Cryptographers Problem. Proceedings of the 2011 IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, Changsha, China.","DOI":"10.1109\/TrustCom.2011.123"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/s10773-014-2206-6","article-title":"Security analysis and improvement of the dining cryptographer problem-based anonymous quantum communication via non-maximally entanglement state analysis","volume":"54","author":"Wang","year":"2014","journal-title":"Int. J. Theor. Phys."},{"key":"ref_32","unstructured":"Rahaman, R., and Kar, G. (2015). GHZ correlation provides secure Anonymous Veto Protocol. arXiv."},{"key":"ref_33","unstructured":"Hameedi, A., Marques, B., Muhammad, S., Wiesniak, M., and Bourennane, M. (2017). Experimental Quantum Solution to the Dining Cryptographers Problem. arXiv."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"125118","DOI":"10.1088\/1402-4896\/ac3ef8","article-title":"Quantum communication for sender anonymity based on single-particle with collective detection","volume":"96","author":"Li","year":"2021","journal-title":"Phys. Scr."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1140\/epjqt\/s40507-022-00133-2","article-title":"Quantum anonymous veto: A set of new protocols","volume":"9","author":"Mishra","year":"2022","journal-title":"EPJ Quantum Technol."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3390\/dynamics4010010","article-title":"A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem","volume":"4","author":"Karananou","year":"2024","journal-title":"Dynamics"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1103\/PhysRevA.56.1154","article-title":"Insecurity of quantum secure computations","volume":"56","author":"Lo","year":"1997","journal-title":"Phys. Rev. A"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.optcom.2009.11.085","article-title":"An efficient protocol for the private comparison of equal information based on the triplet entangled state and single-particle measurement","volume":"283","author":"Chen","year":"2010","journal-title":"Opt. Commun."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.optcom.2010.09.005","article-title":"Quantum protocol for millionaire problem","volume":"284","author":"Jia","year":"2011","journal-title":"Opt. Commun."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"3160","DOI":"10.1016\/j.optcom.2011.02.017","article-title":"An efficient protocol for the quantum private comparison of equality with W state","volume":"284","author":"Liu","year":"2011","journal-title":"Opt. Commun."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s11128-011-0251-0","article-title":"New quantum private comparison protocol using EPR pairs","volume":"11","author":"Tseng","year":"2011","journal-title":"Quantum Inf. Process."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10773-011-0878-8","article-title":"A Protocol for the Quantum Private Comparison of Equality with \u03c7-Type State","volume":"51","author":"Liu","year":"2011","journal-title":"Int. J. Theor. Phys."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s11128-012-0395-6","article-title":"Quantum private comparison protocol with d-dimensional Bell states","volume":"12","author":"Lin","year":"2012","journal-title":"Quantum Inf. Process."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4103\/0256-4602.123129","article-title":"Quantum Private Comparison: A Review","volume":"30","author":"Liu","year":"2013","journal-title":"IETE Tech. Rev."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"4225","DOI":"10.1007\/s11128-015-1104-z","article-title":"Multi-party quantum private comparison with an almost-dishonest third party","volume":"14","author":"Huang","year":"2015","journal-title":"Quantum Inf. Process."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/s11128-016-1498-2","article-title":"Multiparty quantum private comparison with almost dishonest third parties for strangers","volume":"16","author":"Hung","year":"2016","journal-title":"Quantum Inf. Process."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1088\/0253-6102\/67\/2\/147","article-title":"Quantum Private Comparison via Cavity QED","volume":"67","author":"Ye","year":"2017","journal-title":"Commun. Theor. Phys."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/s11128-018-2021-8","article-title":"Multi-party quantum private comparison of size relation with d-level single-particle states","volume":"17","author":"Ye","year":"2018","journal-title":"Quantum Inf. Process."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11128-019-2401-8","article-title":"Multi-party quantum privacy comparison of size based on d-level GHZ states","volume":"18","author":"Cao","year":"2019","journal-title":"Quantum Inf. Process."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s11128-021-03059-3","article-title":"Quantum private comparison of size using d-level Bell states with a semi-honest third party","volume":"20","author":"Wu","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"128397","DOI":"10.1016\/j.physa.2022.128397","article-title":"Improved multiparty quantum private comparison based on quantum homomorphic encryption","volume":"610","author":"Zhang","year":"2023","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2024). A Multiparty Quantum Private Equality Comparison Scheme Relying on |GHZ3\u27e9 States. Future Internet, 16.","DOI":"10.3390\/fi16090309"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1103\/PhysRevLett.82.1052","article-title":"Quantum strategies","volume":"82","author":"Meyer","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"3077","DOI":"10.1103\/PhysRevLett.83.3077","article-title":"Quantum games and quantum strategies","volume":"83","author":"Eisert","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2021). The Connection between the PQ Penny Flip Game and the Dihedral Groups. Mathematics, 9.","DOI":"10.3390\/math9101115"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Koh, D.E., Kumar, K., and Goh, S.T. (2024). Quantum Volunteer\u2019s Dilemma. arXiv.","DOI":"10.1103\/PhysRevResearch.7.013104"},{"key":"ref_57","unstructured":"Bennett, C.H., and Brassard, G. (1984, January 10\u201312). Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2023). An Entanglement-Based Protocol for Simultaneous Reciprocal Information Exchange between 2 Players. Electronics, 12.","DOI":"10.3390\/electronics12112506"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2023). One-to-Many Simultaneous Secure Quantum Information Transmission. Cryptography, 7.","DOI":"10.3390\/cryptography7040064"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"1900015","DOI":"10.1002\/qute.201900015","article-title":"Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer","volume":"2","author":"Cruz","year":"2019","journal-title":"Adv. Quantum Technol."},{"key":"ref_61","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_62","unstructured":"Yanofsky, N.S., and Mannucci, M.A. (2013). Quantum Computing for Computer Scientists, Cambridge University Press."},{"key":"ref_63","unstructured":"Wong, T.G. (2022). Introduction to Classical and Quantum Computing, Rooted Grove."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Ampatzis, M., and Andronikos, T. (2023). Quantum Secret Aggregation Utilizing a Network of Agents. Cryptography, 7.","DOI":"10.3390\/cryptography7010005"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Mermin, N. (2007). Quantum Computer Science: An Introduction, Cambridge University Press.","DOI":"10.1017\/CBO9780511813870"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Andronikos, T. (2024). A Distributed and Parallel (k, n) QSS Scheme with Verification Capability. Mathematics, 12.","DOI":"10.3390\/math12233782"},{"key":"ref_67","unstructured":"Qiskit (2025, January 07). Qiskit Is the World\u2019s Most Popular Software Stack for Quantum Computing. Available online: https:\/\/www.ibm.com\/quantum\/qiskit\/."},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Gallian, J.A. (2021). Contemporary Abstract Algebra, Taylor & Francis Group. [10th ed.]. Textbooks in mathematics.","DOI":"10.1201\/9781003142331"},{"key":"ref_69","unstructured":"Artin, M. (2011). Algebra, Pearson Prentice Hall."},{"key":"ref_70","unstructured":"Dummit, D., and Foote, R. (2004). Abstract Algebra, Wiley."},{"key":"ref_71","unstructured":"Matsuura, R. (2022). A Friendly Introduction to Abstract Algebra, MAA Press (an imprint of the American Mathematical Society). Number Vol. 72 in AMS\/MAA Textbooks."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2025). A Novel Two- and Three-Player Scheme for Quantum Direct Communication. Symmetry, 17.","DOI":"10.3390\/sym17030379"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/9\/408\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:41:17Z","timestamp":1760035277000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/9\/408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,6]]},"references-count":72,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["fi17090408"],"URL":"https:\/\/doi.org\/10.3390\/fi17090408","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2025,9,6]]}}}