{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:51:22Z","timestamp":1777423882367,"version":"3.51.4"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1007\/bf01941122","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T10:23:42Z","timestamp":1122805422000},"page":"391-396","source":"Crossref","is-referenced-by-count":2,"title":["On admissible constellations of consecutive primes"],"prefix":"10.1007","volume":"28","author":[{"given":"Paul","family":"Erd\u00f6s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Riesel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01941122_CR1","unstructured":"G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers, Oxford 1979, pp. 371\u2013374."},{"key":"BF01941122_CR2","unstructured":"U. V. Linnik,On the least prime in an arithmetic progression. II. The Deuring-Heilbronn phenomenon, Rec. Math. (Mat. Sb.) N. S. (57) (1944) pp. 347\u2013368."},{"key":"BF01941122_CR3","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-314X(80)90056-6","volume":"12","author":"C. Pomerance","year":"1980","unstructured":"C. Pomerance,A Note on the least prime in an arithmetic progression, Journal Numb. Th. 12 (1980) pp. 218\u2013223.","journal-title":"Journal Numb. Th."},{"key":"BF01941122_CR4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-1-4757-1089-2_3","volume-title":"Prime Numbers and Computer Methods for Factorization","author":"Riesel Hans","year":"1985","unstructured":"Hans Riesel,Prime Numbers and Computer Methods for Factorization, Birkh\u00e4user, Boston 1985, pp. 64\u201379."},{"key":"BF01941122_CR5","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01934202","volume":"10","author":"Riesel Hans","year":"1970","unstructured":"Hans Riesel,Primes forming arithmetic series and clusters of large primes, BIT 10 (1970) pp. 333\u2013342.","journal-title":"BIT"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941122.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01941122\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:33:57Z","timestamp":1557765237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01941122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["BF01941122"],"URL":"https:\/\/doi.org\/10.1007\/bf01941122","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}