{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:26:25Z","timestamp":1772119585381,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:00:00Z","timestamp":1763683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:00:00Z","timestamp":1763683200000},"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":["Form Methods Syst Des"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10703-025-00483-4","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T16:09:49Z","timestamp":1763741389000},"page":"282-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded satisfiability checking of $$\\hbox {FOL}^*$$ formulas with aggregations"],"prefix":"10.1007","volume":"67","author":[{"given":"Nick","family":"Feng","sequence":"first","affiliation":[]},{"given":"Lina","family":"Marsso","sequence":"additional","affiliation":[]},{"given":"Yuliia","family":"Kholodetska","sequence":"additional","affiliation":[]},{"given":"Marsha","family":"Chechik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,21]]},"reference":[{"key":"483_CR1","doi-asserted-by":"crossref","unstructured":"Feng N, Marsso L, Sabetzadeh M, Chechik M (2023) Early Verification of Legal Compliance via Bounded Satisfiability Checking. In: Proceedings of the 34th International Conference on Computer-Aided Verification (CAV\u201923), Paris, France. Lecture Notes in Computer Science. Springer","DOI":"10.1007\/978-3-031-37709-9_18"},{"key":"483_CR2","doi-asserted-by":"crossref","unstructured":"Feng N, Marsso L, Getir-Yaman S, Beverley T, Calinescu R, Cavalcanti A, Chechik M (2023) Towards a formal framework for normative requirements elicitation. In: Proceedings of the 38th International Conference on Automated Software Engineering, (ASE\u20192023), Kirchberg, Luxembourg. IEEE","DOI":"10.1109\/ASE56229.2023.00152"},{"key":"483_CR3","doi-asserted-by":"crossref","unstructured":"Feng N, Marsso L, Yaman SG, Townsend B, Baatartogtokh Y, Ayad R, Mello VO, Kholodetska Y, Standen I, Stefanakos I, Imrie C, Rodrigues G, Cavalcanti A, Calinescu R, Chechik M (2024) Analyzing and debugging normative requirements via satisfiability checking. In: Proceedings of the 46th International Conference on Software Engineering, (ICSE 2024), Lisbon, Portugal. ACM","DOI":"10.1145\/3597503.3639093"},{"key":"483_CR4","doi-asserted-by":"publisher","unstructured":"Basin DA, Klaedtke F, M\u00fcller S (2010) Policy monitoring in first-order temporal logic. In: Touili T, Cook B, Jackson PB (eds.) Computer Aided verification, 22nd international conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings. Lecture notes in Computer Science, vol. 6174, pp. 1\u201318. Springer. https:\/\/doi.org\/10.1007\/978-3-642-14295-6_1","DOI":"10.1007\/978-3-642-14295-6_1"},{"key":"483_CR5","doi-asserted-by":"publisher","unstructured":"Yaman SG, Burholt C, Jones M, Calinescu R, Cavalcanti A (2023) Specification and validation of normative rules for autonomous agents. In: Lambers L, Uchitel S (eds.) Fundamental approaches to software engineering\u201426th international conference, FASE 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22\u201327, 2023, Proceedings. Lecture notes in Computer Science. 13991: 241\u2013248. Springer. https:\/\/doi.org\/10.1007\/978-3-031-30826-0_13","DOI":"10.1007\/978-3-031-30826-0_13"},{"key":"483_CR6","unstructured":"EU payment services directive: directive 2007\/64\/EC of the European parliament and of the council of 13 october 2000 establishing a framework for payment services in the internal market amending. https:\/\/eur-lex.europa.eu\/eli\/dir\/2007\/64\/2009-12-07"},{"key":"483_CR7","unstructured":"Mohapatra A, Genesereth M (2012) Aggregation in datalog under set semantics. Technical report, Tech. rep. 2012. url: http:\/\/logic.stanford.edu\/reports\/LG-2012-01.pdf"},{"key":"483_CR8","doi-asserted-by":"publisher","unstructured":"Alviano M, Greco G, Leone N (2011) Dynamic magic sets for programs with monotone recursive aggregates. In: Delgrande, J.P., Faber, W. (eds.) Logic programming and nonmonotonic reasoning\u201411th international conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings. Lecture notes in Computer Science. 6645: 148\u2013160. Springer. https:\/\/doi.org\/10.1007\/978-3-642-20895-9_14","DOI":"10.1007\/978-3-642-20895-9_14"},{"issue":"1","key":"483_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber W, Pfeifer G, Leone N (2011) Semantics and complexity of recursive aggregates in answer set programming. Artif Intell 175(1):278\u2013298. https:\/\/doi.org\/10.1016\/j.artint.2010.04.002","journal-title":"Artif Intell"},{"key":"483_CR10","unstructured":"Nick Feng YK, Lina M, Chechik M. LEGOS-A: bounded satisfiability checking of FOL* formulas with aggregations. https:\/\/github.com\/NickF0211\/F-BSC-TOOL\/"},{"key":"483_CR11","doi-asserted-by":"crossref","unstructured":"Narodytska N, Bacchus F (2014) Maximum satisfiability using core-guided maxsat resolution. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the twenty-eighth AAAI conference on artificial intelligence, July 27\u201331, 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada, pp. 2717\u20132723. AAAI Press. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8513","DOI":"10.1609\/aaai.v28i1.9124"},{"key":"483_CR12","doi-asserted-by":"crossref","unstructured":"De Moura L, Bj\u00f8rner N. Z3: an efficient smt solver. In: International conference on tools and algorithms for the construction and analysis of systems, pp. 337\u2013340. Springer","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"483_CR13","doi-asserted-by":"publisher","unstructured":"Barbosa H, Barrett CW, Brain M, Kremer G, Lachnitt H, Mann M, Mohamed A, Mohamed M, Niemetz A, N\u00f6tzli A, Ozdemir A, Preiner M, Reynolds A, Sheng Y, Tinelli C, Zohar Y (2022) cvc5: a versatile and industrial-strength smt solver. In: Proceedings of the 28th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u20192022), Munich, Germany. LNCS. 13243: 415\u2013442. Springer. https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"483_CR14","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs L, Voronkov A (2013) First-order theorem proving and vampire. In: Sharygina N, Veith H (eds.) Computer aided verification\u201425th international conference, CAV 2013, Saint Petersburg, Russia, July 13\u201319. Proceedings. Lecture notes in Computer Science. 8044: 1\u201335. Springer. https:\/\/doi.org\/10.1007\/978-3-642-39799-8_1","DOI":"10.1007\/978-3-642-39799-8_1"},{"key":"483_CR15","doi-asserted-by":"publisher","unstructured":"Eppstein D, Galil Z, Italiano GF (2024) Dynamic graph algorithms. In: Atallah, M.J. (ed.) Algorithms and theory of computation handbook. Chapman & Hall\/CRC Applied Algorithms and Data Structures series. CRC Press. https:\/\/doi.org\/10.1201\/9781420049503-c9","DOI":"10.1201\/9781420049503-c9"},{"key":"483_CR16","unstructured":"Denecker M, De Cat B (2010) DPLL (Agg): an efficient smt module for aggregates. In: Logic and search"},{"key":"483_CR17","unstructured":"Feng N, Marsso L, Garavel H (2021) Health record. Model checking context model (MCC\u201921), Dept. of Computer Science - University of Toronto. https:\/\/mcc.lip6.fr\/pdf\/HealthRecord-form.pdf"},{"key":"483_CR18","doi-asserted-by":"publisher","unstructured":"Arfelt E, Basin DA, Debois S (2019) Monitoring the GDPR. In: Sako K, Schneider SA, Ryan PYA (eds.) Computer Security\u2014ESORICS 2019\u201424th European symposium on research in computer security, Luxembourg, September 23-27, , Proceedings, Part I. Lecture notes in Computer Science. 11735: 681\u2013699. Springer. https:\/\/doi.org\/10.1007\/978-3-030-29959-0_33","DOI":"10.1007\/978-3-030-29959-0_33"},{"issue":"2","key":"483_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2699444","volume":"62","author":"DA Basin","year":"2015","unstructured":"Basin DA, Klaedtke F, M\u00fcller S, Zalinescu E (2015) Monitoring metric first-order temporal properties. J ACM 62(2):15\u201311545. https:\/\/doi.org\/10.1145\/2699444","journal-title":"J ACM"},{"key":"483_CR20","unstructured":"Liaqat D, Lara E. The COVIDFree@Home website. https:\/\/covidfreeathome.org\/"},{"key":"483_CR21","doi-asserted-by":"crossref","unstructured":"Mattarei C, Cimatti A, Gario M, Tonetta S, Rozier KY (2015) Comparing different functional allocations in automated air traffic control design. In: Kaivola R, Wahl T (eds.) Formal methods in computer-aided design (FMCAD\u20192015), Austin, Texas, USA, pp. 112\u2013119. IEEE","DOI":"10.1109\/FMCAD.2015.7542260"},{"key":"483_CR22","doi-asserted-by":"publisher","unstructured":"Gario M, Cimatti A, Mattarei C, Tonetta S, Rozier KY (2016) Model checking at scale: automated air traffic control design space exploration. In: Chaudhuri S, Farzan A (eds.) Proceedings of the 28th international conference on computer aided verification (CAV\u20192016), Toronto, ON, Canada. LNCS. 9780: 3\u201322. Springer. https:\/\/doi.org\/10.1007\/978-3-319-41540-6_1","DOI":"10.1007\/978-3-319-41540-6_1"},{"key":"483_CR23","unstructured":"Liu M (1998) Overview of datalog extensions. In: Fraternali P, Geske U, Ruiz C, Seipel D (eds.) Proceedings of the 6th international workshop on deductive databases and logic programming (DDLP\u201998). In Conjunction with JICSLP\u201998. GMD Report. 22: 99\u2013112"},{"key":"483_CR24","doi-asserted-by":"publisher","unstructured":"Jordan H, Scholz B, Subotic P (2016) Souffl\u00e9: on synthesis of program analyzers. In: Proceedings of the 28th international conference on computer aided verification (CAV\u20192016), Toronto, ON, Canada. Lecture notes in Computer Science. 9780: 422\u2013430. Springer. https:\/\/doi.org\/10.1007\/978-3-319-41540-6_23","DOI":"10.1007\/978-3-319-41540-6_23"},{"key":"483_CR25","doi-asserted-by":"crossref","unstructured":"Seo J, Guo S, Lam MS (2013) SociaLite: datalog extensions for efficient social network analysis. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 278\u2013289. IEEE","DOI":"10.1109\/ICDE.2013.6544832"},{"issue":"14","key":"483_CR26","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.14778\/2556549.2556572","volume":"6","author":"J Seo","year":"2013","unstructured":"Seo J, Park J, Shin J, Lam MS (2013) Distributed socialite: a datalog-based language for large-scale graph analysis. Proc VLDB Endowment 6(14):1906\u20131917","journal-title":"Proc VLDB Endowment"},{"key":"483_CR27","doi-asserted-by":"crossref","unstructured":"Shkapsky A, Yang M, Interlandi M, Chiu H, Condie T, Zaniolo C (2016) Big data analytics with datalog queries on spark. In: Proceedings of the 2016 International Conference on Management of Data. pp. 1135\u20131149","DOI":"10.1145\/2882903.2915229"},{"key":"483_CR28","unstructured":"Bartholomew M, Lee J, Meng Y (2011) First-order semantics of aggregates in answer set programming via modified circumscription. In: Logical formalizations of commonsense reasoning, papers from the 2011 AAAI Spring Symposium, Technical Report SS-11-06, Stanford, California, USA, March 21-23, 2011. AAAI"},{"issue":"4","key":"483_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1970398.1970401","volume":"12","author":"P Ferraris","year":"2011","unstructured":"Ferraris P (2011) Logic programs with propositional connectives and aggregates. ACM Trans Comput Log 12(4):25\u201312540. https:\/\/doi.org\/10.1145\/1970398.1970401","journal-title":"ACM Trans Comput Log"},{"key":"483_CR30","doi-asserted-by":"publisher","unstructured":"Alviano M, Calimeri F, Dodaro C, Fusc\u00e0 D, Leone N, Perri S, Ricca F, Veltri P, Zangari J The ASP system DLV2. In: Balduccini M, Janhunen T (eds.) Logic programming and nonmonotonic reasoning\u201414th international conference, LPNMR 2017, Espoo, Finland, July 3\u20136, 2017, Proceedings. Lecture notes in Computer Science. 10377: 215\u2013221. Springer. https:\/\/doi.org\/10.1007\/978-3-319-61660-5_19","DOI":"10.1007\/978-3-319-61660-5_19"},{"key":"483_CR31","doi-asserted-by":"publisher","unstructured":"Alviano M, Dodaro C, Faber W, Leone N, Ricca F (2013) WASP: a native ASP solver based on constraint learning. In: Cabalar P, Son TC (eds.) Proceedings of the 12th international conference on logic programming and nonmonotonic reasoning (LPNMR\u20192013), Corunna, Spain. LNCS. 8148: 54\u201366. Springer. https:\/\/doi.org\/10.1007\/978-3-642-40564-8_6","DOI":"10.1007\/978-3-642-40564-8_6"},{"issue":"2","key":"483_CR32","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/505145.505149","volume":"11","author":"D Jackson","year":"2002","unstructured":"Jackson D (2002) Alloy: a lightweight object modelling notation. ACM Trans Softw Eng Methodol 11(2):256\u2013290. https:\/\/doi.org\/10.1145\/505145.505149","journal-title":"ACM Trans Softw Eng Methodol"},{"key":"483_CR33","doi-asserted-by":"publisher","unstructured":"Brunel J, Chemouil D, Cunha A, Macedo N (2018) The electrum analyzer: model checking relational first-order temporal specifications. In: Huchard M, K\u00e4stner C, Fraser G (eds.) Proceedings of the 33rd international conference on automated software engineering, (ASE 2018), Montpellier, France, pp. 884\u2013887. ACM. https:\/\/doi.org\/10.1145\/3238147.3240475","DOI":"10.1145\/3238147.3240475"},{"key":"483_CR34","doi-asserted-by":"publisher","unstructured":"Basin DA, Klaedtke F, Zalinescu E (2017) The monpoly monitoring tool. In: Reger, G., Havelund, K. (eds.) RV-CuBES 2017. An international workshop on competitions, usability, benchmarks, evaluation, and standardisation for runtime verification tools, September 15, 2017, Seattle, WA, USA. Kalpa Publications in Computing. 3: 19\u201328. EasyChair. https:\/\/doi.org\/10.29007\/89hs","DOI":"10.29007\/89hs"},{"key":"483_CR35","unstructured":"Denecker M, De Cat B (2010) Dpll (agg): an efficient smt module for aggregates. In: Logic and Search, Date: 2010\/07\/15-2010\/07\/15, Location: Edinburgh"},{"key":"483_CR36","doi-asserted-by":"publisher","unstructured":"Piskac R, Kuncak V Linear arithmetic with stars. In: Gupta A, Malik S (eds.) Computer aided verification, 20th international conference, CAV 2008, Princeton, NJ, USA, July 7-14, 2008, Proceedings. Lecture notes in Computer Science. 5123: 268\u2013280. Springer. https:\/\/doi.org\/10.1007\/978-3-540-70545-1_25","DOI":"10.1007\/978-3-540-70545-1_25"},{"key":"483_CR37","doi-asserted-by":"publisher","unstructured":"Levatich M, Bj\u00f8rner NS, Piskac R, Shoham S (2020) Solving $$\\rm LIA^{\\star }$$ using approximations. In: Beyer D, Zufferey D (eds.) Verification, model checking, and abstract interpretation\u201421st international conference, VMCAI 2020, New Orleans, LA, USA, January 16-21, 2020, Proceedings. Lecture notes in Computer Science. 11990: 360\u2013378. Springer. https:\/\/doi.org\/10.1007\/978-3-030-39322-9_17","DOI":"10.1007\/978-3-030-39322-9_17"},{"key":"483_CR38","doi-asserted-by":"publisher","unstructured":"Rozier KY, Vardi MY (2007) LTL satisfiability checking. In: Bosnacki D, Edelkamp S (eds.) Proceedings of the 14th international workshop on model checking software (SPIN\u201907), Berlin, Germany. Lecture notes in Computer Science. 4595: 149\u2013167. Springer. https:\/\/doi.org\/10.1007\/978-3-540-73370-6_11","DOI":"10.1007\/978-3-540-73370-6_11"},{"key":"483_CR39","doi-asserted-by":"publisher","unstructured":"Li J, Zhang L, Pu G, Vardi MY, He J (2013) LTL satisfiability checking revisited. In: Proceedings of the 20th international symposium on temporal representation and reasoning, Pensacola, FL, USA. pp. 91\u201398. IEEE Computer Society. https:\/\/doi.org\/10.1109\/TIME.2013.19","DOI":"10.1109\/TIME.2013.19"},{"key":"483_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103369","volume":"289","author":"J Li","year":"2020","unstructured":"Li J, Pu G, Zhang Y, Vardi MY, Rozier KY (2020) SAT-based explicit LTLf satisfiability checking. Artif Intell 289:103369. https:\/\/doi.org\/10.1016\/j.artint.2020.103369","journal-title":"Artif Intell"},{"key":"483_CR41","doi-asserted-by":"crossref","unstructured":"Li J, Rozier KY, Pu G, Zhang Y, Vardi MY (2019) SAT-based explicit LTLf satisfiability checking. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 2946\u20132953. AAAI Press","DOI":"10.1609\/aaai.v33i01.33012946"},{"issue":"6","key":"483_CR42","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1093\/logcom\/exy013","volume":"28","author":"J Li","year":"2018","unstructured":"Li J, Pu G, Zhang L, Vardi MY, He J (2018) Accelerating LTL satisfiability checking by SAT solvers. J Log Comput 28(6):1011\u20131030","journal-title":"J Log Comput"},{"issue":"4","key":"483_CR43","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.jal.2014.07.005","volume":"12","author":"MM Bersani","year":"2014","unstructured":"Bersani MM, Frigeri A, Morzenti A, Pradella M, Rossi M, Pietro PS (2014) Constraint LTL satisfiability checking without automata. J Appl Log 12(4):522\u2013557. https:\/\/doi.org\/10.1016\/j.jal.2014.07.005","journal-title":"J Appl Log"},{"issue":"3","key":"483_CR44","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2491509.2491514","volume":"22","author":"M Pradella","year":"2013","unstructured":"Pradella M, Morzenti A, Pietro PS (2013) Bounded satisfiability checking of metric temporal logic specifications. ACM Trans Softw Eng Methodol 22(3):20\u201312054. https:\/\/doi.org\/10.1145\/2491509.2491514","journal-title":"ACM Trans Softw Eng Methodol"},{"key":"483_CR45","doi-asserted-by":"publisher","unstructured":"Li J, Vardi MY, Rozier KY Satisfiability checking for mission-time LTL. In: Dillig, I., Tasiran, S. (eds.) Computer aided verification\u201431st international conference, CAV 2019, New York City, NY, USA, July 15\u201318, 2019, Proceedings, Part II. Lecture notes in Computer Science. 11562: 3\u201322. Springer. https:\/\/doi.org\/10.1007\/978-3-030-25543-5_1","DOI":"10.1007\/978-3-030-25543-5_1"},{"issue":"POPL","key":"483_CR46","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/3290364","volume":"3","author":"K Bae","year":"2019","unstructured":"Bae K, Lee J (2019) Bounded model checking of signal temporal logic properties using syntactic separation. Proc ACM Program Lang 3(POPL):51\u201315130. https:\/\/doi.org\/10.1145\/3290364","journal-title":"Proc ACM Program Lang"},{"key":"483_CR47","doi-asserted-by":"publisher","unstructured":"Moura LM, Bj\u00f8rner (2008) NS Z3: an efficient smt solver. In: Ramakrishnan CR, Rehof J (eds.) Proceedings of the 14th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u20192008), Budapest, Hungary. Lecture notes in Computer Science. 4963: pp. 337\u2013340. Springer. https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"483_CR48","doi-asserted-by":"publisher","unstructured":"Reynolds A, Tinelli C, Goel A, Krstic S (2013) Finite model finding in smt. In: Sharygina N, Veith H (eds.) Computer aided verification\u201425th international conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings. Lecture notes in Computer Science. 8044: 640\u2013655. Springer. https:\/\/doi.org\/10.1007\/978-3-642-39799-8_42","DOI":"10.1007\/978-3-642-39799-8_42"},{"key":"483_CR49","doi-asserted-by":"publisher","unstructured":"Reynolds A, Tinelli C, Goel A, Krstic S, Deters M, Barrett CW (2013) Quantifier instantiation techniques for finite model finding in smt. In: Bonacina MP (ed.) Automated Deduction\u2014CADE-24\u201424th International conference on automated deduction, Lake Placid, NY, USA, June 9\u201314, 2013. Proceedings. Lecture notes in Computer Science. 7898: 377\u2013391. Springer. https:\/\/doi.org\/10.1007\/978-3-642-38574-2_26","DOI":"10.1007\/978-3-642-38574-2_26"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-025-00483-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10703-025-00483-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-025-00483-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T16:13:53Z","timestamp":1764346433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10703-025-00483-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,21]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["483"],"URL":"https:\/\/doi.org\/10.1007\/s10703-025-00483-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4974405\/v1","asserted-by":"object"}]},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,21]]},"assertion":[{"value":"26 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}