{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:59:08Z","timestamp":1720335548931},"reference-count":4,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100010052","name":"Northumbria University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1016\/j.ipl.2020.106008","type":"journal-article","created":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T21:12:30Z","timestamp":1595279550000},"page":"106008","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Longest distance of a non-uniform dispersion process on the infinite line"],"prefix":"10.1016","volume":"164","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2817-3400","authenticated-orcid":false,"given":"Yilun","family":"Shang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2020.106008_br0010","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1002\/rsa.20822","article-title":"Dispersion processes","volume":"53","author":"Cooper","year":"2018","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ipl.2020.106008_br0020","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1002\/rsa.20821","article-title":"A note on dispersing particles on a line","volume":"53","author":"Frieze","year":"2018","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ipl.2020.106008_br0030","series-title":"Introduction to Random Graphs","author":"Frieze","year":"2016"},{"key":"10.1016\/j.ipl.2020.106008_br0040","series-title":"Random Graphs","author":"Janson","year":"2000"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019020300958?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019020300958?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T20:50:14Z","timestamp":1617051014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019020300958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":4,"alternative-id":["S0020019020300958"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2020.106008","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Longest distance of a non-uniform dispersion process on the infinite line","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2020.106008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106008"}}