{"id":"https://openalex.org/W2963582525","doi":"https://doi.org/10.1145/3084465","title":"A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints","display_name":"A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints","alternate_titles":[],"publication_year":2017,"publication_date":"2017-06-13","ids":{"openalex":"https://openalex.org/W2963582525","doi":"https://doi.org/10.1145/3084465","mag":"2963582525"},"language":"en","primary_location":{"id":"doi:10.1145/3084465","doi":"https://doi.org/10.1145/3084465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3084465","pdf_url":null,"source":{"id":"https://openalex.org/S4210193547","display_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","issn_l":"2476-1249","issn":["2476-1249"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","norway-1","poland-20","russia-white-list-4"],"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":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2963582525"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ris.utwente.nl/ws/files/266667230/Avrachenkov2017low.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053557735","display_name":"Konstantin E. Avrachenkov","orcid":"https://orcid.org/0000-0002-8124-8272","observed_orcids":["https://orcid.org/0000-0002-8124-8272"]},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I4210106545","display_name":"Centre Inria d'Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/01nzkaw91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210106545"]},{"id":"https://openalex.org/I4405258201","display_name":"NEO: Ing\u00e9nierie et Op\u00e9rations des R\u00e9seaux","ror":"https://ror.org/009bc7242","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210106545","https://openalex.org/I4405258201"]}],"countries":["FR"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Konstantin Avrachenkov","raw_affiliation_strings":["INRIA Sophia Antipolis, Valbonne, France","NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Sophia Antipolis, Valbonne, France","institution_ids":["https://openalex.org/I4210106545"]},{"raw_affiliation_string":"NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I4405258201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089628451","display_name":"Jasper Goseling","orcid":"https://orcid.org/0000-0001-5820-7301","observed_orcids":["https://orcid.org/0000-0001-5820-7301"]},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jasper Goseling","raw_affiliation_strings":["University of Twente, Enschede, Netherlands","SOR - Stochastic Operations Research [Twente] (Drienerlolaan 5\r\n7522 NB Enschede - Pays-Bas)","University of Twente (Drienerlolaan 5, 7522 NB Enschede - Pays-Bas)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"SOR - Stochastic Operations Research [Twente] (Drienerlolaan 5\r\n7522 NB Enschede - Pays-Bas)","institution_ids":[]},{"raw_affiliation_string":"University of Twente (Drienerlolaan 5, 7522 NB Enschede - Pays-Bas)","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059550881","display_name":"Berksan Serbetci","orcid":"https://orcid.org/0000-0002-4730-3119","observed_orcids":["https://orcid.org/0000-0002-4730-3119"]},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Berksan Serbetci","raw_affiliation_strings":["University of Twente, Enschede, Netherlands","SOR - Stochastic Operations Research [Twente] (Drienerlolaan 5\r\n7522 NB Enschede - Pays-Bas)","University of Twente (Drienerlolaan 5, 7522 NB Enschede - Pays-Bas)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"SOR - Stochastic Operations Research [Twente] (Drienerlolaan 5\r\n7522 NB Enschede - Pays-Bas)","institution_ids":[]},{"raw_affiliation_string":"University of Twente (Drienerlolaan 5, 7522 NB Enschede - Pays-Bas)","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1875,"has_fulltext":true,"cited_by_count":21,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.89440906,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"25"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","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/T11478","display_name":"Caching and Content Delivery","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/T13553","display_name":"Age of Information Optimization","score":0.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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/cellular-networks","display_name":"cellular networks","score":0.7839999794960022},{"id":"https://openalex.org/keywords/base-station-caching","display_name":"base station caching","score":0.8159999847412109},{"id":"https://openalex.org/keywords/content-placement","display_name":"content placement","score":0.6460000276565552},{"id":"https://openalex.org/keywords/potential-games","display_name":"potential games","score":0.6949999928474426},{"id":"https://openalex.org/keywords/best-response-dynamics","display_name":"best response dynamics","score":0.996999979019165},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.8930000066757202},{"id":"https://openalex.org/keywords/asynchronous-distributed-algorithms","display_name":"asynchronous distributed algorithms","score":0.8619999885559082},{"id":"https://openalex.org/keywords/geographic-constraints","display_name":"geographic constraints","score":0.5239999890327454},{"id":"https://openalex.org/keywords/hitting-probabilities","display_name":"hit probability","score":0.7429999709129333},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9309999942779541},{"id":"https://openalex.org/keywords/low-complexity-algorithms","display_name":"low-complexity algorithms","score":0.8090000152587891},{"id":"https://openalex.org/keywords/file-popularity","display_name":"file popularity","score":0.5289999842643738}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8262406587600708},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.800247073173523},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5870174765586853},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4965088963508606},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45014268159866333},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.41287755966186523},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3726198077201843},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35729551315307617},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3505523204803467},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3284474015235901},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28889814019203186},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14552649855613708}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3084465","doi":"https://doi.org/10.1145/3084465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3084465","pdf_url":null,"source":{"id":"https://openalex.org/S4210193547","display_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","issn_l":"2476-1249","issn":["2476-1249"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","norway-1","poland-20","russia-white-list-4"],"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":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/83194af7-07b8-4322-82f0-16e9b649db28","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/83194af7-07b8-4322-82f0-16e9b649db28","pdf_url":"https://ris.utwente.nl/ws/files/266667230/Avrachenkov2017low.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Avrachenkov, K, Goseling, J & Serbetci, B 2017, 'A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints', Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 1, no. 1. https://doi.org/10.1145/3084465","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:1704.04465","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.04465","pdf_url":"https://arxiv.org/pdf/1704.04465","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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:oai:HAL:hal-01648129v1","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01648129","pdf_url":"https://inria.hal.science/hal-01648129/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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":"Proceedings of the ACM on Measurement and Analysis of Computing Systems , 2017, 1, pp.27:1 - 27:24. &#x27E8;10.1145/3084465&#x27E9;","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/83194af7-07b8-4322-82f0-16e9b649db28","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/83194af7-07b8-4322-82f0-16e9b649db28","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1(1). Association for Computing Machinery (ACM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/83194af7-07b8-4322-82f0-16e9b649db28","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/83194af7-07b8-4322-82f0-16e9b649db28","pdf_url":"https://ris.utwente.nl/ws/files/266667230/Avrachenkov2017low.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Avrachenkov, K, Goseling, J & Serbetci, B 2017, 'A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints', Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 1, no. 1. https://doi.org/10.1145/3084465","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963582525.pdf","grobid_xml":"https://content.openalex.org/works/W2963582525.grobid-xml"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W1481341908","https://openalex.org/W1549860141","https://openalex.org/W1564544031","https://openalex.org/W1589059132","https://openalex.org/W1632601927","https://openalex.org/W1777099960","https://openalex.org/W1969379975","https://openalex.org/W1969672323","https://openalex.org/W1972738071","https://openalex.org/W1974066983","https://openalex.org/W1980005054","https://openalex.org/W1985573567","https://openalex.org/W1988834815","https://openalex.org/W2005228957","https://openalex.org/W2016869578","https://openalex.org/W2018682510","https://openalex.org/W2031237501","https://openalex.org/W2034464694","https://openalex.org/W2039090559","https://openalex.org/W2042883126","https://openalex.org/W2045828497","https://openalex.org/W2047251584","https://openalex.org/W2053923031","https://openalex.org/W2059234320","https://openalex.org/W2060585552","https://openalex.org/W2068309140","https://openalex.org/W2083766832","https://openalex.org/W2095094403","https://openalex.org/W2096220631","https://openalex.org/W2106248279","https://openalex.org/W2130356538","https://openalex.org/W2147025064","https://openalex.org/W2150495639","https://openalex.org/W2156588926","https://openalex.org/W2161877964","https://openalex.org/W2164237594","https://openalex.org/W2262385276","https://openalex.org/W2270262144","https://openalex.org/W2279407724","https://openalex.org/W2497061186","https://openalex.org/W2530910544","https://openalex.org/W2563036668","https://openalex.org/W2591528568","https://openalex.org/W2601341989","https://openalex.org/W2607830440","https://openalex.org/W2796221598","https://openalex.org/W2946043566","https://openalex.org/W2949864303","https://openalex.org/W2950627632","https://openalex.org/W2963700127","https://openalex.org/W2964064839","https://openalex.org/W3004623663","https://openalex.org/W3022321359","https://openalex.org/W3028821732","https://openalex.org/W3185164426","https://openalex.org/W4212994320","https://openalex.org/W4230387433","https://openalex.org/W4299352187"],"related_works":["https://openalex.org/W2765317060","https://openalex.org/W4290035493","https://openalex.org/W2795786677","https://openalex.org/W2270262144","https://openalex.org/W2964167101","https://openalex.org/W2530910544","https://openalex.org/W2573979443","https://openalex.org/W2971014395","https://openalex.org/W4297872974","https://openalex.org/W4387869550"],"abstract_inverted_index":{"We":[0,70,133,221],"consider":[1],"caching":[2,259,276],"in":[3,6,38,52,62,81,99,151,157,184,197,203],"cellular":[4],"networks":[5,252],"which":[7,77,82,236],"each":[8,139],"base":[9,162],"station":[10],"is":[11,29,34,68,107,126,143,182],"equipped":[12],"with":[13,92],"a":[14,19,46,120,166,178,199],"cache":[15,153,180],"that":[16,42,45,59,113,135,164,172,256],"can":[17,97,116],"store":[18,80],"limited":[20],"number":[21,147,160],"of":[22,26,64,104,138,145,148,161,206,225],"files.":[23],"The":[24,102],"popularity":[25],"the":[27,32,39,43,53,57,65,105,114,129,136,146,152,158,173,194,208,212,218,238,244,266],"files":[28,37],"known":[30],"and":[31,96,155,188,232,250,254,274],"goal":[33],"to":[35,79,217],"place":[36],"caches":[40,67,91],"such":[41],"probability":[44,246],"user":[47],"at":[48],"an":[49,111],"arbitrary":[50],"location":[51],"plane":[54],"will":[55],"find":[56,237],"file":[58],"she":[60],"requires":[61],"one":[63],"covering":[66],"maximized.":[69],"develop":[71],"distributed":[72,258],"asynchronous":[73,100],"algorithms":[74,86,106],"for":[75,177],"deciding":[76],"contents":[78],"cache.":[83],"Such":[84],"cooperative":[85],"require":[87],"communication":[88],"only":[89],"between":[90],"overlapping":[93],"coverage":[94],"areas":[95],"operate":[98],"manner.":[101],"development":[103],"principally":[108],"based":[109,229],"on":[110,230,248],"observation":[112],"problem":[115],"be":[117],"viewed":[118],"as":[119],"potential":[121],"game.":[122],"Our":[123],"basic":[124,209,227],"algorithm":[125,175,195,210,228,260],"derived":[127],"from":[128],"best":[130,140,213],"response":[131,141],"dynamics.":[132],"demonstrate":[134,243],"complexity":[137,176],"step":[142],"independent":[144],"files,":[149],"linear":[150,156],"capacity":[154],"maximum":[159],"stations":[163],"cover":[165],"certain":[167],"area.":[168],"Then,":[169],"we":[170,242],"show":[171,255],"overall":[174],"discrete":[179],"placement":[181,272],"polynomial":[183],"both":[185],"network":[186],"size":[187],"catalog":[189],"size.":[190],"In":[191],"practical":[192],"examples,":[193],"converges":[196],"just":[198],"few":[200],"iterations.":[201],"Also,":[202],"most":[204,267],"cases":[205],"interest,":[207],"finds":[211],"Nash":[214],"equilibrium":[215],"corresponding":[216],"global":[219,239],"optimum.":[220,240],"provide":[222],"two":[223],"extensions":[224],"our":[226,257],"stochastic":[231],"deterministic":[233],"simulated":[234],"annealing":[235],"Finally,":[241],"hit":[245],"evolution":[247],"real":[249],"synthetic":[251],"numerically":[253],"performs":[261],"significantly":[262],"better":[263],"than":[264],"storing":[265],"popular":[268],"content,":[269],"probabilistic":[270],"content":[271],"policy":[273],"Multi-LRU":[275],"policies.":[277]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2963582525","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2019-07-30T00:00:00"}
