{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T23:38:29Z","timestamp":1772149109594,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"CIDMA","award":["UID\/MAT\/04106\/2019"],"award-info":[{"award-number":["UID\/MAT\/04106\/2019"]}]},{"DOI":"10.13039\/501100006753","name":"CMUP","doi-asserted-by":"publisher","award":["UID\/MAT\/00144\/2019"],"award-info":[{"award-number":["UID\/MAT\/00144\/2019"]}],"id":[{"id":"10.13039\/501100006753","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advances in Applied Mathematics"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1016\/j.aam.2019.02.004","type":"journal-article","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T14:28:13Z","timestamp":1552573693000},"page":"125-143","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["The number of parking functions with center of a given length"],"prefix":"10.1016","volume":"107","author":[{"given":"Rui","family":"Duarte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ant\u00f3nio","family":"Guedes de Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.aam.2019.02.004_br0010","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1090\/S0002-9947-2011-05521-2","article-title":"The Shi arrangement and the Ish arrangement","volume":"364","author":"Armstrong","year":"2012","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.aam.2019.02.004_br0020","author":"Duarte"},{"key":"10.1016\/j.aam.2019.02.004_br0030","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ejc.2015.03.017","article-title":"The braid and the Shi arrangements and the Pak-Stanley labelling","volume":"50","author":"Duarte","year":"2015","journal-title":"European J. Combin."},{"key":"10.1016\/j.aam.2019.02.004_br0040","doi-asserted-by":"crossref","first-page":"8403","DOI":"10.1090\/tran\/6584","article-title":"Affine permutations and rational slope parking functions","volume":"369","author":"Gorsky","year":"2016","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.aam.2019.02.004_br0050","article-title":"Parking functions and labeled trees","volume":"65","author":"Guedes de Oliveira","year":"2010","journal-title":"S\u00e9m. Lothar. Combin."},{"key":"10.1016\/j.aam.2019.02.004_br0060","article-title":"The q,t-Catalan Numbers and the Space of Diagonal Harmonics","volume":"vol. 41","author":"Haglund","year":"2008"},{"key":"10.1016\/j.aam.2019.02.004_br0070","series-title":"The Art of Computer Programming. Vol. 3. Sorting and Searching","author":"Knuth","year":"1998"},{"key":"10.1016\/j.aam.2019.02.004_br0080","series-title":"Handbook of Enumerative Combinatorics","first-page":"589","article-title":"Lattice path enumeration","author":"Krattenthaler","year":"2015"},{"issue":"4","key":"10.1016\/j.aam.2019.02.004_br0090","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02107572","article-title":"Une famille de polyn\u00f4mes ayant plusieurs propri\u00e9t\u00e9s \u00e9numeratives","volume":"11","author":"Kreweras","year":"1980","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/j.aam.2019.02.004_br0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejc.2013.12.001","article-title":"Bijections for the Shi and Ish arrangements","volume":"39","author":"Leven","year":"2014","journal-title":"European J. Combin."},{"issue":"2","key":"10.1016\/j.aam.2019.02.004_br0110","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00493-015-3191-y","article-title":"G-parking functions and tree inversions","volume":"37","author":"Perkinson","year":"2017","journal-title":"Combinatorica"},{"key":"10.1016\/j.aam.2019.02.004_br0120","author":"Shin"},{"issue":"6","key":"10.1016\/j.aam.2019.02.004_br0130","doi-asserted-by":"crossref","first-page":"2620","DOI":"10.1073\/pnas.93.6.2620","article-title":"Hyperplane arrangements, interval orders, and trees","volume":"93","author":"Stanley","year":"1996","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.aam.2019.02.004_br0140","series-title":"Handbook of Enumerative Combinatorics","first-page":"835","article-title":"Parking functions","author":"Yan","year":"2015"}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885819300417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885819300417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:53:53Z","timestamp":1759301633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196885819300417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":14,"alternative-id":["S0196885819300417"],"URL":"https:\/\/doi.org\/10.1016\/j.aam.2019.02.004","relation":{},"ISSN":["0196-8858"],"issn-type":[{"value":"0196-8858","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The number of parking functions with center of a given length","name":"articletitle","label":"Article Title"},{"value":"Advances in Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.aam.2019.02.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}