{"id":"https://openalex.org/W1948437592","doi":"https://doi.org/10.2168/lmcs-11(3:17)2015","title":"On the Axiomatizability of Impossible Futures","display_name":"On the Axiomatizability of Impossible Futures","publication_year":2015,"publication_date":"2015-09-22","ids":{"openalex":"https://openalex.org/W1948437592","doi":"https://doi.org/10.2168/lmcs-11(3:17)2015","mag":"1948437592"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-11(3:17)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(3:17)2015","pdf_url":"https://lmcs.episciences.org/1593/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1593/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030747944","display_name":"Taolue Chen","orcid":"https://orcid.org/0000-0002-5993-1665"},"institutions":[{"id":"https://openalex.org/I60488453","display_name":"Middlesex University","ror":"https://ror.org/01rv4p989","country_code":"GB","type":"education","lineage":["https://openalex.org/I60488453"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Taolue Chen","raw_affiliation_strings":["Middlesex University London, Department of Computer Science, The Burroughs, London NW4 4BT, United Kingdom",", Middlesex University"],"affiliations":[{"raw_affiliation_string":"Middlesex University London, Department of Computer Science, The Burroughs, London NW4 4BT, United Kingdom","institution_ids":["https://openalex.org/I60488453"]},{"raw_affiliation_string":", Middlesex University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078610814","display_name":"Wan Fokkink","orcid":"https://orcid.org/0000-0001-7443-8978"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wan Fokkink","raw_affiliation_strings":["VU University Amsterdam, Department of Computer Science, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands","Theoretical Computer Science"],"affiliations":[{"raw_affiliation_string":"VU University Amsterdam, Department of Computer Science, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]},{"raw_affiliation_string":"Theoretical Computer Science","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048229897","display_name":"Rob van Glabbeek","orcid":"https://orcid.org/0000-0003-4712-7423"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Rob van Glabbeek","raw_affiliation_strings":["NICTA, Locked Bag 6016, Sydney, NSW 1466, Australia, and","The University of New South Wales, School of Computer Science and Engineering, Sydney, NSW 2052, Australia","University Of New south Wales"],"affiliations":[{"raw_affiliation_string":"NICTA, Locked Bag 6016, Sydney, NSW 1466, Australia, and","institution_ids":["https://openalex.org/I42894916"]},{"raw_affiliation_string":"The University of New South Wales, School of Computer Science and Engineering, Sydney, NSW 2052, Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"University Of New south Wales","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030747944"],"corresponding_institution_ids":["https://openalex.org/I60488453"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.05619352,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 11, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9959999918937683,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9951000213623047,"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/modulo","display_name":"Modulo","score":0.6680248975753784},{"id":"https://openalex.org/keywords/futures-contract","display_name":"Futures contract","score":0.5592507719993591},{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.5362510085105896},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5249402523040771},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5085452795028687},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.501488208770752},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.43760567903518677},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.42315584421157837},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39004647731781006},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3561350107192993},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.277504563331604},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.09864789247512817}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6680248975753784},{"id":"https://openalex.org/C106306483","wikidata":"https://www.wikidata.org/wiki/Q183984","display_name":"Futures contract","level":2,"score":0.5592507719993591},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.5362510085105896},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5249402523040771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5085452795028687},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.501488208770752},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.43760567903518677},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.42315584421157837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39004647731781006},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3561350107192993},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.277504563331604},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.09864789247512817},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","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}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.2168/lmcs-11(3:17)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(3:17)2015","pdf_url":"https://lmcs.episciences.org/1593/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/bc97c867-8475-4452-8dca-016509312b4c","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/bc97c867-8475-4452-8dca-016509312b4c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Chen, T, Fokkink, W J & van Glabbeek, R J 2015, 'On the axiomatizability of impossible futures', Logical Methods in Computer Science, vol. 11, no. 3. https://doi.org/10.2168/LMCS-11(3:17)2015","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:eprints.mdx.ac.uk:16755","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400025","display_name":"Middlesex University Research Repository (Middlesex University Of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I60488453","host_organization_name":"Middlesex University","host_organization_lineage":["https://openalex.org/I60488453"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1505.04985","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1505.04985","pdf_url":"https://arxiv.org/pdf/1505.04985","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":"pmh:877550","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=877550","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1860-5974","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:doaj.org/article:2c1f5505c13a447dadb0af4bc5cd3bd7","is_oa":true,"landing_page_url":"https://doaj.org/article/2c1f5505c13a447dadb0af4bc5cd3bd7","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 11, Issue 3 (2015)","raw_type":"article"},{"id":"pmh:oai:eprints.bbk.ac.uk.oai2:19658","is_oa":false,"landing_page_url":"https://eprints.bbk.ac.uk/id/eprint/19658/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400466","display_name":"BIROn (Birkbeck, University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98259816","host_organization_name":"Birkbeck, University of London","host_organization_lineage":["https://openalex.org/I98259816"],"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:library.tue.nl:871656","is_oa":false,"landing_page_url":"http://repository.tue.nl/871656","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1860-5974","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:877550","is_oa":false,"landing_page_url":"http://repository.tue.nl/877550","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1860-5974","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:research.vu.nl:publications/bc97c867-8475-4452-8dca-016509312b4c","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/bc97c867-8475-4452-8dca-016509312b4c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Chen, T, Fokkink, W J & van Glabbeek, R J 2015, 'On the axiomatizability of impossible futures', Logical Methods in Computer Science, vol. 11, no. 3. https://doi.org/10.2168/LMCS-11(3:17)2015","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.2168/lmcs-11(3:17)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(3:17)2015","pdf_url":"https://lmcs.episciences.org/1593/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G6194240451","display_name":"National ICT Australia","funder_award_id":"NICTA","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320315885","display_name":"Australian Government","ror":"https://ror.org/0314h5y94"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1948437592.pdf","grobid_xml":"https://content.openalex.org/works/W1948437592.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1501160109","https://openalex.org/W1530777383","https://openalex.org/W1531503887","https://openalex.org/W1553245026","https://openalex.org/W1567813390","https://openalex.org/W1594574791","https://openalex.org/W1604453972","https://openalex.org/W1868341999","https://openalex.org/W1967381334","https://openalex.org/W2022258624","https://openalex.org/W2038305454","https://openalex.org/W2102097307","https://openalex.org/W2107733072","https://openalex.org/W2110287808","https://openalex.org/W2118044617","https://openalex.org/W2133267148","https://openalex.org/W2147877669","https://openalex.org/W2148973802","https://openalex.org/W2157144873","https://openalex.org/W2158342623","https://openalex.org/W2161401924","https://openalex.org/W2171648882","https://openalex.org/W2205337852","https://openalex.org/W2913931721","https://openalex.org/W3000511677","https://openalex.org/W4243727649","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2059384236","https://openalex.org/W2793104284","https://openalex.org/W1495199168","https://openalex.org/W2008052156","https://openalex.org/W2113177679","https://openalex.org/W1993063311","https://openalex.org/W4292607487","https://openalex.org/W1480685647","https://openalex.org/W1591616977","https://openalex.org/W2024848178"],"abstract_inverted_index":{"A":[0],"general":[1],"method":[2],"is":[3,36,110,117,132],"established":[4],"to":[5,38,126],"derive":[6],"a":[7,11,68,81,152],"ground-complete":[8,71,84,122],"axiomatization":[9,17,72,85,100],"for":[10,18,57,73,86,101],"weak":[12,58,88,106,146],"semantics":[13,39],"from":[14],"such":[15,151],"an":[16,49],"its":[19],"concrete":[20,75,104,144],"counterpart,":[21],"in":[22],"the":[23,26,74,87,113,120,130,137,143],"context":[24],"of":[25,115,140],"process":[27],"algebra":[28],"BCCS.":[29],"This":[30],"transformation":[31],"moreover":[32],"preserves":[33],"omega-completeness.":[34],"It":[35],"applicable":[37],"at":[40],"least":[41],"as":[42,44],"coarse":[43],"impossible":[45,76,89,107,147],"futures":[46,77,90,108,148],"semantics.":[47,64],"As":[48],"application,":[50],"ground-":[51],"and":[52,62,105,145],"omega-complete":[53],"axiomatizations":[54,123],"are":[55,124],"derived":[56],"failures,":[59],"completed":[60],"trace":[61,63],"We":[65],"then":[66,119],"present":[67],"finite,":[69,82,98,133],"sound,":[70,83],"preorder,":[78],"which":[79],"implies":[80],"preorder.":[91],"In":[92],"contrast,":[93],"we":[94,134],"prove":[95,135],"that":[96,136],"no":[97],"sound":[99],"BCCS":[102,141],"modulo":[103,142],"equivalence":[109],"ground-complete.":[111],"If":[112,129],"alphabet":[114,131],"actions":[116],"infinite,":[118],"aforementioned":[121],"shown":[125],"be":[127],"omega-complete.":[128],"inequational":[138],"theories":[139],"preorder":[149],"lack":[150],"finite":[153],"basis.":[154]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}