{"id":"https://openalex.org/W2413634576","doi":"https://doi.org/10.1145/2791291","title":"A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization","display_name":"A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization","publication_year":2016,"publication_date":"2016-06-03","ids":{"openalex":"https://openalex.org/W2413634576","doi":"https://doi.org/10.1145/2791291","mag":"2413634576"},"language":"en","primary_location":{"id":"doi:10.1145/2791291","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2791291","pdf_url":null,"source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/A_competitive_divide-and-conquer_algorithm_for_unconstrained_large-scale_black-box_optimization/27490605","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073282655","display_name":"Yi Mei","orcid":"https://orcid.org/0000-0003-0682-1363"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Yi Mei","raw_affiliation_strings":["RMIT University, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"RMIT University, VIC, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034356207","display_name":"Mohammad Nabi Omidvar","orcid":"https://orcid.org/0000-0003-1944-4624"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mohammad Nabi Omidvar","raw_affiliation_strings":["RMIT University, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"RMIT University, VIC, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100369719","display_name":"Xiaodong Li","orcid":"https://orcid.org/0000-0003-0346-1526"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiaodong Li","raw_affiliation_strings":["RMIT University, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"RMIT University, VIC, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["University of Birmingham, Birmingham, UK"],"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5073282655"],"corresponding_institution_ids":["https://openalex.org/I82951845"],"apc_list":null,"apc_paid":null,"fwci":41.5217,"has_fulltext":false,"cited_by_count":245,"citation_normalized_percentile":{"value":0.9977344,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"42","issue":"2","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.8106678128242493},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6868161559104919},{"id":"https://openalex.org/keywords/black-box","display_name":"Black box","score":0.6463767290115356},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5471391677856445},{"id":"https://openalex.org/keywords/cma-es","display_name":"CMA-ES","score":0.5165663957595825},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47525426745414734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47007375955581665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46931692957878113},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.44352298974990845},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38210204243659973},{"id":"https://openalex.org/keywords/evolution-strategy","display_name":"Evolution strategy","score":0.27046966552734375},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14778000116348267}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.8106678128242493},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6868161559104919},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.6463767290115356},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5471391677856445},{"id":"https://openalex.org/C205555498","wikidata":"https://www.wikidata.org/wiki/Q505588","display_name":"CMA-ES","level":4,"score":0.5165663957595825},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47525426745414734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47007375955581665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46931692957878113},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.44352298974990845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38210204243659973},{"id":"https://openalex.org/C207002847","wikidata":"https://www.wikidata.org/wiki/Q2912857","display_name":"Evolution strategy","level":3,"score":0.27046966552734375},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14778000116348267},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/2791291","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2791291","pdf_url":null,"source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"},{"id":"pmh:oai:alma.61RMIT_INST:11247227930001341","is_oa":false,"landing_page_url":"http://doi.org/10.1145/2791291","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:eprints.whiterose.ac.uk:156230","is_oa":false,"landing_page_url":"http://eprints.whiterose.ac.uk/156230/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:figshare.com:article/27490605","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/A_competitive_divide-and-conquer_algorithm_for_unconstrained_large-scale_black-box_optimization/27490605","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:pure.atira.dk:Publications/c999ab47-fa03-4842-915b-3068ce02fec4","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/c999ab47-fa03-4842-915b-3068ce02fec4","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/c999ab47-fa03-4842-915b-3068ce02fec4","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mei, Y, Omidvar, M N, Li, X & Yao, X 2016, 'A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization', ACM Transactions on Mathematical Software, vol. 42, no. 2, 13. https://doi.org/10.1145/2791291","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/c999ab47-fa03-4842-915b-3068ce02fec4","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.1145/2791291","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/27490605","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/A_competitive_divide-and-conquer_algorithm_for_unconstrained_large-scale_black-box_optimization/27490605","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2841756755","display_name":"Evolutionary Approximation Algorithms for Optimisation: Algorithm Design and Complexity Analysis","funder_award_id":"EP/I010297/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G391238517","display_name":null,"funder_award_id":", and","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3931243179","display_name":null,"funder_award_id":"61329302","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3975464728","display_name":null,"funder_award_id":"EP/K001523/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6794522244","display_name":null,"funder_award_id":"EP/J017515/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8793558268","display_name":"Evolutionary Computation for Dynamic Optimisation in Network Environments","funder_award_id":"EP/K001523/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W120185646","https://openalex.org/W146839677","https://openalex.org/W1540706608","https://openalex.org/W1540764732","https://openalex.org/W1555689267","https://openalex.org/W1567473651","https://openalex.org/W1571424162","https://openalex.org/W1659842140","https://openalex.org/W1918030494","https://openalex.org/W1974164873","https://openalex.org/W1988937492","https://openalex.org/W1996673440","https://openalex.org/W1996936486","https://openalex.org/W1997600725","https://openalex.org/W2002055996","https://openalex.org/W2002113995","https://openalex.org/W2005126631","https://openalex.org/W2009543464","https://openalex.org/W2013497292","https://openalex.org/W2016518303","https://openalex.org/W2019845896","https://openalex.org/W2026258334","https://openalex.org/W2026977976","https://openalex.org/W2030485660","https://openalex.org/W2060833676","https://openalex.org/W2065274576","https://openalex.org/W2066602694","https://openalex.org/W2072925128","https://openalex.org/W2081524587","https://openalex.org/W2100404317","https://openalex.org/W2101677491","https://openalex.org/W2109364787","https://openalex.org/W2117686388","https://openalex.org/W2118840131","https://openalex.org/W2121429049","https://openalex.org/W2131256358","https://openalex.org/W2131872520","https://openalex.org/W2132003714","https://openalex.org/W2138002307","https://openalex.org/W2142978414","https://openalex.org/W2145418868","https://openalex.org/W2152710595","https://openalex.org/W2155005783","https://openalex.org/W2158597998","https://openalex.org/W2160960847","https://openalex.org/W2162320743","https://openalex.org/W2171074980","https://openalex.org/W2208154600","https://openalex.org/W2336687883","https://openalex.org/W2414365832","https://openalex.org/W2597516569","https://openalex.org/W2616627863","https://openalex.org/W3003636913","https://openalex.org/W4252684946","https://openalex.org/W4293857795"],"related_works":["https://openalex.org/W2592891920","https://openalex.org/W2352794675","https://openalex.org/W2072153706","https://openalex.org/W2774408184","https://openalex.org/W4225799919","https://openalex.org/W1987433714","https://openalex.org/W4212806423","https://openalex.org/W1994560683","https://openalex.org/W2022485595","https://openalex.org/W4243402084"],"abstract_inverted_index":{"This":[0],"article":[1],"proposes":[2],"a":[3,49,93,107,158],"competitive":[4,202],"divide-and-conquer":[5],"algorithm":[6,57],"for":[7,13],"solving":[8,63],"large-scale":[9,64,150],"black-box":[10,65,90,163,214],"optimization":[11,86,152],"problems":[12,27,33],"which":[14,156],"there":[15],"are":[16,28,35],"thousands":[17],"of":[18,25,42,51,70,79,87,109,186,190,204],"decision":[19,160,192],"variables":[20,161],"and":[21,83,130,162,194],"the":[22,26,68,71,77,80,85,88,103,110,121,135,148,187,191,197,201,205],"algebraic":[23],"models":[24],"unavailable.":[29],"We":[30],"focus":[31],"on":[32,147,171],"that":[34],"partially":[36],"additively":[37],"separable,":[38],"since":[39],"this":[40,177],"type":[41],"problem":[43],"can":[44],"be":[45],"further":[46],"decomposed":[47],"into":[48],"number":[50],"smaller":[52],"independent":[53,72,104],"subproblems.":[54,91,105],"The":[55,139,166],"proposed":[56,100],"addresses":[58],"two":[59],"important":[60],"issues":[61],"in":[62,176],"optimization:":[66],"(1)":[67],"identification":[69],"subproblems":[73,122],"without":[74],"explicitly":[75],"knowing":[76],"formula":[78],"objective":[81,164],"function":[82],"(2)":[84],"identified":[89],"First,":[92],"Global":[94],"Differential":[95],"Grouping":[96],"(GDG)":[97],"method":[98],"is":[99,117,144,208],"to":[101,119,181,212],"identify":[102],"Then,":[106],"variant":[108],"Covariance":[111],"Matrix":[112],"Adaptation":[113],"Evolution":[114],"Strategy":[115],"(CMA-ES)":[116],"adopted":[118],"solve":[120],"resulting":[123],"from":[124,210],"its":[125],"rotation":[126],"invariance":[127],"property.":[128],"GDG":[129,179],"CMA-ES":[131,207],"work":[132],"together":[133],"under":[134],"cooperative":[136],"co-evolution":[137],"framework.":[138],"resultant":[140],"algorithm,":[141],"named":[142],"CC-GDG-CMAES,":[143],"then":[145],"evaluated":[146,175],"CEC\u20192010":[149],"global":[151],"(LSGO)":[153],"benchmark":[154],"functions,":[155],"have":[157],"thousand":[159],"functions.":[165],"experimental":[167],"results":[168],"show":[169],"that,":[170],"most":[172],"test":[173],"functions":[174],"study,":[178],"manages":[180],"obtain":[182],"an":[183],"ideal":[184],"partition":[185],"index":[188],"set":[189],"variables,":[193],"CC-GDG-CMAES":[195],"outperforms":[196],"state-of-the-art":[198],"results.":[199],"Moreover,":[200],"performance":[203],"well-known":[206],"extended":[209],"low-dimensional":[211],"high-dimensional":[213],"problems.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":21},{"year":2024,"cited_by_count":24},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":39},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":36},{"year":2018,"cited_by_count":25},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":14}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}