{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:21:27Z","timestamp":1773249687557,"version":"3.50.1"},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T00:00:00Z","timestamp":1289952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s11075-010-9435-4","type":"journal-article","created":{"date-parts":[[2010,11,15]],"date-time":"2010-11-15T19:31:50Z","timestamp":1289849510000},"page":"399-403","source":"Crossref","is-referenced-by-count":2,"title":["Zeros of polynomials embedded in an orthogonal sequence"],"prefix":"10.1007","volume":"57","author":[{"given":"Alan","family":"Beardon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathy","family":"Driver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerstin","family":"Jordaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,17]]},"reference":[{"key":"9435_CR1","unstructured":"Beardon, A.F.: The Theorems of Stieltjes and Favard. Submitted to CMFT"},{"key":"9435_CR2","volume-title":"Orthogonal Polynomials","author":"G Szeg\u0151","year":"1975","unstructured":"Szeg\u0151, G.: Orthogonal Polynomials. American Mathematical Society, Providence (1975)"},{"key":"9435_CR3","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1090\/S0002-9939-1961-0131120-2","volume":"12","author":"B Wendroff","year":"1961","unstructured":"Wendroff, B.: On orthogonal polynomials. Proc. Am. Math. Soc. 12, 554\u2013555 (1961)","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-010-9435-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-010-9435-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-010-9435-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:16Z","timestamp":1559351296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-010-9435-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,17]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9435"],"URL":"https:\/\/doi.org\/10.1007\/s11075-010-9435-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,17]]}}}