{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:32:55Z","timestamp":1743031975299,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031340338"},{"type":"electronic","value":"9783031340345"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34034-5_4","type":"book-chapter","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T17:02:06Z","timestamp":1685552526000},"page":"46-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extraction Rates of\u00a0Random Continuous Functionals"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cameron","family":"Fraize","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Porter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,1]]},"reference":[{"issue":"7\u20138","key":"4_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s00153-007-0060-4","volume":"46","author":"G Barmpalias","year":"2008","unstructured":"Barmpalias, G., Brodhead, P., Cenzer, D., Remmel, J.B., Weber, R.: Algorithmic randomness of continuous functions. Arch. Math. Logic 46(7\u20138), 533\u2013546 (2008)","journal-title":"Arch. Math. Logic"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals Math. Stat. 23(4), 493\u2013507 (1952)","journal-title":"Annals Math. Stat."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-17142-5_4","volume-title":"Theory and Applications of Models of Computation","author":"D Cenzer","year":"2015","unstructured":"Cenzer, D., Porter, C.P.: Algorithmically Random Functions and Effective Capacities. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 23\u201337. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_4"},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.3233\/COM-210343","author":"D Cenzer","year":"2022","unstructured":"Cenzer, D., Porter, C.P.: Randomness extraction in computability theory. Computability (2022). https:\/\/doi.org\/10.3233\/COM-210343","journal-title":"Randomness extraction in computability theory. Computability"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-319-94418-0_14","volume-title":"Sailing Routes in the World of Computation","author":"D Cenzer","year":"2018","unstructured":"Cenzer, D., Rojas, D.A.: Online Computability and Differentiation in the Cantor Space. In: Manea, F., Miller, R.G., Nowotka, D. (eds.) CiE 2018. LNCS, vol. 10936, pp. 136\u2013145. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94418-0_14"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic randomness and complexity. Springer (2010). https:\/\/doi.org\/10.1007\/978-0-387-68441-3","DOI":"10.1007\/978-0-387-68441-3"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Franklin, J.N.Y., Porter, C.P.: Key developments in algorithmic randomness. In Johanna N.Y. Franklin and Christopher P. Porter, editors, Algorithmic Randomness: Progress and Prospects, volume 50 of Lecture Notes in Logic. Cambridge University Press (2020)","DOI":"10.1017\/9781108781718"},{"key":"4_CR8","unstructured":"Steven M. Kautz. Degrees of random sets. ProQuest LLC, Ann Arbor, MI, 1991. Thesis (Ph.D.)-Cornell University"},{"key":"4_CR9","unstructured":"Knuth, D.E., Yao, A.C.: The complexity of nonuniform random number generation. In: Algorithms and complexity (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, Pa., 1976), pp. 357\u2013428 (1976)"},{"key":"4_CR10","first-page":"85","volume":"25","author":"L Levin","year":"1970","unstructured":"Levin, L., Zvonkin, A.K.: The complexity of finite objects and the development of the concepts of information and randomness of means of the theory of algorithms. Uspekhi Mat. Nauk 25, 85\u2013127 (1970)","journal-title":"Uspekhi Mat. Nauk"},{"key":"4_CR11","unstructured":"Nies, A.: Computability and randomness, volume 51 of Oxford Logic Guides. Oxford University Press (200"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1214\/aos\/1176348543","volume":"20","author":"Y Peres","year":"1992","unstructured":"Peres, Y.: Iterating von Neumann\u2019s procedure for extracting random bits. Ann. Statist. 20, 590\u2013597 (1992)","journal-title":"Ann. Statist."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Shen, A., Uspensky, V.A., Vereshchagin., N.: Kolmogorov complexity and algorithmic randomness, vol. 220. American Mathematical Soc (2017)","DOI":"10.1090\/surv\/220"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.2307\/2274480","volume":"55","author":"M Van Lambalgen","year":"1990","unstructured":"Van Lambalgen, M.: The axiomatization of randomness. J. Symbolic Logic 55(3), 1143\u20131167 (1990)","journal-title":"J. Symbolic Logic"},{"key":"4_CR15","unstructured":"Neumann, J.v.: Various techniques used in connection with random digits. Appl. Math Series 12, 36\u201338 (1951)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34034-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T18:06:04Z","timestamp":1689703564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34034-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340338","9783031340345"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34034-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jacksonville, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/ucnc2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}