{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:59:56Z","timestamp":1740106796141,"version":"3.37.3"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["16-11-00063"],"award-info":[{"award-number":["16-11-00063"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1016\/j.ejc.2018.02.003","type":"journal-article","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T15:08:38Z","timestamp":1519657718000},"page":"43-46","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Protometrics"],"prefix":"10.1016","volume":"80","author":[{"given":"Michel","family":"Deza","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Chebotarev","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2018.02.003_b1","unstructured":"K. Avrachenkov, P. Chebotarev, D. Rubanov, Similarities on graphs: Kernels versus proximity measures, The present volume."},{"key":"10.1016\/j.ejc.2018.02.003_b2","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.laa.2004.11.031","article-title":"Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices","volume":"409","author":"Catral","year":"2005","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.ejc.2018.02.003_b3","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.aam.2010.11.001","article-title":"The graph bottleneck identity","volume":"47","author":"Chebotarev","year":"2011","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.ejc.2018.02.003_b4","first-page":"608","article-title":"On a duality between metrics and \u03a3-proximities","volume":"59","author":"Chebotarev","year":"1998","journal-title":"Autom. Remote Control"},{"key":"10.1016\/j.ejc.2018.02.003_b5","first-page":"1443","article-title":"On proximity measures for graph vertices","volume":"59","author":"Chebotarev","year":"1998","journal-title":"Autom. Remote Control"},{"year":"2016","series-title":"Encyclopedia of Distances","author":"Deza","key":"10.1016\/j.ejc.2018.02.003_b6"},{"year":"2016","series-title":"Algorithms and Models for Network Data and Link Analysis","author":"Fouss","key":"10.1016\/j.ejc.2018.02.003_b7"},{"key":"10.1016\/j.ejc.2018.02.003_b8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1008684018933","article-title":"Approximation of metric spaces by partial metric spaces","volume":"7","author":"Heckmann","year":"1999","journal-title":"Appl. Categ. Struct."},{"year":"2012","series-title":"Group Inverses of M-matrices and Their Applications","author":"Kirkland","key":"10.1016\/j.ejc.2018.02.003_b9"},{"key":"10.1016\/j.ejc.2018.02.003_b10","series-title":"Research Report\u00a0212","article-title":"Partial metric topology","author":"Matthews","year":"1992"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0195669818300167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0195669818300167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T04:02:07Z","timestamp":1712376127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669818300167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":10,"alternative-id":["S0195669818300167"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.ejc.2018.02.003","relation":{},"ISSN":["0195-6698"],"issn-type":[{"type":"print","value":"0195-6698"}],"subject":[],"published":{"date-parts":[[2019,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Protometrics","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.ejc.2018.02.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}