{"id":"https://openalex.org/W2092135477","doi":"https://doi.org/10.1007/s13173-012-0089-z","title":"Parallel transitive closure algorithm","display_name":"Parallel transitive closure algorithm","publication_year":2012,"publication_date":"2012-09-24","ids":{"openalex":"https://openalex.org/W2092135477","doi":"https://doi.org/10.1007/s13173-012-0089-z","mag":"2092135477"},"language":"en","primary_location":{"id":"doi:10.1007/s13173-012-0089-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13173-012-0089-z","pdf_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1007/s13173-012-0089-z","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1007/s13173-012-0089-z","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013849641","display_name":"C. E. R. Alves","orcid":null},"institutions":[{"id":"https://openalex.org/I56001253","display_name":"Universidade S\u00e3o Judas Tadeu","ror":"https://ror.org/00ttbwp87","country_code":"BR","type":"education","lineage":["https://openalex.org/I56001253"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"C. E. R. Alves","raw_affiliation_strings":["Universidade S\u00e3o Judas Tadeu, S\u00e3o Paulo, SP, Brazil","Universidade S\u00e3o Judas Tadeu S\u00e3o Paulo Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade S\u00e3o Judas Tadeu, S\u00e3o Paulo, SP, Brazil","institution_ids":["https://openalex.org/I56001253"]},{"raw_affiliation_string":"Universidade S\u00e3o Judas Tadeu S\u00e3o Paulo Brazil","institution_ids":["https://openalex.org/I56001253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028026699","display_name":"Edson N. C\u00e1ceres","orcid":"https://orcid.org/0000-0001-6471-3462"},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"E. N. C\u00e1ceres","raw_affiliation_strings":["Universidade Federal de Mato Grosso do Sul, Campo Grande, MS, Brazil","Universidade Federal de Mato Grosso do Sul; Campo Grande Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Mato Grosso do Sul, Campo Grande, MS, Brazil","institution_ids":["https://openalex.org/I122558511"]},{"raw_affiliation_string":"Universidade Federal de Mato Grosso do Sul; Campo Grande Brazil","institution_ids":["https://openalex.org/I122558511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102019813","display_name":"Castro J\u00fanior","orcid":"https://orcid.org/0000-0002-0915-6613"},"institutions":[{"id":"https://openalex.org/I122558511","display_name":"Universidade Federal de Mato Grosso do Sul","ror":"https://ror.org/0366d2847","country_code":"BR","type":"education","lineage":["https://openalex.org/I122558511"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"A. A. de Castro","raw_affiliation_strings":["Universidade Federal de Mato Grosso do Sul, Ponta Por\u00e3, MS, Brazil","Universidade Federal de Mato Grosso do Sul, Ponta Por\u00e3, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Mato Grosso do Sul, Ponta Por\u00e3, MS, Brazil","institution_ids":["https://openalex.org/I122558511"]},{"raw_affiliation_string":"Universidade Federal de Mato Grosso do Sul, Ponta Por\u00e3, Brazil","institution_ids":["https://openalex.org/I122558511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101480783","display_name":"S. W. Song","orcid":"https://orcid.org/0009-0002-0381-7772"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]},{"id":"https://openalex.org/I71715416","display_name":"Universidade Federal do ABC","ror":"https://ror.org/028kg9j04","country_code":"BR","type":"education","lineage":["https://openalex.org/I71715416"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"S. W. Song","raw_affiliation_strings":["Universidade Federal do ABC, Santo Andr\u00e9, SP, Brazil","Universidade de S\u00e3o Paulo, S\u00e3o Paulo, SP, Brazil","Universidade Federal do ABC, Santo Andr\u00e9, Brazil","Universidade de S\u00e3o Paulo, S\u00e3o Paulo, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do ABC, Santo Andr\u00e9, SP, Brazil","institution_ids":["https://openalex.org/I71715416"]},{"raw_affiliation_string":"Universidade de S\u00e3o Paulo, S\u00e3o Paulo, SP, Brazil","institution_ids":["https://openalex.org/I17974374"]},{"raw_affiliation_string":"Universidade Federal do ABC, Santo Andr\u00e9, Brazil","institution_ids":["https://openalex.org/I71715416"]},{"raw_affiliation_string":"Universidade de S\u00e3o Paulo, S\u00e3o Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004984970","display_name":"Jayme L. Szwarcfiter","orcid":"https://orcid.org/0000-0002-7538-7305"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"J. L. Szwarcfiter","raw_affiliation_strings":["Uversidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil","Uversidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil"],"affiliations":[{"raw_affiliation_string":"Uversidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil","institution_ids":["https://openalex.org/I122140584"]},{"raw_affiliation_string":"Uversidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5013849641"],"corresponding_institution_ids":["https://openalex.org/I56001253"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14973152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"2","first_page":"161","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.9510552883148193},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8873622417449951},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.7052801847457886},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.6963099241256714},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6385502815246582},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6338510513305664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5977057814598083},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5674240589141846},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5403947830200195},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5188923478126526},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5171244144439697},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5089943408966064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3749529719352722},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3539304733276367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3488680422306061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3456647992134094},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25601303577423096},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.1406090259552002},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.12326574325561523}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9510552883148193},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8873622417449951},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.7052801847457886},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.6963099241256714},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6385502815246582},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6338510513305664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5977057814598083},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5674240589141846},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5403947830200195},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5188923478126526},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5171244144439697},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5089943408966064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3749529719352722},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3539304733276367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3488680422306061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3456647992134094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25601303577423096},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.1406090259552002},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.12326574325561523},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s13173-012-0089-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13173-012-0089-z","pdf_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1007/s13173-012-0089-z","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"},{"id":"pmh:002309882","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s13173-012-0089-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"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":"reponame:Reposit\u00f3rio Institucional da USP (Biblioteca Digital da Produ\u00e7\u00e3o Intelectual)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s13173-012-0089-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13173-012-0089-z","pdf_url":"https://journal-bcs.springeropen.com/counter/pdf/10.1007/s13173-012-0089-z","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3331681876","display_name":null,"funder_award_id":"CAPES","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G5079005330","display_name":null,"funder_award_id":"support","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320323354","display_name":"Funda\u00e7\u00e3o de Apoio ao Desenvolvimento do Ensino, Ci\u00eancia e Tecnologia do Estado de Mato Grosso do Sul","ror":"https://ror.org/05jtrt935"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2092135477.pdf","grobid_xml":"https://content.openalex.org/works/W2092135477.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W28983513","https://openalex.org/W127166643","https://openalex.org/W1504291959","https://openalex.org/W1509342228","https://openalex.org/W1566326249","https://openalex.org/W1566364654","https://openalex.org/W1581008104","https://openalex.org/W1584086289","https://openalex.org/W1604251244","https://openalex.org/W1838152630","https://openalex.org/W1854676400","https://openalex.org/W1977497904","https://openalex.org/W1980153429","https://openalex.org/W2017139167","https://openalex.org/W2023861917","https://openalex.org/W2045271686","https://openalex.org/W2097755092","https://openalex.org/W2102067213","https://openalex.org/W2104734478","https://openalex.org/W2120490947","https://openalex.org/W2132750992","https://openalex.org/W2149899545","https://openalex.org/W2156310459","https://openalex.org/W4254861230"],"related_works":["https://openalex.org/W198808598","https://openalex.org/W2359423766","https://openalex.org/W2021661549","https://openalex.org/W2171308818","https://openalex.org/W3139713485","https://openalex.org/W1578808377","https://openalex.org/W2069149254","https://openalex.org/W2069938443","https://openalex.org/W1997898455","https://openalex.org/W1995587182"],"abstract_inverted_index":{"Abstract":[0],"Using":[1],"the":[2,20,43,58,65,81,107,118,121,169],"BSP/CGM":[3],"model,":[4],"with":[5,27,144],"$$p$$":[6,61],"processors,":[7],"where":[8,78],"$$p":[9],"\\ll":[10],"n$$":[11,197],",":[12],"we":[13],"present":[14],"a":[15,24,52,88,93,111,154,201],"parallel":[16,146],"algorithm":[17,34,59,97,104,119,125,170,188],"to":[18,86,193],"compute":[19,87],"transitive":[21,90,108,123],"closure":[22,91,109,124],"of":[23,83,92,110],"digraph":[25,112,155],"$$D$$":[26,113],"$$n$$":[28],"vertices":[29],"and":[30,138,181],"$$m$$":[31],"edges.":[32],"Our":[33],"uses":[35],"$$\\log":[36,175],"p":[37,176],"+":[38,177],"1$$":[39,178],"communication":[40,62,179],"rounds":[41,63,180],"if":[42],"input":[44],"is":[45,74,80],"an":[46,159],"acyclic":[47],"directed":[48],"graph":[49],"labeled":[50],"using":[51,101,120,130],"linear":[53],"extension.":[54],"For":[55],"general":[56],"digraphs,":[57],"requires":[60,172],"in":[64,164],"worst":[66,149],"case.":[67],"In":[68],"both":[69],"cases,":[70,168],"$$O(M/p)$$":[71],"local":[72],"computation":[73,84],"performed":[75],"per":[76],"round,":[77],"$$M$$":[79],"amount":[82],"needed":[85],"sequential":[89,103],"digraph.":[94],"The":[95,132,148,187],"presented":[96],"can":[98,190],"be":[99,191],"implemented":[100,117],"any":[102,194],"that":[105,199],"computes":[106],".":[114],"We":[115],"have":[116],"Warshall":[122],"on":[126],"two":[127],"Beowulf":[128],"clusters":[129],"MPI.":[131],"implementation":[133,185],"results":[134],"show":[135],"its":[136],"efficiency":[137],"scalability.":[139],"It":[140],"also":[141,189],"compares":[142],"favorably":[143],"other":[145],"implementations.":[147],"case":[150],"(communication":[151],"rounds)":[152],"for":[153],"was":[156],"derived":[157],"through":[158],"artificially":[160],"elaborated":[161],"example.":[162],"However,":[163],"all":[165],"our":[166],"test":[167],"never":[171],"more":[173],"than":[174],"presents":[182],"very":[183],"promising":[184],"results.":[186],"applied":[192],"$$n":[195],"\\times":[196],"matrix":[198],"represents":[200],"binary":[202],"relation.":[203]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}