{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T13:39:35Z","timestamp":1772026775645,"version":"3.50.1"},"update-to":[{"DOI":"10.1007\/s10878-022-00938-y","type":"retraction","label":"Retraction","source":"retraction-watch","updated":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:00:00Z","timestamp":1712534400000},"record-id":"63479"},{"DOI":"10.1007\/s10878-022-00938-y","type":"retraction","label":"Retraction","source":"publisher","updated":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:00:00Z","timestamp":1712534400000}}],"reference-count":0,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10878-024-01156-4","type":"journal-article","created":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T08:02:06Z","timestamp":1712563326000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Retraction Note: The Sachs theorem and its application on extended adjacency matrix of graphs"],"prefix":"10.1007","volume":"47","author":[{"given":"Bo","family":"Deng","sequence":"first","affiliation":[]},{"given":"Caibing","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Kinkar Chandra","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,8]]},"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01156-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01156-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01156-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:47:29Z","timestamp":1772023649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01156-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1156"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01156-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"8 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"50"}}