{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T06:07:04Z","timestamp":1771567624830,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s11704-025-50244-z","type":"journal-article","created":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T03:09:34Z","timestamp":1771556974000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CP-SuperSpartan: commit-and-prove SNARKs for customizable constraint systems"],"prefix":"10.1007","volume":"20","author":[{"given":"Zibo","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongyang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,20]]},"reference":[{"key":"50244_CR1","first-page":"291","volume-title":"Proceedings of the 17th Annual ACM Symposium on Theory of Computing","author":"S Goldwasser","year":"1985","unstructured":"Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof-systems. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing. 1985, 291\u2013304"},{"key":"50244_CR2","first-page":"723","volume-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing","author":"J Kilian","year":"1992","unstructured":"Kilian J. A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing. 1992, 723\u2013732"},{"key":"50244_CR3","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/SFCS.1994.365746","volume-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science","author":"S Micali","year":"1994","unstructured":"Micali S. CS proofs. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science. 1994, 436\u2013453"},{"key":"50244_CR4","first-page":"2075","volume-title":"Proceedings of 2019 ACM SIGSAC Conference on Computer and Communications Security","author":"M Campanelli","year":"2019","unstructured":"Campanelli M, Fiore D, Querol A. LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: Proceedings of 2019 ACM SIGSAC Conference on Computer and Communications Security. 2019, 2075\u20132092"},{"key":"50244_CR5","series-title":"University of Amsterdam, Dissertation","volume-title":"Modular design of secure yet practical cryptographic protocols","author":"R Cramer","year":"1997","unstructured":"Cramer R. Modular design of secure yet practical cryptographic protocols. University of Amsterdam, Dissertation, 1997"},{"issue":"2\u20134","key":"50244_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/3300000030","volume":"4","author":"J Thaler","year":"2022","unstructured":"Thaler J. Proofs, arguments, and zero-knowledge. Foundations and Trends\u00ae in Privacy and Security, 2022, 4(2\u20134): 117\u2013660.","journal-title":"Foundations and Trends\u00ae in Privacy and Security"},{"key":"50244_CR7","first-page":"643","volume-title":"Proceedings of the 38th Annual International Cryptology Conference on Advances in Cryptology","author":"S Agrawal","year":"2018","unstructured":"Agrawal S, Ganesh C, Mohassel P. Non- interactive zero-knowledge proofs for composite statements. In: Proceedings of the 38th Annual International Cryptology Conference on Advances in Cryptology. 2018, 643\u2013673"},{"key":"50244_CR8","first-page":"499","volume-title":"Proceedings of the 36th Annual International Cryptology Conference on Advances in Cryptology","author":"M Chase","year":"2016","unstructured":"Chase M, Ganesh C, Mohassel P. Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials. In: Proceedings of the 36th Annual International Cryptology Conference on Advances in Cryptology. 2016, 499\u2013530"},{"key":"50244_CR9","first-page":"499","volume-title":"Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"B Chen","year":"2023","unstructured":"Chen B, B\u00fcnz B, Boneh D, Zhang Z. HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2023, 499\u2013530"},{"key":"50244_CR10","volume-title":"Proceedings of the 4th ZKProof Workshop","author":"D Benarroch","year":"2021","unstructured":"Benarroch D, Campanelli M, Fiore D, Kim J, Lee J, Oh H, Querol A. Proposal: commit-and-prove zero-knowledge proof systems and extensions. In: Proceedings of the 4th ZKProof Workshop. 2021"},{"key":"50244_CR11","first-page":"286","volume-title":"Proceedings of the 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography","author":"M Backes","year":"2019","unstructured":"Backes M, Hanzlik L, Herzberg A, Kate A, Pryvalov I. Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup. In: Proceedings of the 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography. 2019, 286\u2013313"},{"key":"50244_CR12","first-page":"584","volume-title":"Proceedings of the 25th IACR International Conference on Practice and Theory of Public-Key Cryptography","author":"D F Aranha","year":"2022","unstructured":"Aranha D F, Bennedsen E M, Campanelli M, Ganesh C, Orlandi C, Takahashi A. ECLIPSE: enhanced compiling method for Pedersen-committed zkSNARK engines. In: Proceedings of the 25th IACR International Conference on Practice and Theory of Public-Key Cryptography. 2022, 584\u2013614"},{"key":"50244_CR13","first-page":"3","volume-title":"Proceedings of the 27th International Conference on the Theory and Application of Cryptology and Information Security","author":"M Campanelli","year":"2021","unstructured":"Campanelli M, Faonio A, Fiore D, Querol A, Rodr\u00edguez H. Lunar: a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions. In: Proceedings of the 27th International Conference on the Theory and Application of Cryptology and Information Security. 2021, 3\u201333"},{"key":"50244_CR14","first-page":"208","volume-title":"Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security","author":"M Zhang","year":"2023","unstructured":"Zhang M, Chen Y, Yao C, Wang Z. Sigma protocols from verifiable secret sharing and their applications. In: Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security. 2023, 208\u2013242"},{"key":"50244_CR15","first-page":"626","volume-title":"Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"R Gennaro","year":"2013","unstructured":"Gennaro R, Gentry C, Parno B, Raykova M. Quadratic span programs and succinct NIZKs without PCPs. In: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2013, 626\u2013645"},{"key":"50244_CR16","first-page":"327","volume-title":"Proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"J Bootle","year":"2016","unstructured":"Bootle J, Cerulli A, Chaidos P, Groth J, Petit C. Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2016, 327\u2013357"},{"key":"50244_CR17","series-title":"Cryptology ePrint Archive, Paper 2019\/953","volume-title":"PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge","author":"A Ariel Gabizon","year":"2019","unstructured":"Ariel Gabizon A, Williamson Z J, Ciobotaru O. PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. 2019, Cryptology ePrint Archive, Paper 2019\/953"},{"key":"50244_CR18","series-title":"Cryptology ePrint Archive, Paper 2023\/552","volume-title":"Customizable constraint systems for succinct arguments","author":"S Setty","year":"2023","unstructured":"Setty S, Thaler J, Wahby R. Customizable constraint systems for succinct arguments. 2023, Cryptology ePrint Archive, Paper 2023\/552"},{"key":"50244_CR19","first-page":"701","volume-title":"Proceedings of the 39th Annual International Cryptology Conference on Advances in Cryptology","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson E, Bentov I, Horesh Y, Riabzev M. Scalable zero knowledge with no trusted setup. In: Proceedings of the 39th Annual International Cryptology Conference on Advances in Cryptology. 2019, 701\u2013732"},{"key":"50244_CR20","first-page":"427","volume-title":"Proceedings of the 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"J Bootle","year":"2022","unstructured":"Bootle J, Chiesa A, Hu Y, Orr\u00fa M. Gemini: elastic SNARKs for diverse environments. In: Proceedings of the 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2022, 427\u2013457"},{"key":"50244_CR21","first-page":"193","volume-title":"Proceedings of the 43rd Annual International Cryptology Conference on Advances in Cryptology","author":"A Golovnev","year":"2023","unstructured":"Golovnev A, Lee J, Setty S, Thaler J, Wahby R S. Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Proceedings of the 43rd Annual International Cryptology Conference on Advances in Cryptology. 2023, 193\u2013226"},{"key":"50244_CR22","first-page":"704","volume-title":"Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology","author":"S Setty","year":"2020","unstructured":"Setty S. Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology. 2020, 704\u2013737"},{"key":"50244_CR23","first-page":"299","volume-title":"Proceedings of the 42nd Annual International Cryptology Conference on Advances in Cryptology","author":"T Xie","year":"2022","unstructured":"Xie T, Zhang Y, Song D. Orion: zero knowledge proof with linear prover time. In: Proceedings of the 42nd Annual International Cryptology Conference on Advances in Cryptology. 2022, 299\u2013328"},{"key":"50244_CR24","first-page":"177","volume-title":"Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security","author":"A Kate","year":"2010","unstructured":"Kate A, Zaverucha G M, Goldberg I. Constant- size commitments to polynomials and their applications. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. 2010, 177\u2013194"},{"key":"50244_CR25","first-page":"1","volume":"14","author":"E Ben-Sasson","year":"2018","unstructured":"Ben-Sasson E, Bentov I, Horesh Y, Riabzev M. Fast reed-Solomon interactive oracle proofs of proximity. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming. 2018, 14: 1\u201314: 17","journal-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming"},{"key":"50244_CR26","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-36594-2_13","volume-title":"Proceedings of the 10th Theory of Cryptography Conference","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou C, Shi E, Tamassia R. Signatures of correct computation. In: Proceedings of the 10th Theory of Cryptography Conference. 2013, 222\u2013242"},{"key":"50244_CR27","first-page":"513","volume-title":"Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology","author":"T Attema","year":"2020","unstructured":"Attema T, Cramer R. Compressed \u03a3-protocol theory and practical application to plug & play secure algorithmics. In: Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology. 2020, 513\u2013543"},{"key":"50244_CR28","first-page":"65","volume-title":"Proceedings of the 27th International Conference on the Theory and Application of Cryptology and Information Security","author":"B B\u00fcnz","year":"2021","unstructured":"B\u00fcnz B, Maller M, Mishra P, Tyagi N, Vesely P. Proofs for inner pairing products and applications. In: Proceedings of the 27th International Conference on the Theory and Application of Cryptology and Information Security. 2021, 65\u201397"},{"key":"50244_CR29","first-page":"2","volume-title":"Proceedings of the 31st Annual Symposium on Foundations of Computer Science","author":"C Lund","year":"1990","unstructured":"Lund C, Fortnow L, Karloff H J, Nisan N. Algebraic methods for interactive proof systems. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science. 1990, 2\u201310"},{"issue":"3","key":"50244_CR30","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s11704-013-3120-4","volume":"8","author":"H Tian","year":"2014","unstructured":"Tian H, Li J. A short non-delegatable strong designated verifier signature. Frontiers of Computer Science, 2014, 8(3): 490\u2013502.","journal-title":"Frontiers of Computer Science"},{"issue":"2","key":"50244_CR31","doi-asserted-by":"publisher","first-page":"182806","DOI":"10.1007\/s11704-023-2365-9","volume":"18","author":"B S Reddy","year":"2024","unstructured":"Reddy B S, Reddy T U K. CompactChain: an efficient stateless chain for UTXO-model blockchain. Frontiers of Computer Science, 2024, 18(2): 182806.","journal-title":"Frontiers of Computer Science"},{"issue":"1","key":"50244_CR32","doi-asserted-by":"publisher","first-page":"181802","DOI":"10.1007\/s11704-022-2288-x","volume":"18","author":"H Liang","year":"2024","unstructured":"Liang H, Chen J. Non-interactive SM2 threshold signature scheme with identifiable abort. Frontiers of Computer Science, 2024, 18(1): 181802.","journal-title":"Frontiers of Computer Science"},{"issue":"3","key":"50244_CR33","doi-asserted-by":"publisher","first-page":"193802","DOI":"10.1007\/s11704-024-3542-1","volume":"19","author":"C Ying","year":"2025","unstructured":"Ying C, Jin H, Li J, Si X, Luo Y. Incentive mechanism design via smart contract in blockchain-based edge-assisted crowdsensing. Frontiers of Computer Science, 2025, 19(3): 193802.","journal-title":"Frontiers of Computer Science"},{"issue":"5","key":"50244_CR34","doi-asserted-by":"publisher","first-page":"185812","DOI":"10.1007\/s11704-023-2782-9","volume":"18","author":"J Sha","year":"2024","unstructured":"Sha J, Liu S. Delegable zk-SNARKs with proxies. Frontiers of Computer Science, 2024, 18(5): 185812.","journal-title":"Frontiers of Computer Science"},{"key":"50244_CR35","series-title":"Massachusetts Institute of Technology, Dissertation","volume-title":"Uses of randomness in algorithms and protocols","author":"J Kilian","year":"1989","unstructured":"Kilian J. Uses of randomness in algorithms and protocols. Massachusetts Institute of Technology, Dissertation, 1989"},{"key":"50244_CR36","first-page":"494","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing","author":"R Canetti","year":"2002","unstructured":"Canetti R, Lindell Y, Ostrovsky R, Sahai A. Universally composable two-party and multi-party secure computation. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing. 2002, 494\u2013503"},{"key":"50244_CR37","first-page":"955","volume-title":"Proceedings of 2013 ACM SIGSAC Conference on Computer & Communications Security","author":"M Jawurek","year":"2013","unstructured":"Jawurek M, Kerschbaum F, Orlandi C. Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: Proceedings of 2013 ACM SIGSAC Conference on Computer & Communications Security. 2013, 955\u2013966"},{"key":"50244_CR38","first-page":"1069","volume-title":"Proceedings of the 25th USENIX Security Symposium","author":"I Giacomelli","year":"2016","unstructured":"Giacomelli I, Madsen J, Orlandi C. ZKBoo: faster zero-knowledge for Boolean circuits. In: Proceedings of the 25th USENIX Security Symposium. 2016, 1069\u20131083"},{"key":"50244_CR39","first-page":"1825","volume-title":"Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security","author":"M Chase","year":"2017","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: Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017, 1825\u20131842"},{"key":"50244_CR40","first-page":"884","volume-title":"Proceedings of 2024 on ACM SIGSAC Conference on Computer and Communications Security","author":"C Ganesh","year":"2024","unstructured":"Ganesh C, Nair V, Sharma A. Dual polynomial commitment schemes and applications to commit-and-prove SNARKs. In: Proceedings of 2024 on ACM SIGSAC Conference on Computer and Communications Security. 2024, 884\u2013898"},{"issue":"1","key":"50244_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.62056\/an-4c3c2h","volume":"2","author":"M Orr\u00f9","year":"2025","unstructured":"Orr\u00f9 M, Kadianakis G, Maller M, Zaverucha G. Beyond the circuit: how to minimize foreign arithmetic in ZKP circuits. IACR Communications in Cryptology, 2025, 2(1): 23.","journal-title":"IACR Communications in Cryptology"},{"key":"50244_CR42","first-page":"527","volume-title":"Proceedings of the 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography","author":"V Daza","year":"2020","unstructured":"Daza V, R\u00e0fols C, Zacharakis A. Updateable inner product argument with logarithmic verifier and applications. In: Proceedings of the 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography. 2020, 527\u2013557"},{"issue":"2","key":"50244_CR43","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh D, Boyen X. Short signatures without random oracles and the SDH assumption in bilinear groups. Journal of Cryptology, 2008, 21(2): 149\u2013177.","journal-title":"Journal of Cryptology"},{"key":"50244_CR44","first-page":"33","volume-title":"Proceedings of the 38th Annual International Cryptology Conference on Advances in Cryptology","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer G, Kiltz E, Loss J. The algebraic group model and its applications. In: Proceedings of the 38th Annual International Cryptology Conference on Advances in Cryptology. 2018, 33\u201362"},{"key":"50244_CR45","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-031-22318-1_5","volume-title":"Proceedings of the 20th International Conference on Theory of Cryptography","author":"T Attema","year":"2022","unstructured":"Attema T, Fehr S, Kloo\u00df M. Fiat-Shamir transformation of multi-round interactive proofs. In: Proceedings of the 20th International Conference on Theory of Cryptography. 2022, 113\u2013142"},{"issue":"3","key":"50244_CR46","first-page":"26","volume":"1","author":"D Wikstr\u00f6m","year":"2024","unstructured":"Wikstr\u00f6m D. Special soundness in the random oracle model. IACR Communications in Cryptology, 2024, 1(3): 26.","journal-title":"IACR Communications in Cryptology"},{"key":"50244_CR47","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/2090236.2090245","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","author":"G Cormode","year":"2012","unstructured":"Cormode G, Mitzenmacher M, Thaler J. Practical verified computation with streaming interactive proofs. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 2012, 90\u2013112"},{"key":"50244_CR48","first-page":"677","volume-title":"Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz B, Fisch B, Szepieniec A. Transparent SNARKs from DARK compilers. In: Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2020, 677\u2013706"},{"issue":"4","key":"50244_CR49","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J T Schwartz","year":"1980","unstructured":"Schwartz J T. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM (JACM), 1980, 27(4): 701\u2013717.","journal-title":"Journal of the ACM (JACM)"},{"key":"50244_CR50","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/SP.2018.00020","volume-title":"Proceedings of 2018 IEEE Symposium on Security and Privacy","author":"B B\u00fcnz","year":"2018","unstructured":"B\u00fcnz B, Bootle J, Boneh D, Poelstra A, Wuille P, Maxwell G. Bulletproofs: short proofs for confidential transactions and more. In: Proceedings of 2018 IEEE Symposium on Security and Privacy. 2018, 315\u2013334"},{"key":"50244_CR51","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/SP.2018.00060","volume-title":"Proceedings of 2018 IEEE Symposium on Security and Privacy","author":"R S Wahby","year":"2018","unstructured":"Wahby R S, Tzialla I, Shelat A, Thaler J, Walfish M. Doubly-efficient zkSNARKs without trusted setup. In: Proceedings of 2018 IEEE Symposium on Security and Privacy. 2018, 926\u2013943"},{"key":"50244_CR52","first-page":"138","volume-title":"Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology","author":"H Zeilberger","year":"2024","unstructured":"Zeilberger H, Chen B, Fisch B. BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology. 2024, 138\u2013169"},{"key":"50244_CR53","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/SP.2013.48","volume-title":"Proceedings of 2013 IEEE Symposium on Security and Privacy","author":"V Vu","year":"2013","unstructured":"Vu V, Setty S, Blumberg A J, Walfish M. A hybrid architecture for interactive verifiable computation. In: Proceedings of 2013 IEEE Symposium on Security and Privacy. 2013, 223\u2013237"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-50244-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-50244-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-50244-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T05:35:00Z","timestamp":1771565700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-50244-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,20]]},"references-count":53,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["50244"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-50244-z","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,20]]},"assertion":[{"value":"7 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2010813"}}