{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T15:03:43Z","timestamp":1703084623076},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5921,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/0012-365x(95)00164-r","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"227-232","source":"Crossref","is-referenced-by-count":3,"title":["A generating function approach to random subgraphs of the n-cycle"],"prefix":"10.1016","volume":"169","author":[{"given":"Xavier","family":"Gourdon","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00164-R_BIB1","series-title":"Calcul Infinit\u00e9simal","author":"Dieudonn\u00e9","year":"1968"},{"key":"10.1016\/0012-365X(95)00164-R_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","article-title":"Periods in strings","volume":"30","author":"Guibas","year":"1981","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/0012-365X(95)00164-R_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0012-365X(93)90543-3","article-title":"The largest component in a random subgraph of the n-cycle","volume":"121","author":"Katona","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00164-R_BIB4","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/S1385-7258(78)80014-6","article-title":"The average time for carry propagation","volume":"40","author":"Knuth","year":"1978","journal-title":"Ind. Math."},{"key":"10.1016\/0012-365X(95)00164-R_BIB5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(84)90085-2","article-title":"Random subgraphs of the n-cycle","volume":"52","author":"Palka","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00164-R_BIB6","series-title":"The Theory of Functions","author":"Titchmarsh","year":"1939"},{"key":"10.1016\/0012-365X(95)00164-R_BIB7","first-page":"431","article-title":"Analysis of algorithms and data structures","author":"Vitter","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500164R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500164R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:04Z","timestamp":1556130484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500164R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["0012365X9500164R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00164-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}