{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T02:31:47Z","timestamp":1772505107054,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12025103"],"award-info":[{"award-number":["12025103"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20243060"],"award-info":[{"award-number":["BK20243060"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s00153-025-00995-0","type":"journal-article","created":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T12:40:06Z","timestamp":1762692006000},"page":"213-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the hausdorff dimension of maximal chains and antichains of turing and hyperarithmetic degrees"],"prefix":"10.1007","volume":"65","author":[{"given":"Sirun","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,9]]},"reference":[{"issue":"3","key":"995_CR1","doi-asserted-by":"publisher","first-page":"958","DOI":"10.2178\/jsl\/1154698584","volume":"71","author":"L Yu","year":"2006","unstructured":"Yu, L.: Measure theory aspects of locally countable orderings. The Journal of Symbolic Logic 71(3), 958\u2013968 (2006)","journal-title":"The Journal of Symbolic Logic"},{"issue":"11","key":"995_CR2","doi-asserted-by":"publisher","first-page":"8249","DOI":"10.1090\/tran\/6881","volume":"368","author":"C Chong","year":"2016","unstructured":"Chong, C., Yu, L.: Measure-theoretic applications of higher Demuth s theorem. Trans. Am. Math. Soc. 368(11), 8249\u20138265 (2016)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"995_CR3","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1017\/jsl.2015.50","volume":"80","author":"CT Chong","year":"2015","unstructured":"Chong, C.T., Yu, L.: Randomness in the higher setting. The Journal of Symbolic Logic 80(4), 1131\u20131148 (2015)","journal-title":"The Journal of Symbolic Logic"},{"issue":"5","key":"995_CR4","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.ipl.2008.05.028","volume":"108","author":"R Downey","year":"2008","unstructured":"Downey, R., Greenberg, N.: Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108(5), 298\u2013303 (2008)","journal-title":"Inf. Process. Lett."},{"key":"995_CR5","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Turing computability: theory and applications (2016)","DOI":"10.1007\/978-3-642-31933-4"},{"key":"995_CR6","volume-title":"G and Hirschfeldt","author":"R Downey","year":"2010","unstructured":"Downey, R.: G and Hirschfeldt. Algorithmic Randomness and Complexity. Springer, New York, Denis R (2010)"},{"key":"995_CR7","doi-asserted-by":"publisher","DOI":"10.1515\/9783110275643","volume-title":"Recursion Theory: Computational Aspects of Definability","author":"CT Chong","year":"2015","unstructured":"Chong, C.T., Yu, L.: Recursion Theory: Computational Aspects of Definability, vol. 8. Walter de Gruyter GmbH & Co KG, Berlin (2015)"},{"key":"995_CR8","volume-title":"Degrees of Unsolvability","author":"GE Sacks","year":"1966","unstructured":"Sacks, G.E.: Degrees of Unsolvability, vol. 55. Princeton University Press, Princeton, New Jersey (1966)"},{"issue":"10","key":"995_CR9","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1016\/j.apal.2010.04.001","volume":"161","author":"B Kjos-Hanssen","year":"2010","unstructured":"Kjos-Hanssen, B., Nies, A., Stephan, F., Yu, L.: Higher kurtz randomness. Ann. Pure Appl. Logic 161(10), 1280\u20131290 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"key":"995_CR10","first-page":"33","volume":"173","author":"CG Jockusch","year":"1972","unstructured":"Jockusch, C.G., Soare, R.I.: $$\\pi ^0_1$$ classes and degrees of theories. Trans. Am. Math. Soc. 173, 33\u201356 (1972)","journal-title":"Trans. Am. Math. Soc."},{"key":"995_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1090\/S0002-9947-1969-0245439-X","volume":"142","author":"CG Jockusch","year":"1969","unstructured":"Jockusch, C.G.: Relationships between reducibilities. Trans. Am. Math. Soc. 142, 229\u2013237 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"995_CR12","unstructured":"Terwijn, S.A., Zambella, D.: Algorithmic randomness and lowness (1997)"},{"issue":"2","key":"995_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/1970214","volume":"77","author":"GE Sacks","year":"1963","unstructured":"Sacks, G.E.: On the degrees less than $$0^{\\prime }$$. Ann. Math. 77(2), 211\u2013231 (1963)","journal-title":"Ann. Math."},{"issue":"3","key":"995_CR14","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/BF01694181","volume":"5","author":"C-P Schnorr","year":"1971","unstructured":"Schnorr, C.-P.: A unified approach to the definition of random sequences. Mathematical systems theory 5(3), 246\u2013258 (1971)","journal-title":"Mathematical systems theory"},{"key":"995_CR15","doi-asserted-by":"crossref","unstructured":"Lutz, J.H.: Gales and the constructive dimension of individual sequences. In: Automata, Languages and Programming: 27th International Colloquium, ICALP 2000 Geneva, Switzerland, July 9\u201315, 2000 Proceedings 27, pp. 902\u2013913 (2000). Springer","DOI":"10.1007\/3-540-45022-X_76"},{"issue":"1","key":"995_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"JH Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Inf. Comput. 187(1), 49\u201379 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"995_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(02)00343-5","volume":"84","author":"E Mayordomo","year":"2002","unstructured":"Mayordomo, E.: A kolmogorov complexity characterization of constructive Hausdorff dimension. Inf. Process. Lett. 84(1), 1\u20133 (2002)","journal-title":"Inf. Process. Lett."},{"key":"995_CR18","unstructured":"Terwijn, S.A.: Complexity and randomness. Rend. Sem. Mat. Univ. Politec. Torino, 1\u201337 (2004)"},{"issue":"3","key":"995_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/S0097539703446912","volume":"37","author":"KB Athreya","year":"2007","unstructured":"Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM J. Comput. 37(3), 671\u2013705 (2007)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"995_CR20","doi-asserted-by":"publisher","first-page":"4233","DOI":"10.1090\/S0002-9947-09-04783-7","volume":"361","author":"C Chong","year":"2009","unstructured":"Chong, C., Yu, L.: A $$\\pi $$$$^1_1$$-uniformization principle for reals. Trans. Am. Math. Soc. 361(8), 4233\u20134245 (2009)","journal-title":"Trans. Am. Math. Soc."},{"issue":"10","key":"995_CR21","doi-asserted-by":"publisher","first-page":"5465","DOI":"10.1090\/S0002-9947-2011-05306-7","volume":"363","author":"B Kjos-Hanssen","year":"2011","unstructured":"Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov complexity and the recursion theorem. Trans. Am. Math. Soc. 363(10), 5465\u20135480 (2011)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"995_CR22","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.2178\/jsl\/1203350783","volume":"72","author":"CT Chong","year":"2007","unstructured":"Chong, C.T., Yu, L.: Maximal chains in the turing degrees. The Journal of Symbolic Logic 72(4), 1219\u20131227 (2007)","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"995_CR23","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1017\/bsl.2017.12","volume":"23","author":"M Khan","year":"2017","unstructured":"Khan, M., Miller, J.S.: Forcing with bushy trees. Bulletin of Symbolic Logic 23(2), 160\u2013180 (2017)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"4","key":"995_CR24","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1112\/blms\/bdr003","volume":"43","author":"N Greenberg","year":"2011","unstructured":"Greenberg, N., Miller, J.S.: Diagonally non-recursive functions and effective hausdorff dimension. Bull. Lond. Math. Soc. 43(4), 636\u2013654 (2011)","journal-title":"Bull. Lond. Math. Soc."},{"key":"995_CR25","unstructured":"Liu, L.: Which DNR can be minimal. arXiv preprint arXiv:1912.09053 (2019)"},{"issue":"1","key":"995_CR26","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S1571-0661(04)80377-3","volume":"66","author":"RG Downey","year":"2002","unstructured":"Downey, R.G., Hirschfeldt, D.R., Nies, A., Stephan, F.: Trivial reals. Electronic Notes in Theoretical Computer Science 66(1), 36\u201352 (2002)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1","key":"995_CR27","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.aim.2004.10.006","volume":"197","author":"A Nies","year":"2005","unstructured":"Nies, A.: Lowness properties and randomness. Adv. Math. 197(1), 274\u2013305 (2005)","journal-title":"Adv. Math."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-025-00995-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-025-00995-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-025-00995-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T17:23:53Z","timestamp":1770398633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-025-00995-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["995"],"URL":"https:\/\/doi.org\/10.1007\/s00153-025-00995-0","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,9]]},"assertion":[{"value":"7 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}