{"id":"https://openalex.org/W2146424504","doi":"https://doi.org/10.1007/978-3-662-47666-6_15","title":"Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes","display_name":"Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2146424504","doi":"https://doi.org/10.1007/978-3-662-47666-6_15","mag":"2146424504"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-47666-6_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47666-6_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/ce0eafd5-e6f6-4a2d-bf91-16724bdb2743","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003946901","display_name":"Kousha Etessami","orcid":"https://orcid.org/0000-0001-5700-3462"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kousha Etessami","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh, UK","University of Edinburgh"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106184727","display_name":"Alistair Stewart","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Alistair Stewart","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh, UK","Department of Computer Science University of Southern California, United States"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Department of Computer Science University of Southern California, United States","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["Department of Computer Science, Columbia University, New York, USA","Dept. of Computer Science, Columbia University, United States"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Columbia University, New York, USA","institution_ids":["https://openalex.org/I78577930"]},{"raw_affiliation_string":"Dept. of Computer Science, Columbia University, United States","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003946901"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3638,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66337224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"261","issue":null,"first_page":"184","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9168007969856262},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.7372956275939941},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6349424123764038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.52169269323349},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.501983642578125},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.477060467004776},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4760446548461914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4747921824455261},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.4696853458881378},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43050622940063477},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42122793197631836},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.4140182137489319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36803168058395386},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.32517266273498535},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3166244924068451},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.11773279309272766},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08619830012321472}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9168007969856262},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.7372956275939941},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6349424123764038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.52169269323349},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.501983642578125},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.477060467004776},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4760446548461914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4747921824455261},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.4696853458881378},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43050622940063477},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42122793197631836},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.4140182137489319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36803168058395386},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32517266273498535},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3166244924068451},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.11773279309272766},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08619830012321472},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/978-3-662-47666-6_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47666-6_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.1016/j.ic.2018.02.013","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ic.2018.02.013","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information and Computation","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/ce0eafd5-e6f6-4a2d-bf91-16724bdb2743","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/ce0eafd5-e6f6-4a2d-bf91-16724bdb2743","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Etessami, K, Stewart, A & Yannakakis, M 2018, 'Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes', Information and Computation, vol. 261, no. 2, pp. 355-382. https://doi.org/10.1016/j.ic.2018.02.013","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1502.05533","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1502.05533","pdf_url":"https://arxiv.org/pdf/1502.05533","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2146424504","is_oa":true,"landing_page_url":"https://www.arxiv.org/pdf/1502.05533v5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.ed.ac.uk:openaire/3b38e90a-009b-4015-9ad8-a79fc5eaedcf","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/3b38e90a-009b-4015-9ad8-a79fc5eaedcf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Etessami, K, Stewart, A & Yannakakis, M 2015, Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes? in Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II. https://doi.org/10.1007/978-3-662-47666-6_15","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/3b38e90a-009b-4015-9ad8-a79fc5eaedcf","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/greatest-fixed-points-of-probabilistic-minmax-polynomial-equations-and-reachability-for-branching-markov-decision-processes(3b38e90a-009b-4015-9ad8-a79fc5eaedcf).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Etessami, K, Stewart, A & Yannakakis, M 2015, Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes? in Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II. https://doi.org/10.1007/978-3-662-47666-6_15","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/ce0eafd5-e6f6-4a2d-bf91-16724bdb2743","is_oa":true,"landing_page_url":"https://www.sciencedirect.com/science/article/pii/S0890540118300166?via%3Dihub","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Etessami, K, Stewart, A & Yannakakis, M 2018, 'Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes', Information and Computation, vol. 261, no. 2, pp. 355-382. https://doi.org/10.1016/j.ic.2018.02.013","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.1502.05533","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1502.05533","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/ce0eafd5-e6f6-4a2d-bf91-16724bdb2743","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/ce0eafd5-e6f6-4a2d-bf91-16724bdb2743","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Etessami, K, Stewart, A & Yannakakis, M 2018, 'Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes', Information and Computation, vol. 261, no. 2, pp. 355-382. https://doi.org/10.1016/j.ic.2018.02.013","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1853237457","display_name":null,"funder_award_id":"IE120964","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"},{"id":"https://openalex.org/G2473526366","display_name":null,"funder_award_id":"CCF-1703925","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2496730367","display_name":null,"funder_award_id":"CCF-1320654","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6615897007","display_name":null,"funder_award_id":"EP/L021749/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"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":33,"referenced_works":["https://openalex.org/W1493051096","https://openalex.org/W1493119321","https://openalex.org/W1544822727","https://openalex.org/W1631860265","https://openalex.org/W1820171836","https://openalex.org/W2005059149","https://openalex.org/W2005353519","https://openalex.org/W2028099358","https://openalex.org/W2054454823","https://openalex.org/W2069791914","https://openalex.org/W2087466158","https://openalex.org/W2098435584","https://openalex.org/W2101561362","https://openalex.org/W2123431502","https://openalex.org/W2142972886","https://openalex.org/W2153358971","https://openalex.org/W2153399290","https://openalex.org/W2220995138","https://openalex.org/W2568511220","https://openalex.org/W2610857016","https://openalex.org/W2951306656","https://openalex.org/W2951663572","https://openalex.org/W2952530952","https://openalex.org/W3099666054","https://openalex.org/W4255368532","https://openalex.org/W6629475817","https://openalex.org/W6629530479","https://openalex.org/W6632631899","https://openalex.org/W6636677560","https://openalex.org/W6638476710","https://openalex.org/W6674757772","https://openalex.org/W6681280421","https://openalex.org/W6684673900"],"related_works":["https://openalex.org/W2790209383","https://openalex.org/W2951977842","https://openalex.org/W2395406102","https://openalex.org/W1509309803","https://openalex.org/W2138739352","https://openalex.org/W2952271120","https://openalex.org/W2401114553","https://openalex.org/W2047251073","https://openalex.org/W2966053487","https://openalex.org/W2078167809","https://openalex.org/W2950165203","https://openalex.org/W2569788251","https://openalex.org/W2111697309","https://openalex.org/W1520061120","https://openalex.org/W2065276731","https://openalex.org/W1557755441","https://openalex.org/W2953269844","https://openalex.org/W3128100256","https://openalex.org/W1569080737","https://openalex.org/W3197427365"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}