{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:47Z","timestamp":1759063667897,"version":"3.37.3"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["OGP0003379"],"award-info":[{"award-number":["OGP0003379"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0020-0190(02)00481-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"107-112","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"title":["A CAT algorithm for generating permutations with a fixed number of inversions"],"prefix":"10.1016","volume":"86","author":[{"given":"Scott","family":"Effler","sequence":"first","affiliation":[]},{"given":"Frank","family":"Ruskey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00481-7_BIB001","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01933579","article-title":"A new algorithm for generating derangements","volume":"20","author":"Akl","year":"1980","journal-title":"BIT"},{"key":"10.1016\/S0020-0190(02)00481-7_BIB002","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01932127","article-title":"Generating alternating permutations lexicographically","volume":"30","author":"Bauslaugh","year":"1990","journal-title":"BIT"},{"key":"10.1016\/S0020-0190(02)00481-7_BIB003","doi-asserted-by":"crossref","first-page":"#R50","DOI":"10.37236\/1528","article-title":"An asymptotic expansion for the number of permutations with a certain number of inversions","volume":"7","author":"Clark","year":"2000","journal-title":"Electron. J. Combin."},{"year":"1998","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","key":"10.1016\/S0020-0190(02)00481-7_BIB004"},{"year":"2002","series-title":"The Art of Computer Programming, Vol. 4: Prefascicle 2B","author":"Knuth","key":"10.1016\/S0020-0190(02)00481-7_BIB005"},{"key":"10.1016\/S0020-0190(02)00481-7_BIB006","series-title":"Millennial Perspectives in Computer Science","first-page":"187","article-title":"Dancing links","author":"Knuth","year":"2000"},{"key":"10.1016\/S0020-0190(02)00481-7_BIB007","article-title":"Permutations with inversions","volume":"4","author":"Margolis","year":"2001","journal-title":"J. Integer Seq."},{"key":"10.1016\/S0020-0190(02)00481-7_BIB008","unstructured":"F. Ruskey, Combinatorial generation, Working version of book in progress, 1995\u20132002"},{"key":"10.1016\/S0020-0190(02)00481-7_BIB009","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539791202647","article-title":"Generating linear extensions fast","volume":"23","author":"Pruesse","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00481-7_BIB010","series-title":"Proceedings of the 23rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992)","first-page":"87","article-title":"Constant time generation of involutions","volume":"90","author":"Roelants van Baronaigien","year":"1992"},{"key":"10.1016\/S0020-0190(02)00481-7_BIB011","first-page":"323","article-title":"Loop-free sequencing of bounded integer compositions","volume":"33","author":"Walsh","year":"2000","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004817?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004817?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T08:29:18Z","timestamp":1718440158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0020019002004817"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00481-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A CAT algorithm for generating permutations with a fixed number of inversions","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(02)00481-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}