{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:51:02Z","timestamp":1783702262300,"version":"3.55.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61972110"],"award-info":[{"award-number":["61972110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61832003"],"award-info":[{"award-number":["61832003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["U1811461"],"award-info":[{"award-number":["U1811461"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["U19A2059"],"award-info":[{"award-number":["U19A2059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s00778-022-00738-0","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T16:55:31Z","timestamp":1649782531000},"page":"173-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation and inapproximability results on computing optimal repairs"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9370-7088","authenticated-orcid":false,"given":"Dongjing","family":"Miao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pengfei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ye","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,12]]},"reference":[{"key":"738_CR1","volume-title":"Foundations of Databases: The Logical Level","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison-Wesley, Boston (1995)"},{"key":"738_CR2","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Kolaitis, P.G.: Repair checking in inconsistent databases: algorithms and complexity. In: ICDT, pp. 31\u201341 (2009)","DOI":"10.1145\/1514894.1514899"},{"issue":"38\u201340","key":"738_CR3","doi-asserted-by":"publisher","first-page":"3751","DOI":"10.1016\/j.tcs.2009.04.028","volume":"410","author":"O Amini","year":"2009","unstructured":"Amini, O., P\u00e9rennes, S., Sau, I.: Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38\u201340), 3751\u20133760 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"738_CR4","doi-asserted-by":"crossref","unstructured":"Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: PODS, pp. 68\u201379 (1999)","DOI":"10.1145\/303976.303983"},{"issue":"4","key":"738_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1017\/S1471068403001832","volume":"3","author":"M Arenas","year":"2003","unstructured":"Arenas, M., Bertossi, L., Chomicki, J.: Answer sets for consistent query answering in inconsistent databases. Theor. Pract. Log. Prog. 3(4), 393\u2013424 (2003)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"3","key":"738_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0304-3975(02)00737-5","volume":"296","author":"M Arenas","year":"2003","unstructured":"Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theor. Comput. Sci. 296(3), 405\u2013434 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"738_CR7","doi-asserted-by":"crossref","unstructured":"Assadi, A., Milo, T., Novgorodov, S.: $$\\text{DANCE}$$: data cleaning with constraints and experts. In: ICDE, pp. 1409\u20131410 (2017)","DOI":"10.1109\/ICDE.2017.199"},{"issue":"2","key":"738_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198\u2013203 (1981)","journal-title":"J. Algorithms"},{"key":"738_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldwasser, S., Lund, C., Russeli, A.: Efficient probabilistically checkable proofs and applications to approximations. In: STOC, pp. 294\u2013304 (1993)","DOI":"10.1145\/167088.167174"},{"issue":"12","key":"738_CR10","first-page":"1900","volume":"8","author":"M Bergman","year":"2015","unstructured":"Bergman, M., Milo, T., Novgorodov, S., Tan, W.C.: $$\\text{ QOCO }$$: a query oriented data cleaning system with oracles. PVLDB 8(12), 1900\u20131903 (2015)","journal-title":"PVLDB"},{"key":"738_CR11","doi-asserted-by":"crossref","unstructured":"Bertossi, L.: Database repairs and consistent query answering: origins and further developments. In: PODS, pp. 48\u201358 (2019)","DOI":"10.1145\/3294052.3322190"},{"key":"738_CR12","doi-asserted-by":"crossref","unstructured":"Bertossi, L.: Repair-based degrees of database inconsistency. In: LPNMR, pp. 195\u2013209 (2019)","DOI":"10.1007\/978-3-030-20528-7_15"},{"key":"738_CR13","doi-asserted-by":"crossref","unstructured":"Bertossi, L., Bravo, L., Franconi, E., Lopatenko, A.: Fixing numerical attributes under integrity constraints. In: Proceedings of International Symposium on Database Programming Languages (DBPL 05). Springer LNCS, vol. 3774, pp. 262\u2013278 (2005)","DOI":"10.1007\/11601524_17"},{"issue":"4","key":"738_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.is.2008.01.005","volume":"33","author":"L Bertossi","year":"2008","unstructured":"Bertossi, L., Bravo, L., Franconi, E., Lopatenko, A.: The complexity and approximation of fixing numerical attributes in databases under integrity constraints. Inf. Syst. 33(4), 407\u2013434 (2008)","journal-title":"Inf. Syst."},{"key":"738_CR15","doi-asserted-by":"crossref","unstructured":"Bohannon, P., Fan, W., Flaster, M., Rastogi, R.: A cost-based model and effective heuristic for repairing constraints by value modification. In: SIGMOD, pp. 143\u2013154 (2005)","DOI":"10.1145\/1066157.1066175"},{"key":"738_CR16","doi-asserted-by":"crossref","unstructured":"Bohannon, P., Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for data cleaning. In: ICDE, pp. 746\u2013755 (2007)","DOI":"10.1109\/ICDE.2007.367920"},{"key":"738_CR17","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2014.06.001","volume":"196","author":"N Boria","year":"2015","unstructured":"Boria, N., Croce, F.D., Paschos, V.T.: On the max min vertex cover problem. Discrete Appl. Math. 196, 62\u201371 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"738_CR18","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.datak.2010.01.005","volume":"69","author":"M Caniup\u00e1n","year":"2010","unstructured":"Caniup\u00e1n, M., Bertossi, L.: The consistency extractor system: answer set programs for consistent query answering in databases. Data Knowl. Eng. 69(6), 545\u2013572 (2010)","journal-title":"Data Knowl. Eng."},{"key":"738_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jda.2012.01.003","volume":"13","author":"J Cardinal","year":"2012","unstructured":"Cardinal, J., Karpinski, M., Schmied, R., Viehmann, C.: Approximating vertex cover in dense hypergraphs. J. Discrete Algorithms 13, 67\u201377 (2012). https:\/\/doi.org\/10.1016\/j.jda.2012.01.003","journal-title":"J. Discrete Algorithms"},{"key":"738_CR20","doi-asserted-by":"crossref","unstructured":"Caruccio, L., Vincenzo, D., Polese, G.: Mining relaxed functional dependencies from data. Data Min. Knowl. Discov. (2019)","DOI":"10.1007\/s10618-019-00667-7"},{"issue":"40","key":"738_CR21","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40), 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"738_CR22","doi-asserted-by":"crossref","unstructured":"Chiang, F., Miller, R.J.: A unified model for data and constraint repair. In: ICDE, pp. 446\u2013457 (2011)","DOI":"10.1109\/ICDE.2011.5767833"},{"key":"738_CR23","doi-asserted-by":"crossref","unstructured":"Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197(1\u20132) (2005)","DOI":"10.1016\/j.ic.2004.04.007"},{"key":"738_CR24","unstructured":"Chu, X., Ilyas, I.F., Papotti, P.: Holistic data cleaning: putting violations into context. In: ICDE, pp. 458\u2013469 (2013)"},{"key":"738_CR25","doi-asserted-by":"crossref","unstructured":"Chu, X., Ilyas, I.F., Krishnan, S., Wang, J.: Data cleaning: overview and emerging challenges. In: SIGMOD, pp. 2201\u20132206 (2016)","DOI":"10.1145\/2882903.2912574"},{"issue":"3","key":"738_CR26","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979). https:\/\/doi.org\/10.1287\/moor.4.3.233","journal-title":"Math. Oper. Res."},{"issue":"1","key":"738_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3424305","volume":"68","author":"MB Cohen","year":"2021","unstructured":"Cohen, M.B., Lee, Y.T., Song, Z.: Solving linear programs in the current matrix multiplication time. J ACM 68(1), 1\u201339 (2021)","journal-title":"J ACM"},{"issue":"6","key":"738_CR28","first-page":"315","volume":"7","author":"G Cong","year":"2007","unstructured":"Cong, G., Fan, W., Geerts, F., Jia, X., Ma, S.: Improving data quality: consistency and accuracy. PVLDB 7(6), 315\u2013325 (2007)","journal-title":"PVLDB"},{"key":"738_CR29","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: CCC, pp. 262\u2013273 (1997)"},{"key":"738_CR30","doi-asserted-by":"crossref","unstructured":"Dallachiesa, M., Ebaid, A., Eldawy, A., Elmagarmid, A., Ilyas, I.F., Ouzzani, M., Tang, N.: $$\\text{ NADEEF }$$: a commodity data cleaning system. In: SIGMOD, pp. 541\u2013552 (2013)","DOI":"10.1145\/2463676.2465327"},{"key":"738_CR31","unstructured":"De\u00a0Sa, C., Ilyas, I.F., Kimelfeld, B., R\u00e9, C., Rekatsinas, T.: A formal framework for probabilistic unclean databases. In: ICDT, pp. 26\u201328 (2019)"},{"key":"738_CR32","doi-asserted-by":"crossref","unstructured":"Dixit, A.A.: $$\\text{ CAvSAT }$$: a system for query answering over inconsistent databases. In: SIGMOD, pp. 1823\u20131825 (2019)","DOI":"10.1145\/3299869.3300095"},{"key":"738_CR33","doi-asserted-by":"crossref","unstructured":"Dixit, A.A., Kolaitis, P.G.: A $$\\text{ SAT }$$-based system for consistent query answering. In: SAT, pp. 117\u2013135 (2019)","DOI":"10.1007\/978-3-030-24258-9_8"},{"key":"738_CR34","doi-asserted-by":"crossref","unstructured":"Flesca, S., Furfaro, F., Parisi, F.: Consistent query answers on numerical databases under aggregate constraints. In: DBPL, pp. 279\u2013294 (2005)","DOI":"10.1007\/11601524_18"},{"key":"738_CR35","doi-asserted-by":"publisher","DOI":"10.1145\/1735886.1735893","author":"S Flesca","year":"2010","unstructured":"Flesca, S., Furfaro, F., Parisi, F.: Querying and repairing inconsistent numerical databases. ACM Trans. Database Syst. (2010). https:\/\/doi.org\/10.1145\/1735886.1735893","journal-title":"ACM Trans. Database Syst."},{"key":"738_CR36","doi-asserted-by":"crossref","unstructured":"Franconi, E., Palma, A.L., Leone, N., Perri, S., Scarcello, F.: Census data repair: a challenging application of disjunctive logic programming. In: Logic for Programming, Artificial Intelligence, and Reasoning, pp. 561\u2013578 (2001)","DOI":"10.1007\/3-540-45653-8_39"},{"key":"738_CR37","unstructured":"Gartner.: Vendor Rating Service. https:\/\/www.gartner.com\/en\/research\/methodolo-gies\/vendor-rating. Accessed 15 May 2020"},{"issue":"9","key":"738_CR38","first-page":"625","volume":"6","author":"F Geerts","year":"2013","unstructured":"Geerts, F., Mecca, G., Papotti, P., Santoro, D.: The llunatic data-cleaning framework. PVLDB 6(9), 625\u2013636 (2013)","journal-title":"PVLDB"},{"key":"738_CR39","unstructured":"Golab, L., Ilyas, I.F., Beskales, G., Galiullin, A.: On the relative trust between inconsistent data and inaccurate constraints. In: ICDE, pp. 541\u2013552 (2013)"},{"key":"738_CR40","unstructured":"Guruswami, V., Khot, S.: Hardness of $$\\text{ M }$$ax $$3\\text{ SAT }$$ with no mixed clauses. In: CCC, pp. 154\u2013162 (2005)"},{"issue":"1","key":"738_CR41","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is $$\\text{ MAX } \\text{ SNP }$$-complete. Inf. Process. Lett. 37(1), 27\u201335 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"738_CR42","doi-asserted-by":"publisher","first-page":"41:1","DOI":"10.1145\/1597036.1597045","volume":"5","author":"G Karakostas","year":"2009","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Trans. Algorithms 5(4), 41:1-41:8 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"738_CR43","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the unique games conjecture. In: FOCS, p.\u00a03 (2005)","DOI":"10.1109\/SFCS.2005.61"},{"issue":"3","key":"738_CR44","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-$$\\epsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"738_CR45","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J Kivinen","year":"1995","unstructured":"Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theor. Comput. Sci. 149(1), 129\u2013149 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"738_CR46","doi-asserted-by":"crossref","unstructured":"Kolahi, S., Lakshmanan, L.V.S.: On approximating optimum repairs for functional dependency violations. In: ICDT, pp. 53\u201362 (2009)","DOI":"10.1145\/1514894.1514901"},{"issue":"6","key":"738_CR47","first-page":"397","volume":"6","author":"PG Kolaitis","year":"2013","unstructured":"Kolaitis, P.G., Pema, E., Tan, W.C.: Efficient querying of inconsistent databases with binary integer programming. PVLDB 6(6), 397\u2013408 (2013)","journal-title":"PVLDB"},{"issue":"2","key":"738_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3068334","volume":"42","author":"P Koutris","year":"2017","unstructured":"Koutris, P., Wijsen, J.: Consistent query answering for self-join-free conjunctive queries under primary key constraints. ACM Trans. Database Syst. 42(2), 1\u201345 (2017)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"738_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3360904","volume":"45","author":"E Livshits","year":"2020","unstructured":"Livshits, E., Kimelfeld, B., Roy, S.: Computing optimal repairs for functional dependencies. ACM Trans. Database Syst. 45(1), 1\u201346 (2020)","journal-title":"ACM Trans. Database Syst."},{"key":"738_CR50","doi-asserted-by":"crossref","unstructured":"Lopatenko, A., Bertossi, L.: Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. In: ICDT, pp. 179\u2013193 (2007)","DOI":"10.1007\/11965893_13"},{"issue":"11","key":"738_CR51","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.14778\/3407790.3407809","volume":"13","author":"D Miao","year":"2020","unstructured":"Miao, D., Cai, Z., Li, J., Gao, X., Liu, X.: The computation of optimal subset repairs. Proc. VLDB Endow. 13(11), 2061\u20132074 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"738_CR52","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8(4), 232\u2013248 (1975)","DOI":"10.1007\/BF01580444"},{"issue":"11","key":"738_CR53","first-page":"1190","volume":"10","author":"T Rekatsinas","year":"2017","unstructured":"Rekatsinas, T., Chu, X., Ilyas, I.F., R\u00e9, C.: Holo$$\\text{ C }$$lean: holistic data repairs with probabilistic inference. PVLDB 10(11), 1190\u20131201 (2017)","journal-title":"PVLDB"},{"key":"738_CR54","doi-asserted-by":"crossref","unstructured":"Salimi, B., Rodriguez, L., Howe, B., Suciu, D.: Interventional fairness: causal database repair for algorithmic fairness. In: SIGMOD, pp. 793\u2013810 (2019)","DOI":"10.1145\/3299869.3319901"},{"key":"738_CR55","doi-asserted-by":"crossref","unstructured":"Wijsen, J.: Condensed representation of database repairs for consistent query answering. In: ICDT, pp. 378\u2013393 (2003)","DOI":"10.1007\/3-540-36285-1_25"},{"key":"738_CR56","doi-asserted-by":"crossref","unstructured":"Wijsen, J.: Database repairing using updates. In: SIGMOD, vol.\u00a030 (2005)","DOI":"10.1145\/1093382.1093385"},{"issue":"7","key":"738_CR57","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.is.2009.03.011","volume":"34","author":"J Wijsen","year":"2009","unstructured":"Wijsen, J.: On the consistent rewriting of conjunctive queries under primary key constraints. Inf. Syst. 34(7), 578\u2013601 (2009)","journal-title":"Inf. Syst."},{"issue":"2","key":"738_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2188349.2188351","volume":"37","author":"J Wijsen","year":"2012","unstructured":"Wijsen, J.: Certain conjunctive query answering in first-order logic. ACM Trans. Database Syst. 37(2), 1\u201335 (2012)","journal-title":"ACM Trans. Database Syst."},{"key":"738_CR59","doi-asserted-by":"publisher","unstructured":"Wijsen, J.: User-guided repairing of inconsistent knowledge bases. In: Proceedings of the 21th International Conference on Extending Database Technology (2018). https:\/\/doi.org\/10.5441\/002\/EDBT.2018.13","DOI":"10.5441\/002\/EDBT.2018.13"},{"issue":"3","key":"738_CR60","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3377391.3377393","volume":"48","author":"J Wijsen","year":"2019","unstructured":"Wijsen, J.: Foundations of query answering on inconsistent databases. SIGMOD Rec. 48(3), 6\u201316 (2019)","journal-title":"SIGMOD Rec."},{"issue":"4","key":"738_CR61","doi-asserted-by":"publisher","first-page":"2440","DOI":"10.1137\/16M109017X","volume":"31","author":"M Zehavi","year":"2017","unstructured":"Zehavi, M.: Maximum minimal vertex cover parameterized by vertex cover. SIAM J. Discrete Math. 31(4), 2440\u20132456 (2017)","journal-title":"SIAM J. Discrete Math."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00738-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-022-00738-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00738-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T01:32:51Z","timestamp":1726968771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-022-00738-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,12]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["738"],"URL":"https:\/\/doi.org\/10.1007\/s00778-022-00738-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,12]]},"assertion":[{"value":"3 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}