{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T01:57:20Z","timestamp":1767146240296,"version":"build-2238731810"},"update-to":[{"DOI":"10.1016\/j.ipl.2023.106463","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000}}],"reference-count":3,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.ipl.2025.106592","type":"journal-article","created":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T11:05:50Z","timestamp":1749035150000},"page":"106592","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Corrigendum to \u201cOn the complexity of co-secure dominating set problem\u201d [Inf. Process. Lett. 185 (2024) 106463]"],"prefix":"10.1016","volume":"191","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0721-5325","authenticated-orcid":false,"given":"Bhawani Sankar","family":"Panda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumyashree","family":"Rana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sounaka","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/j.ipl.2025.106592_br0010","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","article-title":"Approximation hardness of dominating set problems in bounded degree graphs","volume":"206","author":"Chleb\u00edk","year":"2008","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ipl.2025.106592_br0020","series-title":"Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing","first-page":"624","article-title":"Analytical approach to parallel repetition","author":"Dinur","year":"2014"},{"key":"10.1016\/j.ipl.2025.106592_br0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2023.106463","article-title":"On the complexity of co-secure dominating set problem","volume":"185","author":"Panda","year":"2024","journal-title":"Inf. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019025000365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019025000365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T09:43:44Z","timestamp":1757411024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019025000365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":3,"alternative-id":["S0020019025000365"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2025.106592","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Corrigendum to \u201cOn the complexity of co-secure dominating set problem\u201d [Inf. Process. Lett. 185 (2024) 106463]","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2025.106592","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106463","name":"associatedlink","label":"CrossRef DOI link to the associated document"},{"value":"simple-article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106592"}}