{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:31:24Z","timestamp":1768437084158,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00493-020-4626-7","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T13:17:03Z","timestamp":1647263823000},"page":"587-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extractors for Small Zero-Fixing Sources"],"prefix":"10.1007","volume":"42","author":[{"given":"Pavel","family":"Pudl\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojt\u0115ch","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"4626_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1734213.1734214","volume":"57","author":"B Barak","year":"2010","unstructured":"B. Barak, G. Kindler, R. Shaltiel, B. Sudakov and A. Wigderson: Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors, J. ACM 57 (2010), 1\u201352.","journal-title":"J. ACM"},{"key":"4626_CR2","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.4007\/annals.2012.176.3.3","volume":"173","author":"B Barak","year":"2012","unstructured":"B. Barak, A. Rao, R. Shaltiel and A. Wigderson: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction, Annals of Mathematics 173 (2012), 1483\u20131543.","journal-title":"Annals of Mathematics"},{"key":"4626_CR3","doi-asserted-by":"crossref","unstructured":"C. H. Bennett, G. Brasard and J. M. Robert: How to reduce your enemy\u2019s information, in: Advances in Cryptography (CRYPTO), vol. 218, 468\u2013476.","DOI":"10.1007\/3-540-39799-X_37"},{"key":"4626_CR4","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1017\/S0963548311000319","volume":"20","author":"B Bollob\u00e1s","year":"2011","unstructured":"B. Bollob\u00e1s, I. Leader and C. Malvenuto: Daisies and other Tur\u00e1n problems, Combinatorics, Probability and Computing 20 (2011), 743\u2013747.","journal-title":"Combinatorics, Probability and Computing"},{"key":"4626_CR5","doi-asserted-by":"crossref","unstructured":"B. Chor, O. Goldreich, J. H\u00e5stad, J. Friedman, S. Rudich and R. Smolensky: The Bit Extraction Problem of t-Resilient Functions (Preliminary Version), Proc. FOCS (1985), 396\u2013407.","DOI":"10.1109\/SFCS.1985.55"},{"key":"4626_CR6","unstructured":"G. Cohen: private communication."},{"key":"4626_CR7","doi-asserted-by":"crossref","unstructured":"G. Cohen and I. Shinkar: Zero-fixing extractors for sub-logarithmic entropy, Proc. ICALP (1), 343\u2013354, 2015.","DOI":"10.1007\/978-3-662-47672-7_28"},{"key":"4626_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0012-365X(93)E0139-U","volume":"137","author":"D Duffus","year":"1995","unstructured":"D. Duffus, H. Lefmann and V. R\u00f6dl: Shift graphs and lower bounds on Ramsey numbers rk(l, r), Discrete Math. 137 (1995), 177\u2013187.","journal-title":"Discrete Math."},{"key":"4626_CR9","first-page":"83","volume-title":"Theory of Graphs, Proc. Colloq., Tihany","author":"P Erd\u0151s","year":"1968","unstructured":"P. Erd\u0151s and A. Hajnal: On chromatic number of infinite graphs, in: Theory of Graphs, Proc. Colloq., Tihany, 1966, Academic Press, New York, 83\u201398, 1968."},{"key":"4626_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01886396","volume":"16","author":"P Erd\u0151s","year":"1965","unstructured":"P. Erd\u0151s, A. Hajnal and R. Rado: Partition relations for cardinal numbers, Acta Math. Acad. Sci. Hungar. 16 (1965), 93\u2013196.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"4626_CR11","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1137\/S0097539705447049","volume":"36","author":"A Gabizon","year":"2006","unstructured":"A. Gabizon, R. Raz and R. Shaltiel: Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed, SIAM J. Comput. 36 (2006), 1072\u20131094.","journal-title":"SIAM J. Comput."},{"key":"4626_CR12","unstructured":"R. L. Graham, B. L. Rothschild and J. H. Spencer: Ramsey Theory, 2nd edition, Wiley, 1990."},{"key":"4626_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0095-8956(72)90057-3","volume":"13","author":"C C Harner","year":"1972","unstructured":"C. C. Harner and R. C. Entringer: Arc colorings of digraphs, J. Combinatorial Theory Ser. B 13 (1972), 219\u2013225.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"4626_CR14","doi-asserted-by":"crossref","unstructured":"S. Janson, T. Luczak and A. Rucinski: Random Graphs, Wiley, 2000.","DOI":"10.1002\/9781118032718"},{"key":"4626_CR15","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539705446846","volume":"36","author":"J Kamp","year":"2007","unstructured":"J. Kamp and D. Zuckerman: Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography, SIAM J. Comput. 36 (2007), 1231\u20131247.","journal-title":"SIAM J. Comput."},{"key":"4626_CR16","first-page":"209","volume":"32","author":"S Poljak","year":"1991","unstructured":"S. Poljak: Coloring digraphs by iterated antichains, Comment. Math. Univ. Carolin. 32 (1991), 209\u2013212.","journal-title":"Comment. Math. Univ. Carolin."},{"key":"4626_CR17","unstructured":"J. Schmerl: Unpublished, D. Duffus oral communication 1986."},{"key":"4626_CR18","doi-asserted-by":"crossref","unstructured":"U. V. Vazirani: Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract), Proc. STOC (1985), 366\u2013378.","DOI":"10.1145\/22145.22186"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4626-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-4626-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4626-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T15:05:21Z","timestamp":1664809521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-4626-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["4626"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4626-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"3 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}