{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T20:05:13Z","timestamp":1748635513125,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"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_3","type":"book-chapter","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T17:02:06Z","timestamp":1685552526000},"page":"32-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generically Computable Abelian Groups"],"prefix":"10.1007","author":[{"given":"Wesley","family":"Calvert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas","family":"Cenzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Harizanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/logcom\/exab057","volume":"32","author":"W Calvert","year":"2022","unstructured":"Calvert, W., Cenzer, D., Harizanov, V.: Densely computable structures. J. Logic Comput. 32, 581\u2013607 (2022)","journal-title":"J. Logic Comput."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.3233\/COM-210382","volume":"11","author":"W Calvert","year":"2022","unstructured":"Calvert, W., Cenzer, D., Harizanov, V.: Generically and coarsely computable isomorphisms. Computability 11, 223\u2013239 (2022). https:\/\/doi.org\/10.3233\/COM-210382","journal-title":"Computability"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.apal.2008.11.003","volume":"159","author":"W Calvert","year":"2009","unstructured":"Calvert, W., Cenzer, D., Harizanov, V., Morozov, A.: Effective categoricity of Abelian p-groups. Ann. Pure Appl. Logic 159, 187\u2013197 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"3_CR4","unstructured":"Fuchs, L.: Infinite Abelian groups, volume I, Academic Press (1970)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1112\/jlms\/jdr051","volume":"85","author":"CG Jockusch","year":"2012","unstructured":"Jockusch, C.G., Schupp, P.E.: Generic computability, Turing degrees, and asymptotic density. J. London Math. Soc. 85, 472\u2013490 (2012)","journal-title":"J. London Math. Soc."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Jockusch, C.G. Schupp, P.E.: Asymptotic density and the theory of computability: a partial survey. In: Computability and Complexity, Lecture Notes in Computer Science, vol. 10010, pp. 501\u2013520 (2017)","DOI":"10.1007\/978-3-319-50062-1_30"},{"key":"3_CR7","unstructured":"Kaplansky, I.: Infinite Abelian groups, University of Michigan Press (1954)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0021-8693(03)00167-4","volume":"264","author":"I Kapovich","year":"2003","unstructured":"Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity, decision problems in group theory, and random walks. J. Algebra 264, 665\u2013694 (2003)","journal-title":"J. Algebra"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Khisamiev, N.G.: Constructive Abelian groups, Handbook of Recursive Mathematics, Vol. 2, Stud. Logic Found. Math., vol. 139, Elsevier, pp. 1177\u20131231 (1998)","DOI":"10.1016\/S0049-237X(98)80050-5"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"5427","DOI":"10.1090\/proc\/12669","volume":"143","author":"A Montalb\u00e1n","year":"2015","unstructured":"Montalb\u00e1n, A.: A robuster Scott rank. Proc. Am. Math. Soc. 143, 5427\u20135436 (2015)","journal-title":"Proc. Am. Math. Soc."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Rotman, J.J.: The theory of groups, Allyn and Bacon (1965)","DOI":"10.2307\/2314159"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer-Verlag (1987)","DOI":"10.1007\/978-3-662-02460-7"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T17:02:13Z","timestamp":1685552533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34034-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340338","9783031340345"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34034-5_3","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)"}}]}}