{"id":"https://openalex.org/W2792837593","doi":"https://doi.org/10.1109/tc.2018.2801300","title":"Checkpointing Workflows for Fail-Stop Errors","display_name":"Checkpointing Workflows for Fail-Stop Errors","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2792837593","doi":"https://doi.org/10.1109/tc.2018.2801300","mag":"2792837593"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2018.2801300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2018.2801300","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101566937","display_name":"Li Han","orcid":"https://orcid.org/0000-0001-5797-2554"},"institutions":[{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]},{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["CN","FR"],"is_corresponding":false,"raw_author_name":"Li Han","raw_affiliation_strings":["East China Normal University, Shanghai, China","East China Normal University [Shanga\u00ef]","Laboratoire de l'Informatique du Parall\u00e9lisme","Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"East China Normal University, Shanghai, China","institution_ids":["https://openalex.org/I66867065"]},{"raw_affiliation_string":"East China Normal University [Shanga\u00ef]","institution_ids":["https://openalex.org/I66867065"]},{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall\u00e9lisme","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040106458","display_name":"Louis-Claude Canon","orcid":"https://orcid.org/0000-0002-5458-0982"},"institutions":[{"id":"https://openalex.org/I177064439","display_name":"Universit\u00e9 de Bourgogne","ror":"https://ror.org/03k1bsr36","country_code":"FR","type":"education","lineage":["https://openalex.org/I177064439"]},{"id":"https://openalex.org/I2802759292","display_name":"Franche-Comt\u00e9 \u00c9lectronique M\u00e9canique Thermique et Optique - Sciences et Technologies","ror":"https://ror.org/004fmxv66","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2802759292","https://openalex.org/I37553959","https://openalex.org/I4210095849","https://openalex.org/I4405256580","https://openalex.org/I53262699"]},{"id":"https://openalex.org/I4210118524","display_name":"Universit\u00e9 Bourgogne Franche-Comt\u00e9","ror":"https://ror.org/02dn7x778","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210118524"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Louis-Claude Canon","raw_affiliation_strings":["FEMTO-ST, Universit\u00e9 de Bourgogne Franche-Comt\u00e9, Besan\u00e7on, France","Franche-Comt\u00e9 \u00c9lectronique M\u00e9canique, Thermique et Optique - Sciences et Technologies (UMR 6174)","Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FEMTO-ST, Universit\u00e9 de Bourgogne Franche-Comt\u00e9, Besan\u00e7on, France","institution_ids":["https://openalex.org/I177064439","https://openalex.org/I2802759292","https://openalex.org/I4210118524"]},{"raw_affiliation_string":"Franche-Comt\u00e9 \u00c9lectronique M\u00e9canique, Thermique et Optique - Sciences et Technologies (UMR 6174)","institution_ids":["https://openalex.org/I2802759292"]},{"raw_affiliation_string":"Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022674890","display_name":"Henri Casanova","orcid":"https://orcid.org/0000-0001-6310-0365"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henri Casanova","raw_affiliation_strings":["University of Hawai'i at Manoa, Honolulu, HI","University of Hawai\u2018i [M\u0101noa]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hawai'i at Manoa, Honolulu, HI","institution_ids":["https://openalex.org/I117965899"]},{"raw_affiliation_string":"University of Hawai\u2018i [M\u0101noa]","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001838181","display_name":"Yves Robert","orcid":"https://orcid.org/0000-0003-2361-055X"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]},{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Yves Robert","raw_affiliation_strings":["LIP, \u00c9cole Normale Sup\u00e9rieure de Lyon, Centre National de la Recherche Scientifique & Inria, Paris, France","Laboratoire de l'Informatique du Parall\u00e9lisme","Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","The University of Tennessee [Knoxville]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP, \u00c9cole Normale Sup\u00e9rieure de Lyon, Centre National de la Recherche Scientifique & Inria, Paris, France","institution_ids":["https://openalex.org/I113428412"]},{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall\u00e9lisme","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","institution_ids":[]},{"raw_affiliation_string":"The University of Tennessee [Knoxville]","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086100728","display_name":"Fr\u00e9d\u00e9ric Vivien","orcid":"https://orcid.org/0000-0002-0663-6152"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Frederic Vivien","raw_affiliation_strings":["LIP, \u00c9cole Normale Sup\u00e9rieure de Lyon, Centre National de la Recherche Scientifique & Inria, Paris, France","Laboratoire de l'Informatique du Parall\u00e9lisme","Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP, \u00c9cole Normale Sup\u00e9rieure de Lyon, Centre National de la Recherche Scientifique & Inria, Paris, France","institution_ids":["https://openalex.org/I113428412"]},{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall\u00e9lisme","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":8,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7146,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.85769345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11986","display_name":"Scientific Computing and Data Management","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8637042045593262},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.6483278274536133},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5681619644165039},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5249112844467163},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5210649371147156},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47327136993408203},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4678894579410553},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45210951566696167},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4383571147918701},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.43495041131973267},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4283641576766968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1994459331035614},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1533982753753662},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12212133407592773},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.11044499278068542}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8637042045593262},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.6483278274536133},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5681619644165039},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5249112844467163},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5210649371147156},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47327136993408203},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4678894579410553},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45210951566696167},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4383571147918701},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.43495041131973267},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4283641576766968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1994459331035614},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1533982753753662},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12212133407592773},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.11044499278068542},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tc.2018.2801300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2018.2801300","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01701611v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01701611","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Computers, 2018, 67 (8), pp.16. ⟨10.1109/TC.2018.2801300⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W153367128","https://openalex.org/W1481521117","https://openalex.org/W1526850230","https://openalex.org/W1570414964","https://openalex.org/W1595409123","https://openalex.org/W1618315709","https://openalex.org/W1898823215","https://openalex.org/W1970725837","https://openalex.org/W1979365494","https://openalex.org/W1987767041","https://openalex.org/W1998076865","https://openalex.org/W1998082182","https://openalex.org/W2009062929","https://openalex.org/W2013434113","https://openalex.org/W2015066317","https://openalex.org/W2026139385","https://openalex.org/W2028351695","https://openalex.org/W2041430193","https://openalex.org/W2045826497","https://openalex.org/W2053659711","https://openalex.org/W2059109315","https://openalex.org/W2072072075","https://openalex.org/W2074626480","https://openalex.org/W2077579791","https://openalex.org/W2077911375","https://openalex.org/W2078962046","https://openalex.org/W2079966248","https://openalex.org/W2083613288","https://openalex.org/W2084078215","https://openalex.org/W2104397737","https://openalex.org/W2104967192","https://openalex.org/W2115826669","https://openalex.org/W2116471852","https://openalex.org/W2118108504","https://openalex.org/W2122967269","https://openalex.org/W2123663722","https://openalex.org/W2126630639","https://openalex.org/W2129666400","https://openalex.org/W2146292749","https://openalex.org/W2148039812","https://openalex.org/W2150231507","https://openalex.org/W2150583433","https://openalex.org/W2153985512","https://openalex.org/W2163282423","https://openalex.org/W2164769892","https://openalex.org/W2167516546","https://openalex.org/W2266293027","https://openalex.org/W2342723672","https://openalex.org/W2466095195","https://openalex.org/W2477392784","https://openalex.org/W2492769945","https://openalex.org/W2522621823","https://openalex.org/W2527466925","https://openalex.org/W2617971758","https://openalex.org/W2725418265","https://openalex.org/W2795107554","https://openalex.org/W2899702797","https://openalex.org/W4235913454","https://openalex.org/W4252427272","https://openalex.org/W6631414937"],"related_works":["https://openalex.org/W2731094954","https://openalex.org/W1981780420","https://openalex.org/W2789273959","https://openalex.org/W2182707996","https://openalex.org/W4302345037","https://openalex.org/W45233828","https://openalex.org/W2964988449","https://openalex.org/W1998712144","https://openalex.org/W2952978498","https://openalex.org/W2397952901"],"abstract_inverted_index":{"We":[0,133],"consider":[1,82],"the":[2,6,48,52,72,113,135,173,182],"problem":[3,42],"of":[4,8,44,47,56,59,74,86,103,137,177,186],"orchestrating":[5],"execution":[7,34],"workflow":[9,49,98,142],"applications":[10],"structured":[11],"as":[12,69],"Directed":[13],"Acyclic":[14],"Graphs":[15,90],"(DAGs)":[16],"on":[17,51],"parallel":[18],"computing":[19],"platforms":[20],"that":[21,111,168],"are":[22],"subject":[23],"to":[24,30,40,63,65,70,95,116,119,126,129,146,189],"fail-stop":[25],"failures.":[26,76,190],"The":[27],"objective":[28],"is":[29,93,154,164],"minimize":[31],"expected":[32],"overall":[33],"time,":[35],"or":[36],"makespan.":[37],"A":[38],"solution":[39],"this":[41,79,101],"consists":[43],"a":[45,57,83,107],"schedule":[46],"tasks":[50],"available":[53],"processors":[54],"and":[55,122,156,181],"decision":[58],"which":[60,92,150,160],"application":[61,152,162],"data":[62,153,163],"checkpoint":[64,130],"stable":[66],"storage,":[67],"so":[68],"mitigate":[71],"impact":[73],"processor":[75],"To":[77],"address":[78],"challenge,":[80],"we":[81,105],"restricted":[84],"class":[85,102],"graphs,":[87,104],"Minimal":[88],"Series-Parallel":[89],"(M-SPGS),":[91],"relevant":[94],"many":[96],"real-world":[97],"applications.":[99],"For":[100],"propose":[106],"recursive":[108],"list-scheduling":[109],"algorithm":[110,139,170],"exploits":[112],"M-SPG":[114],"structure":[115],"assign":[117],"sub-graphs":[118],"individual":[120],"processors,":[121],"uses":[123],"dynamic":[124],"programming":[125],"decide":[127],"how":[128],"these":[131],"sub-graphs.":[132],"assess":[134],"performance":[136],"our":[138,169],"for":[140],"production":[141],"configurations,":[143],"comparing":[144],"it":[145],"an":[147,157],"approach":[148,158],"in":[149,159],"all":[151],"checkpointed":[155],"no":[161],"checkpointed.":[165],"Results":[166],"demonstrate":[167],"outperforms":[171],"both":[172],"former":[174],"approach,":[175,184],"because":[176,185],"lower":[178],"checkpointing":[179],"overhead,":[180],"latter":[183],"better":[187],"resilience":[188]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}