{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T23:40:24Z","timestamp":1777851624332,"version":"3.51.4"},"reference-count":4,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","award":["CO 646\/6"],"award-info":[{"award-number":["CO 646\/6"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.orl.2026.107425","type":"journal-article","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:40:06Z","timestamp":1771000806000},"page":"107425","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A note on the maximum clique LP relaxation"],"prefix":"10.1016","volume":"66","author":[{"given":"Pavel","family":"Zakharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107425_bib0001","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"2001"},{"key":"10.1016\/j.orl.2026.107425_bib0002","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/moor.2014.0694","article-title":"Approximation limits of linear programs (beyond hierarchies)","volume":"40","author":"Braun","year":"2015","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.orl.2026.107425_bib0003","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/226643.226652","article-title":"Interactive proofs and the hardness of approximating cliques","volume":"43","author":"Feige","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2026.107425_bib0004","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03f5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000222?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000222?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:23:47Z","timestamp":1777501427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":4,"alternative-id":["S0167637726000222"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107425","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A note on the maximum clique LP relaxation","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107425","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"107425"}}