{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:46:42Z","timestamp":1755802002036,"version":"3.44.0"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["491453517"],"award-info":[{"award-number":["491453517"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS1952285"],"award-info":[{"award-number":["DMS1952285"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2025,9,30]]},"DOI":"10.1137\/23m1623434","type":"journal-article","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T07:47:41Z","timestamp":1755762461000},"page":"1737-1757","source":"Crossref","is-referenced-by-count":0,"title":["Hamilton Cycles in Random Digraphs with Minimum Degree at Least One"],"prefix":"10.1137","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5264-4401","authenticated-orcid":true,"given":"Colin","family":"Cooper","sequence":"first","affiliation":[{"name":"Department of Informatics, King\u2019s College, London WC2B 4BG, England."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8481-5615","authenticated-orcid":true,"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213 USA."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","published-online":{"date-parts":[[2025,8,21]]},"reference":[{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1002\/rsa.20978"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1002\/(SICI)1098-2418(199803)12:2<111::AID-RSA1>3.0.CO;2-#"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1017\/CBO9780511983917.006"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1006\/jctb.1994.1060"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1017\/CBO9780511779398"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/BF01585751"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/0196-6774(88)90037-5"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1137\/S0097539792235384"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/978-3-0348-7915-6_11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1137\/S0097539701391518"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1137\/0208045"},{"key":"ref14","first-page":"181","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Karp R. M.","year":"1985"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/BFb0120903"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1002\/rsa.3240030202"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T07:47:42Z","timestamp":1755762462000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1623434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,21]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1137\/23M1623434"],"URL":"https:\/\/doi.org\/10.1137\/23m1623434","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"type":"print","value":"0895-4801"},{"type":"electronic","value":"1095-7146"}],"subject":[],"published":{"date-parts":[[2025,8,21]]}}}