{"id":"https://openalex.org/W3160943031","doi":"https://doi.org/10.1145/3301314","title":"The ( <i>h,k</i> )-Server Problem on Bounded Depth Trees","display_name":"The ( <i>h,k</i> )-Server Problem on Bounded Depth Trees","publication_year":2019,"publication_date":"2019-02-06","ids":{"openalex":"https://openalex.org/W3160943031","doi":"https://doi.org/10.1145/3301314","mag":"3160943031"},"language":"en","primary_location":{"id":"doi:10.1145/3301314","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3301314","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/29304","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["CWI and TU Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI and TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109500624","display_name":"Marek Eli\u00e9\u0161","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Marek Eli\u00e9\u0161","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007826587","display_name":"\u0141ukasz Je\u017c","orcid":"https://orcid.org/0000-0002-7375-0641"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"\u0141ukasz Je\u017c","raw_affiliation_strings":["University of Wroc\u0142aw, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003164174","display_name":"Grigorios Koumoutsos","orcid":"https://orcid.org/0000-0002-4928-103X"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Grigorios Koumoutsos","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":null,"apc_paid":null,"fwci":0.3714,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68154893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T11182","display_name":"Auction Theory and Applications","score":0.9818999767303467,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9740999937057495,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8581063747406006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7154436111450195},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6597865223884583},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6438204050064087},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6107047200202942},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6098126173019409},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5448725819587708},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.5372419953346252},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5294389724731445},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5080042481422424},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4818059802055359},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42685768008232117},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3101370930671692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19263574481010437},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0860888659954071}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8581063747406006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7154436111450195},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6597865223884583},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6438204050064087},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6107047200202942},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6098126173019409},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5448725819587708},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.5372419953346252},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5294389724731445},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5080042481422424},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4818059802055359},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42685768008232117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3101370930671692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19263574481010437},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0860888659954071},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/3301314","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3301314","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/9d96b694-fc99-4026-ad42-2204f88ded3e","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/9d96b694-fc99-4026-ad42-2204f88ded3e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Eli\u00e1\u0161, M, Je\u017c, \u0141 & Koumoutsos, G 2019, 'The (H, k)-server problem on bounded depth trees', ACM Transactions on Algorithms, vol. 15, no. 2, 28. https://doi.org/10.1145/3301314","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:29304","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/29304","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"ACM Transactions on Algorithms, 15(2), 28.1 - 28.26","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/287233","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/287233","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"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":"ACM transactions on algorithms, 15 (2","raw_type":"info:ulb-repo/semantics/openurl/article"},{"id":"pmh:oai:infoscience.epfl.ch:266900","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/266900","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"},{"id":"pmh:oai:pure.tue.nl:publications/9d96b694-fc99-4026-ad42-2204f88ded3e","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85062348462&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"Bansal, N, Eli\u00e1\u0161, M, Je\u017c, \u0141 & Koumoutsos, G 2019, 'The (H, k)-server problem on bounded depth trees', ACM Transactions on Algorithms, vol. 15, no. 2, 28. https://doi.org/10.1145/3301314","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/9d96b694-fc99-4026-ad42-2204f88ded3e","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/9d96b694-fc99-4026-ad42-2204f88ded3e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 15(2):28. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:cwi:oai:cwi.nl:29304","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/29304","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"ACM Transactions on Algorithms, 15(2), 28.1 - 28.26","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4300000071525574,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G1664046972","display_name":null,"funder_award_id":"639.022.211","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G4058268884","display_name":null,"funder_award_id":"2016/22/E/ST6/00499","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6130719263","display_name":null,"funder_award_id":"617951","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1972868674","https://openalex.org/W2002247760","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2069255833","https://openalex.org/W2082099352","https://openalex.org/W2086989193","https://openalex.org/W2089998595","https://openalex.org/W3040305025","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W4301494121","https://openalex.org/W2951569031","https://openalex.org/W3112958049","https://openalex.org/W4288522129","https://openalex.org/W2038993323","https://openalex.org/W3115841861","https://openalex.org/W2950145751","https://openalex.org/W4297780966","https://openalex.org/W2593235372","https://openalex.org/W3186059492"],"abstract_inverted_index":{"We":[0,90],"study":[1],"the":[2,7,13,16,25,47,96,102,117,130,140,242],"k":[3,20,32,49,56,84,104,133,155,171,191,223,246],"-server":[4,50,105],"problem":[5,35],"in":[6],"resource":[8],"augmentation":[9],"setting,":[10],"i.e.,":[11],"when":[12,55,83,154,222],"performance":[14],"of":[15,78,129,132],"online":[17,209],"algorithm":[18,72,120,181,210],"with":[19,29],"servers":[21],"is":[22,36,73,87,145,178,183,226],"compared":[23],"to":[24,147],"offline":[26],"optimal":[27,149],"solution":[28],"h":[30,58,70,86,126,157,164,173,193,225,244],"\u2264":[31],"servers.":[33],"The":[34],"very":[37,112],"poorly":[38],"understood":[39],"beyond":[40],"uniform":[41,236],"metrics.":[42,114],"For":[43],"this":[44],"special":[45],"case,":[46],"classic":[48],"algorithms":[51,106],"are":[52],"roughly":[53],"(1+1/\u03f5)-competitive":[54],"=(1+\u03f5)":[57,192],",":[59,134,158,245],"for":[60,76,95,136,150,186,194,218,241],"any":[61,195,207],"\u03f5":[62,196],"&gt;":[63,197],"0.":[64,198],"Surprisingly,":[65],"however,":[66],"no":[67],"o":[68],"(":[69,125,163,243],")-competitive":[71],"known":[74,103],"even":[75,82,110,135,169,217],"HSTs":[77,168,220,240],"depth":[79,188],"2":[80],"and":[81,221,238],"/":[85,224],"arbitrarily":[88,227],"large.":[89,228],"obtain":[91],"several":[92],"new":[93,180],"results":[94],"problem.":[97,248],"First,":[98],"we":[99,200],"show":[100],"that":[101,182,206],"do":[107],"not":[108],"work":[109],"on":[111,166],"simple":[113],"In":[115],"particular,":[116],"Double":[118],"Coverage":[119],"has":[121,159,211],"competitive":[122,160,212],"ratio":[123,161,213],"\u03a9":[124,162],")":[127,165],"irrespective":[128],"value":[131],"depth-2":[137,219,239],"HSTs.":[138],"Similarly,":[139],"Work":[141],"Function":[142],"Algorithm,":[143],"which":[144],"believed":[146],"be":[148],"all":[151],"metric":[152],"spaces":[153],"=":[156],"depth-3":[167],"if":[170],"=2":[172],".":[174],"Our":[175],"main":[176],"result":[177],"a":[179,202,231],"O":[184],"(1)-competitive":[185],"constant":[187],"trees,":[189],"whenever":[190],"Finally,":[199],"give":[201],"general":[203],"lower":[204],"bound":[205],"deterministic":[208],"at":[214],"least":[215],"2.4":[216],"This":[229],"gives":[230],"surprising":[232],"qualitative":[233],"separation":[234],"between":[235],"metrics":[237],")-server":[247]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2021-05-24T00:00:00"}