{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:26:48Z","timestamp":1764131208135,"version":"3.44.0"},"reference-count":3,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1016\/0020-0190(94)00202-a","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:31Z","timestamp":1027634671000},"page":"173-176","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["A polynomial bound on the number of light cycles in an undirected graph"],"prefix":"10.1016","volume":"53","author":[{"given":"Ashok","family":"Subramanian","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00202-A_BIB1","unstructured":"R.J. Anderson, Personal communication."},{"key":"10.1016\/0020-0190(94)00202-A_BIB2","series-title":"Studies in Discrete Optimization","first-page":"290","article-title":"On the structure of a family of minimal weighted cuts in a graph","author":"Dinits","year":"1976"},{"key":"10.1016\/0020-0190(94)00202-A_BIB3","series-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms","first-page":"21","article-title":"Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm","author":"Karger","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400202A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400202A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:35Z","timestamp":1757084315000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400202A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["002001909400202A"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00202-a","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1995,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A polynomial bound on the number of light cycles in an undirected graph","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(94)00202-A","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}