{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T18:09:09Z","timestamp":1785866949228,"version":"3.56.0"},"reference-count":60,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union Recovery and Resilience Facility","doi-asserted-by":"publisher","award":["2.3.1.1.i.0\/1\/22\/I\/CFLA\/001"],"award-info":[{"award-number":["2.3.1.1.i.0\/1\/22\/I\/CFLA\/001"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"award":["2.3.1.1.i.0\/1\/22\/I\/CFLA\/001"],"award-info":[{"award-number":["2.3.1.1.i.0\/1\/22\/I\/CFLA\/001"]}],"id":[{"id":"https:\/\/2.zoppoz.workers.dev:443\/https\/ror.org\/019w4f821","id-type":"ROR","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Quantum key distribution (QKD) networks require relaying when distant key management entities share no direct quantum link. Most relay strategies, however, rely on centralized control or globally maintained routing state. This paper asks whether useful security and efficiency can still be obtained with topology-oblivious stochastic forwarding. It studies the security-overhead trade-off in a model in which fragmented key material is relayed via random-walk variants and reconstructed under privacy amplification. The analysis asks whether strictly local forwarding can retain useful information-theoretic security (ITS). Evaluation on the G\u00c9ANT topology, representing a European academic backbone network, shows clear differences between random-walk variants. The proposed highest-score-neighbor local path-diversification heuristic reduces the probability that relayed key material passes through a compromised node. The evaluation also shows that scouting-based loop erasure significantly shortens sampled routes and improves throughput in the model. Against one- to three-node cartels, random flow protects slightly more source\u2013target pairs than a static disjoint-multipath method on the evaluated topologies. These findings position topology-oblivious stochastic forwarding as a simpler decentralized design for QKD relaying without centralized orchestration or gossip protocols.<\/jats:p>","DOI":"10.3390\/e28060696","type":"journal-article","created":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:56:31Z","timestamp":1781675791000},"page":"696","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0008-5713-5914","authenticated-orcid":false,"given":"Kri\u0161j\u0101nis","family":"Petru\u010de\u0146a","sequence":"first","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-7085-383X","authenticated-orcid":false,"given":"Sergejs","family":"Kozlovi\u010ds","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-2283-2978","authenticated-orcid":false,"given":"Juris","family":"V\u012bksna","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0004-2680-3220","authenticated-orcid":false,"given":"El\u012bna","family":"Kalni\u0146a","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0001-3784-208X","authenticated-orcid":false,"given":"Reinis","family":"Isaks","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-9608-3792","authenticated-orcid":false,"given":"Edgars","family":"Celms","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-7650-2355","authenticated-orcid":false,"given":"Lelde","family":"L\u0101ce","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-1606-4944","authenticated-orcid":false,"given":"Edgars","family":"Rencis","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,6,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication Theory of Secrecy Systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","article-title":"Quantum Cryptography: Public Key Distribution and Coin Tossing","volume":"560","author":"Bennett","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1103\/PhysRevLett.85.441","article-title":"Simple Proof of Security of the BB84 Quantum Key Distribution Protocol","volume":"85","author":"Shor","year":"2000","journal-title":"Phys. Rev. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"075001","DOI":"10.1088\/1367-2630\/11\/7\/075001","article-title":"The SECOQC Quantum Key Distribution Network in Vienna","volume":"11","author":"Peev","year":"2009","journal-title":"New J. Phys."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"123001","DOI":"10.1088\/1367-2630\/13\/12\/123001","article-title":"Long-Term Performance of the SwissQuantum Quantum Key Distribution Network in a Field Environment","volume":"13","author":"Stucki","year":"2011","journal-title":"New J. Phys."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1038\/s41534-021-00474-3","article-title":"Implementation of a 46-Node Quantum Metropolitan Area Network","volume":"7","author":"Chen","year":"2021","journal-title":"npj Quantum Inf."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1103\/RevModPhys.74.145","article-title":"Quantum Cryptography","volume":"74","author":"Gisin","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"19201","DOI":"10.1038\/srep19201","article-title":"Long-Distance Continuous-Variable Quantum Key Distribution by Controlling Excess Noise","volume":"6","author":"Huang","year":"2016","journal-title":"Sci. Rep."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1038\/s41586-025-08801-w","article-title":"Long-Distance Coherent Quantum Communications in Deployed Telecom Networks","volume":"640","author":"Pittaluga","year":"2025","journal-title":"Nature"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3233\/JCS-2010-0373","article-title":"Security of Trusted Repeater Quantum Key Distribution Networks","volume":"18","author":"Salvail","year":"2010","journal-title":"J. Comput. Secur."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1145\/3730575","article-title":"Quantum Key Distribution Networks-Key Management: A Survey","volume":"57","author":"Dervisevic","year":"2025","journal-title":"ACM Comput. Surv."},{"key":"ref_12","unstructured":"Cviti\u0107, I., Perakovi\u0107, D., and Nolasco, A. (2025). Overview of Routing Approaches in Quantum Key Distribution Networks. arXiv."},{"key":"ref_13","unstructured":"Moy, J. (2026, February 04). RFC 2328: OSPF Version 2. Available online: https:\/\/2.zoppoz.workers.dev:443\/https\/www.rfc-editor.org\/info\/rfc2328\/."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/MCOMSTD.2025.3572642","article-title":"Distributed Key Relay: OSPF for Effective QKD","volume":"10","author":"Drif","year":"2025","journal-title":"IEEE Commun. Stand. Mag."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1038\/nature23655","article-title":"Satellite-to-Ground Quantum Key Distribution","volume":"549","author":"Liao","year":"2017","journal-title":"Nature"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"15043","DOI":"10.1038\/ncomms15043","article-title":"Fundamental Limits of Repeaterless Quantum Communications","volume":"8","author":"Pirandola","year":"2017","journal-title":"Nat. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1038\/s41586-018-0066-6","article-title":"Overcoming the Rate\u2013Distance Limit of Quantum Key Distribution without Quantum Repeaters","volume":"557","author":"Lucamarini","year":"2018","journal-title":"Nature"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1038\/s41566-019-0377-7","article-title":"Experimental Quantum Key Distribution beyond the Repeaterless Secret Key Capacity","volume":"13","author":"Minder","year":"2019","journal-title":"Nat. Photonics"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1088\/1367-2630\/4\/1\/346","article-title":"Building the Quantum Network","volume":"4","author":"Elliott","year":"2002","journal-title":"New J. Phys."},{"key":"ref_20","unstructured":"(2019). Quantum Key Distribution (QKD); Protocol and Data Format of REST-Based Key Delivery API (Standard No. ETSI GS QKD 014 V1.1.1)."},{"key":"ref_21","unstructured":"Rescorla, E. (2026, February 04). RFC 8446: The Transport Layer Security (TLS) Protocol Version 1.3. Available online: https:\/\/2.zoppoz.workers.dev:443\/https\/www.rfc-editor.org\/info\/rfc8446\/."},{"key":"ref_22","unstructured":"Kaufman, C., Hoffman, P., Nir, Y., Eronen, P., and Kivinen, T. (2026, February 04). RFC 7296: Internet Key Exchange Protocol Version 2 (IKEv2). Available online: https:\/\/2.zoppoz.workers.dev:443\/https\/www.rfc-editor.org\/info\/rfc7296\/."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/978-3-030-44223-1_26","article-title":"Many a Mickle Makes a Muckle: A Framework for Provably Quantum-Secure Hybrid Key Exchange","volume":"Volume 12100","author":"Ding","year":"2020","journal-title":"Post-Quantum Cryptography"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Beals, T.R., and Sanders, B.C. (2008). Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network. Proceedings of the International Conference on Information Theoretic Security, Springer.","DOI":"10.1007\/978-3-540-85093-9_4"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/s11432-009-0001-4","article-title":"Multiple Stochastic Paths Scheme on Partially-Trusted Relay Quantum Key Distribution Network","volume":"52","author":"Wen","year":"2009","journal-title":"Sci. China Ser. Inf. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Kiktenko, E.O., Tayduganov, A., and Fedorov, A.K. (2024). Routing Algorithm Within the Multiple Non-Overlapping Paths\u2019 Approach for Quantum Key Distribution Networks. Entropy, 26.","DOI":"10.3390\/e26121102"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","article-title":"Disjoint Paths in a Network","volume":"4","author":"Suurballe","year":"1974","journal-title":"Networks"},{"key":"ref_28","unstructured":"Bhandari, R. (1998). Survivable Networks: Algorithms for Diverse Routing, Kluwer Academic Publishers."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Kumar, P., Kundu, N.K., and Kar, B. (2024). Quantum Key Distribution Routing Protocol in Quantum Networks: Overview and Challenges. arXiv.","DOI":"10.36227\/techrxiv.173532206.69862449\/v1"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Yao, J., Wang, Y., Li, Q., Mao, H., El-Latif, A.A.A., and Chen, N. (2022). An Efficient Routing Protocol for Quantum Key Distribution Networks. Entropy, 24.","DOI":"10.3390\/e24070911"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1364\/JOCN.547793","article-title":"Decentralized Key Distribution versus On-Demand Relaying for QKD Networks","volume":"17","author":"Stan","year":"2025","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1364\/JOCN.544857","article-title":"Dynamic-Threshold-Based Pre-Relaying for Enhanced Key Allocation in Quantum-Secured Networks","volume":"17","author":"Stan","year":"2025","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/MCOM.010.2200672","article-title":"A Segment-Based Multipath Distribution Method in Partially-Trusted Relay Quantum Networks","volume":"61","author":"Wang","year":"2023","journal-title":"IEEE Commun. Mag."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-540-79104-1_16","article-title":"Towards the World-Wide Quantum Network","volume":"Volume 4991","author":"Chen","year":"2008","journal-title":"Information Security Practice and Experience"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Le Quoc, C., Bellot, P., and Demaille, A. (2007). Stochastic Routing in Large Grid-Shaped Quantum Networks. Proceedings of the 2007 IEEE International Conference on Research, Innovation and Vision for the Future, IEEE.","DOI":"10.1109\/RIVF.2007.369152"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Ghourab, E.M., Azab, M., and Gra\u010danin, D. (2025). QKD Routing Scheme for a Zero-Trust Network System: A Moving Target Defense Approach. Big Data Cogn. Comput., 9.","DOI":"10.3390\/bdcc9040076"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"130502","DOI":"10.1103\/PhysRevLett.108.130502","article-title":"Side-Channel-Free Quantum Key Distribution","volume":"108","author":"Braunstein","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"130503","DOI":"10.1103\/PhysRevLett.108.130503","article-title":"Measurement-Device-Independent Quantum Key Distribution","volume":"108","author":"Lo","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"130502","DOI":"10.1103\/PhysRevLett.111.130502","article-title":"Experimental Measurement-Device-Independent Quantum Key Distribution","volume":"111","author":"Liu","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1364\/OPTICA.458937","article-title":"Robust and Adaptable Quantum Key Distribution Network without Trusted Nodes","volume":"9","author":"Lu","year":"2022","journal-title":"Optica"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1038\/s41534-025-01052-7","article-title":"A Measurement-Device-Independent Quantum Key Distribution Network Using Optical Frequency Comb","volume":"11","author":"Yan","year":"2025","journal-title":"npj Quantum Inf."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"2701","DOI":"10.1109\/JSAC.2021.3064662","article-title":"Hybrid Trusted\/Untrusted Relay-Based Quantum Key Distribution Over Optical Backbone Networks","volume":"39","author":"Cao","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"3530","DOI":"10.1109\/JLT.2022.3153992","article-title":"Secret-Key Provisioning With Collaborative Routing in Partially-Trusted-Relay-based Quantum-Key-Distribution-Secured Optical Networks","volume":"40","author":"Yu","year":"2022","journal-title":"J. Light. Technol."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"160973","DOI":"10.1109\/ACCESS.2024.3490378","article-title":"Hacking the Least Trusted Node: Indirect Eavesdropping in Quantum Networks","volume":"12","author":"Rass","year":"2024","journal-title":"IEEE Access"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1038\/nphoton.2010.214","article-title":"Hacking Commercial Quantum Cryptography Systems by Tailored Bright Illumination","volume":"4","author":"Lydersen","year":"2010","journal-title":"Nat. Photonics"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Ford, L.R., and Fulkerson, D.R. (1962). Flows in Networks, Princeton University Press.","DOI":"10.1515\/9781400875184"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1142\/S0219199707002551","article-title":"Non-Backtracking Random Walks Mix Faster","volume":"9","author":"Alon","year":"2007","journal-title":"Commun. Contemp. Math."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"371","DOI":"10.7155\/jgaa.00421","article-title":"Lower Bounds for Graph Exploration Using Local Policies","volume":"21","author":"Akash","year":"2017","journal-title":"J. Graph Algorithms Appl."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996). A Fast Quantum Mechanical Algorithm for Database Search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing-STOC \u201996, ACM Press.","DOI":"10.1145\/237814.237866"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"012318","DOI":"10.1103\/PhysRevA.81.012318","article-title":"Practical Issues in Quantum-Key-Distribution Postprocessing","volume":"81","author":"Fung","year":"2010","journal-title":"Phys. Rev. A\u2014At. Mol. Opt. Phys."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy Amplification by Public Discussion","volume":"17","author":"Bennett","year":"1988","journal-title":"SIAM J. Comput."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","article-title":"Universally Composable Privacy Amplification Against Quantum Adversaries","volume":"Volume 3378","author":"Kilian","year":"2005","journal-title":"Theory of Cryptography"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"5524","DOI":"10.1109\/TIT.2011.2158473","article-title":"Leftover Hashing Against Quantum Side Information","volume":"57","author":"Tomamichel","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., and Paterson, M.B. (2005). Cryptography: Theory and Practice, Chapman and Hall\/CRC. [4th ed.].","DOI":"10.1201\/9781420057133"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Lawler, G.F., and Limic, V. (2010). Random Walk: A Modern Introduction, Cambridge University Press. [1st ed.].","DOI":"10.1017\/CBO9780511750854"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Wilson, D.B. (1996). Generating Random Spanning Trees More Quickly than the Cover Time. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing-STOC \u201996, ACM Press.","DOI":"10.1145\/237814.237880"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3402192","article-title":"Quantum Key Distribution: A Networking Perspective","volume":"53","author":"Mehic","year":"2020","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_58","unstructured":"Mukherjee, B., Ramamurthy, S., Banerjee, D., and Mukherjee, A. (2002). Some Principles for Designing a Wide-Area Optical Network. Proceedings of the INFOCOM \u201994 Conference on Computer Communications, IEEE."},{"key":"ref_59","unstructured":"G\u00c9ANT (2026, February 04). GN4-3N. Web Page Describing the GN4-3N Project (2019\u20132023); Topology Diagram Consulted to Reconstruct Node\/Edge Lists (Links > 1000 km Removed in Our Processed Graph). Available online: https:\/\/2.zoppoz.workers.dev:443\/https\/network.geant.org\/gn4-3n\/."},{"key":"ref_60","unstructured":"Xuereb, A. (2026, February 04). Towards an Ultra-Secure Communication Network for the EU. G\u00c9ANT CONNECT. Online Article Discussing EuroQCI-Oriented Ultra-Secure Networking Efforts Including QKD. Available online: https:\/\/2.zoppoz.workers.dev:443\/https\/connect.geant.org\/2023\/12\/13\/towards-an-ultra-secure-communication-network-for-the-eu."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.mdpi.com\/1099-4300\/28\/6\/696\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:58:31Z","timestamp":1781675911000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.mdpi.com\/1099-4300\/28\/6\/696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,16]]},"references-count":60,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["e28060696"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.3390\/e28060696","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,16]]}}}