{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:22:13Z","timestamp":1777645333395,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2015,10]]},"abstract":"<jats:p>\n                    We consider sequences of vectors from \u2115\n                    <jats:sup>d<\/jats:sup>\n                    . Each coordinate of a vector can be reset or incremented by 1 with respect to the same coordinate of the preceding vector. We give an example of non-dominating sequence, like in Dickson\u2019s Lemma, of length 2\n                    <jats:sup>\n                      2\n                      <jats:sup>\u03b8( n)<\/jats:sup>\n                    <\/jats:sup>\n                    , what matches the previously known upper bound.\n                  <\/jats:p>","DOI":"10.3233\/fi-2015-1247","type":"journal-article","created":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T17:43:20Z","timestamp":1441215800000},"page":"123-127","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-dominating Sequences of Vectors Using only Resets and Increments"],"prefix":"10.1177","volume":"140","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[{"name":"Institute of Computer Science, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Gogacz","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Wroc\u0142aw, Joliot-Curie 15, Wroc\u0142aw, Poland."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eryk","family":"Kopczy\u0144ski","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,10,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1247","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:31:58Z","timestamp":1777444318000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2015-1247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["10.3233\/FI-2015-1247"],"URL":"https:\/\/doi.org\/10.3233\/fi-2015-1247","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}