{"id":"https://openalex.org/W1954157972","doi":"https://doi.org/10.1137/090780328","title":"The Recognition of Tolerance and Bounded Tolerance Graphs","display_name":"The Recognition of Tolerance and Bounded Tolerance Graphs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1954157972","doi":"https://doi.org/10.1137/090780328","mag":"1954157972"},"language":"en","primary_location":{"id":"doi:10.1137/090780328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090780328","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00455774","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018078197","display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":["mertzios@research.haifa.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"mertzios@research.haifa.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025941213","display_name":"Ignasi Sau","orcid":"https://orcid.org/0000-0002-8981-9287"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ignasi Sau","raw_affiliation_strings":["ignasi.sau@lirmm.fr#TAB#"],"affiliations":[{"raw_affiliation_string":"ignasi.sau@lirmm.fr#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009919512","display_name":"Shmuel Zaks","orcid":"https://orcid.org/0000-0001-5637-4923"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shmuel Zaks","raw_affiliation_strings":["zaks@cs.technion.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"zaks@cs.technion.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018078197"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2314,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91430139,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"40","issue":"5","first_page":"1234","last_page":"1257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9815000295639038,"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/combinatorics","display_name":"Combinatorics","score":0.5964838862419128},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5651965737342834},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5482958555221558},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5341929793357849},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5286743640899658},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5235181450843811},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.514717161655426},{"id":"https://openalex.org/keywords/trapezoid-graph","display_name":"Trapezoid graph","score":0.43982866406440735},{"id":"https://openalex.org/keywords/trivially-perfect-graph","display_name":"Trivially perfect graph","score":0.43865180015563965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4371612071990967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4023692011833191},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30726850032806396},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3067736327648163},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2526668608188629}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5964838862419128},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5651965737342834},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5482958555221558},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5341929793357849},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5286743640899658},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5235181450843811},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.514717161655426},{"id":"https://openalex.org/C10325715","wikidata":"https://www.wikidata.org/wiki/Q7835582","display_name":"Trapezoid graph","level":5,"score":0.43982866406440735},{"id":"https://openalex.org/C170903109","wikidata":"https://www.wikidata.org/wiki/Q7844666","display_name":"Trivially perfect graph","level":5,"score":0.43865180015563965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4371612071990967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4023692011833191},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30726850032806396},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3067736327648163},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2526668608188629},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.1137/090780328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090780328","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:9046","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/9046/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM journal on computing, 2011, Vol.40(5), pp.1234-1257 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.4824","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.4824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dur.ac.uk/george.mertzios/papers/Jour/Jour_Tolerance-Recognition.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.393.7168","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.393.7168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/45/57/74/PDF/Mertzios_Tolerance.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.4443","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.4443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2010/2487/pdf/1001.MertziosGeorge.2487.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.3252","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.3252","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dur.ac.uk/george.mertzios/papers/Jour/Jour_Tolerance-Recognition-plain.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00455774v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00455774","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.585-596","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:lirmm-00736512v1","is_oa":false,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-00736512","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2011, 40 (5), pp.1234-1257. &#x27E8;10.1137/090780328&#x27E9;","raw_type":"Journal articles"},{"id":"pmh:oai:durham-repository.worktribe.com:1524704","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1524704","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:publications.rwth-aachen.de:100484","is_oa":true,"landing_page_url":"https://publications.rwth-aachen.de/record/100484","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"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":"27th International Symposium on Theoretical Aspects of Computer Science : STACS 2010 ; proceedings ; March 4-6, 2010, Nancy, France / Jean-Yves Marion and Thomas Schwentick (Eds.)<br/>27. International Symposium on Theoretical Aspects of Computer Science, STACS 2010, Nancy, France, 2010-03-04 - 2010-03-06","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publications.rwth-aachen.de:47814","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-008203%22","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Itahaca, NY : Cornell Univ. 12 S. (2010). doi:10.48550/ARXIV.1001.3251","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00455774v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00455774","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.585-596","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W317410215","https://openalex.org/W639947448","https://openalex.org/W1529235813","https://openalex.org/W1541117821","https://openalex.org/W1570803253","https://openalex.org/W1579049696","https://openalex.org/W1967207440","https://openalex.org/W1972965975","https://openalex.org/W1976997286","https://openalex.org/W1983547967","https://openalex.org/W2006998844","https://openalex.org/W2012200612","https://openalex.org/W2012329067","https://openalex.org/W2054748563","https://openalex.org/W2055043387","https://openalex.org/W2062069600","https://openalex.org/W2084877920","https://openalex.org/W2096993714","https://openalex.org/W2127787106","https://openalex.org/W2130950293","https://openalex.org/W2143474538","https://openalex.org/W2166566648","https://openalex.org/W2169434358","https://openalex.org/W2913426784","https://openalex.org/W2998373259","https://openalex.org/W4213116309","https://openalex.org/W4230110633","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2963089667","https://openalex.org/W1805397736","https://openalex.org/W2966902162","https://openalex.org/W2108370908","https://openalex.org/W2552250629","https://openalex.org/W1598023462","https://openalex.org/W4299834500","https://openalex.org/W2569172273","https://openalex.org/W2949262807","https://openalex.org/W1983547967"],"abstract_inverted_index":{"Tolerance":[0,129],"graphs":[1,26,64,115,121,209,221,237,326],"model":[2],"interval":[3],"relations":[4],"in":[5,20,62,145,184,242,315],"such":[6],"a":[7,13,85,89,192,231,247,273,282,287,312],"way":[8],"that":[9,59,177,276],"intervals":[10],"can":[11,239],"tolerate":[12],"certain":[14],"degree":[15],"of":[16,24,73,77,82,96,100,114,155,207,235,260,264,299,303,318,325],"overlap":[17],"without":[18],"being":[19],"conflict.":[21],"This":[22,297],"subclass":[23,99],"perfect":[25,208],"has":[27],"been":[28,66,105],"extensively":[29],"studied,":[30],"due":[31],"to":[32,224,280],"both":[33,178],"its":[34,38],"interesting":[35],"structure":[36,250],"and":[37,48,125,150,164,245,266,330],"numerous":[39],"applications":[40],"(in":[41],"bioinformatics,":[42],"constraint-based":[43],"temporal":[44],"reasoning,":[45],"resource":[46],"allocation,":[47],"scheduling":[49],"problems,":[50],"among":[51],"others).":[52],"Several":[53],"efficient":[54,319],"algorithms":[55,213,321],"for":[56,68,322],"optimization":[57],"problems":[58,110,180],"are":[60,181,198,230],"NP-hard":[61],"general":[63],"have":[65,104],"designed":[67],"tolerance":[69,78,90,102,120,220],"graphs.":[70,268],"In":[71,172],"spite":[72],"this,":[74],"the":[75,80,94,106,117,156,185,188,202,216,258,316],"recognition":[76,95,179,212,320],"graphs\u2014namely,":[79],"problem":[81],"deciding":[83],"whether":[84],"given":[86,283],"graph":[87,190,285],"is":[88,191,272,302],"graph\u2014as":[91],"well":[92],"as":[93,228],"their":[97,143],"main":[98,270],"bounded":[101,219],"graphs,":[103],"most":[107,205],"fundamental":[108],"open":[109],"on":[111,119,160,201,215],"this":[112,173,292],"class":[113],"(cf.":[116],"book":[118],"[M.":[122,147],"C.":[123,148,151],"Golumbic":[124,149],"A.":[126],"N.":[127],"Trenk,":[128],"Graphs,":[130],"Cambridge":[131,136],"Stud.":[132],"Adv.":[133],"Math.":[134],"89,":[135],"University":[137],"Press,":[138],"Cambridge,":[139],"UK,":[140],"2004])":[141],"since":[142],"introduction":[144],"1982":[146],"L.":[152],"Monma,":[153],"Proceedings":[154],"13th":[157],"Southeastern":[158],"Conference":[159],"Combinatorics,":[161],"Graph":[162],"Theory":[163],"Computing,":[165],"Congr.":[166],"Numer.,":[167],"35":[168],"(1982),":[169],"pp.":[170,339],"321\u2013331].":[171],"article":[174],"we":[175,256],"prove":[176],"NP-complete,":[182],"even":[183],"case":[186,234],"where":[187],"input":[189],"trapezoid":[193,236,267,284],"graph.":[194],"The":[195],"presented":[196],"results":[197],"surprising":[199],"because,":[200],"one":[203],"hand,":[204,218],"subclasses":[206],"admit":[210],"polynomial":[211,243],"and,":[214],"other":[217,323],"were":[222],"believed":[223],"be":[225,240],"efficiently":[226],"recognizable":[227],"they":[229],"natural":[232],"special":[233],"(which":[238],"recognized":[241],"time)":[244],"share":[246],"very":[248,306],"similar":[249],"with":[251],"them.":[252],"For":[253],"our":[254],"reduction":[255],"extend":[257],"notion":[259],"an":[261],"acyclic":[262,294],"orientation":[263,295],"permutation":[265,288],"Our":[269],"tool":[271,314],"new":[274,293],"algorithm":[275],"uses":[277],"vertex":[278,300],"splitting":[279,301],"transform":[281],"into":[286],"graph,":[289],"while":[290],"preserving":[291],"property.":[296],"method":[298],"independent":[304],"interest;":[305],"recently,":[307],"it":[308],"was":[309],"also":[310],"proved":[311],"powerful":[313],"design":[317],"classes":[324],"[G.":[327],"B.":[328],"Mertzios":[329],"D.":[331],"G.":[332],"Corneil,":[333],"Discrete":[334],"Appl.":[335],"Math.,":[336],"159":[337],"(2011),":[338],"1131\u20131147].":[340]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}