{"id":"https://openalex.org/W2261409732","doi":"https://doi.org/10.1109/tpds.2016.2591011","title":"An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar","display_name":"An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar","publication_year":2016,"publication_date":"2016-07-14","ids":{"openalex":"https://openalex.org/W2261409732","doi":"https://doi.org/10.1109/tpds.2016.2591011","mag":"2261409732"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2016.2591011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2591011","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.manchester.ac.uk/en/publications/ca4767a2-3897-4ddb-a238-cbb19785b97a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alejandro Erickson","orcid":null},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alejandro Erickson","raw_affiliation_strings":["School of Engineering and Computing Sciences, Durham University, South Road, Durham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, South Road, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Abbas E. Kiasari","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Abbas E. Kiasari","raw_affiliation_strings":["School of Computer Science, University of Manchester, Oxford Road, Manchester, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Manchester, Oxford Road, Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Javier Navaridas","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Javier Navaridas","raw_affiliation_strings":["School of Computer Science, University of Manchester, Oxford Road, Manchester, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Manchester, Oxford Road, Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":null,"display_name":"Iain A. Stewart","orcid":"https://orcid.org/0000-0002-0752-1971"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Iain A. Stewart","raw_affiliation_strings":["School of Engineering and Computing Sciences, Durham University, South Road, Durham, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-0752-1971","affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, South Road, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":5.5634,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.95786453,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"28","issue":"3","first_page":"689","last_page":"703"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.4169999957084656,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.4169999957084656,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.35030001401901245,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.06449999660253525,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6912999749183655},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.49050000309944153},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.48840001225471497},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.40779998898506165},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.40540000796318054},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4025000035762787},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.38019999861717224},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.37439998984336853},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3682999908924103},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.3646000027656555}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.807200014591217},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6912999749183655},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.49050000309944153},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.48840001225471497},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.40779998898506165},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.40540000796318054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4041999876499176},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37940001487731934},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.37439998984336853},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3682999908924103},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3646000027656555},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.3578999936580658},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.3529999852180481},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.32120001316070557},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.30239999294281006},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.2865999937057495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28439998626708984},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.26570001244544983},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.26170000433921814},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.26010000705718994},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.258899986743927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25839999318122864},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tpds.2016.2591011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2591011","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ca4767a2-3897-4ddb-a238-cbb19785b97a","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/ca4767a2-3897-4ddb-a238-cbb19785b97a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"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":"Erikson, A, E. Kiasari, A, Navaridas Palma, J & Stewart, I A 2017, 'An optimal single-path routing algorithm in the Datacenter Network DPillar', IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 3, pp. 689 - 703. https://doi.org/10.1109/TPDS.2016.2591011","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:19255","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/19255/","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":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"IEEE transactions on parallel and distributed systems, 2016, Vol.28(3), pp.689-703 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1509.01746","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1509.01746","pdf_url":"https://arxiv.org/pdf/1509.01746","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,"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:durham-repository.worktribe.com:1378035","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1378035","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":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ca4767a2-3897-4ddb-a238-cbb19785b97a","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/ca4767a2-3897-4ddb-a238-cbb19785b97a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"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":"Erikson, A, E. Kiasari, A, Navaridas Palma, J & Stewart, I A 2017, 'An optimal single-path routing algorithm in the Datacenter Network DPillar', IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 3, pp. 689 - 703. https://doi.org/10.1109/TPDS.2016.2591011","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4288640650","display_name":null,"funder_award_id":"EP/K015680/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7459937168","display_name":"Interconnection Networks: Practice unites with Theory (INPUT)","funder_award_id":"EP/K015699/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7598828919","display_name":null,"funder_award_id":"EP/K015699/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8708837515","display_name":"Interconnection Networks: Practice unites with Theory (INPUT)","funder_award_id":"EP/K015680/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1972554021","https://openalex.org/W1976686141","https://openalex.org/W2058135584","https://openalex.org/W2096811399","https://openalex.org/W2096891239","https://openalex.org/W2104852618","https://openalex.org/W2111216043","https://openalex.org/W2117086555","https://openalex.org/W2118426608","https://openalex.org/W2130531694","https://openalex.org/W2139573800","https://openalex.org/W2143065961","https://openalex.org/W2162618057","https://openalex.org/W2169731856","https://openalex.org/W2506910357","https://openalex.org/W3138097900","https://openalex.org/W4232093111","https://openalex.org/W4237515752","https://openalex.org/W4247842874","https://openalex.org/W6606063390"],"related_works":[],"abstract_inverted_index":{"DPillar":[0,28,41,50,65,82,105],"has":[1,72],"recently":[2],"been":[3],"proposed":[4],"as":[5,93],"a":[6,43,60,68,116,126,186],"server-centric":[7],"datacenter":[8,48,181],"network":[9,33,49],"and":[10,29,71,122,164,197],"is":[11,42,51,110,176],"combinatorially":[12],"related":[13],"to":[14,58,85,100,112,140,185],"(but":[15],"distinct":[16],"from)":[17],"the":[18,25,30,37,47,79,86,102,154,160,165],"well-known":[19],"wrapped":[20,31],"butterfly":[21,32],"network.":[22],"We":[23,53],"explain":[24],"relationship":[26],"between":[27],"before":[34],"proving":[35],"that":[36,66,149,177,180,190],"underlying":[38],"graph":[39],"of":[40,81,88,104,119,157,173],"Cayley":[44],"graph;":[45],"hence,":[46],"node-symmetric.":[52],"use":[54],"this":[55,142],"symmetry":[56],"property":[57],"establish":[59],"single-path":[61],"routing":[62,127,151],"algorithm":[63,109,128,152],"for":[64,131],"computes":[67],"shortest":[69],"path":[70],"time":[73],"complexity":[74],"O(k),":[75],"where":[76],"k":[77],"parameterizes":[78],"dimension":[80],"(we":[83],"refer":[84],"number":[87],"ports":[89],"in":[90,138],"its":[91],"switches":[92],"n).":[94],"Our":[95],"analysis":[96],"also":[97],"enables":[98],"us":[99],"calculate":[101],"diameter":[103],"exactly.":[106],"Moreover,":[107],"our":[108,150,174],"trivial":[111],"implement,":[113],"being":[114],"essentially":[115],"conditional":[117],"clause":[118],"numeric":[120],"tests,":[121],"improves":[123,153],"significantly":[124,192],"upon":[125],"earlier":[129],"employed":[130],"DPillar.":[132],"Furthermore,":[133],"we":[134,146],"provide":[135],"empirical":[136],"data":[137],"order":[139],"demonstrate":[141],"improvement.":[143],"In":[144],"particular,":[145],"empirically":[147],"show":[148],"average":[155],"length":[156],"paths":[158],"found,":[159],"aggregate":[161],"bottleneck":[162],"throughput,":[163],"communication":[166],"latency.":[167],"A":[168],"secondary,":[169],"yet":[170],"important,":[171],"effect":[172],"work":[175],"it":[178],"emphasises":[179],"networks":[182],"are":[183],"amenable":[184],"closer":[187],"combinatorial":[188],"scrutiny":[189],"can":[191],"improve":[193],"their":[194],"computational":[195],"efficiency":[196],"performance.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"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":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-09-01T08:31:24.195828","created_date":"2016-06-24T00:00:00"}