{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:45:03Z","timestamp":1774626303778,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030617387","type":"print"},{"value":"9783030617394","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61739-4_8","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:14:46Z","timestamp":1602717286000},"page":"115-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Binary Expression of Ancestors in the Collatz Graph"],"prefix":"10.1007","author":[{"given":"Tristan","family":"St\u00e9rin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Barina, D.: Convergence verification of the Collatz problem. J. Supercomputing (2020). https:\/\/doi.org\/10.1007\/s11227-020-03368-x","DOI":"10.1007\/s11227-020-03368-x"},{"key":"8_CR2","first-page":"53","volume":"8","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Pettorossi, A.: Some properties of binary sequences useful for proving Collatz\u2019s conjecture. Found. Control Eng. 8, 53\u201363 (1983)","journal-title":"Found. Control Eng."},{"key":"8_CR3","unstructured":"Bruschi, M.: Two cellular automata for the 3x+1 map (2005)"},{"key":"8_CR4","unstructured":"Capco, J.: Odd Collatz sequence and binary representations, preprint, March 2019. https:\/\/hal.archives-ouvertes.fr\/hal-02062503"},{"issue":"2","key":"8_CR5","first-page":"349","volume":"1","author":"T Cloney","year":"1987","unstructured":"Cloney, T., Goles, E., Vichniac, G.Y.: The 3x+1 problem: a quasi cellular automaton. Complex Syst. 1(2), 349\u2013360 (1987)","journal-title":"Complex Syst."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Colussi, L.: The convergence classes of Collatz function. Theoret. Comput. Sci. (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.056","DOI":"10.1016\/j.tcs.2011.05.056"},{"key":"8_CR7","unstructured":"Conway, J.: Unpredictable iterations. In: Number Theory Conference (1972)"},{"key":"8_CR8","unstructured":"Foundation, O.: The Online Encyclopedia of Integer Sequences. A083667 (2020)"},{"key":"8_CR9","unstructured":"Franco, Z., Pomerance, C.: On a conjecture of Crandall concerning the $$qx + 1$$ problem. Math. Comput. 64(211), 1333\u20131336 (1995). http:\/\/www.jstor.org\/stable\/2153499"},{"key":"8_CR10","unstructured":"Goodwin, J.R.: The 3x+1 problem and integer representations (2015)"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Gruber, H., Holzer, M.: From finite automata to regular expressions and back-a summary on descriptional complexity. Electron. Proc. Theoret. Comput. Sci. 151 (2014). https:\/\/doi.org\/10.4204\/EPTCS.151.2","DOI":"10.4204\/EPTCS.151.2"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Hew, P.C.: Working in binary protects the repetends of 1\/3$${}^{\\text{h}}$$: comment on Colussi\u2019s \u2018The convergence classes of Collatz function\u2019. Theoret. Comput. Sci. 618, 135\u2013141 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.12.033","DOI":"10.1016\/j.tcs.2015.12.033"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/s0304-3975(98)00117-0","volume":"210","author":"P Koiran","year":"1999","unstructured":"Koiran, P., Moore, C.: Closed-form analytic maps in one and two dimensions can simulate universal Turing machines. Theoret. Comput. Sci. 210(1), 217\u2013223 (1999). https:\/\/doi.org\/10.1016\/s0304-3975(98)00117-0","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-540-72504-6_49","volume":"2007","author":"SA Kurtz","year":"2007","unstructured":"Kurtz, S.A., Simon, J.: The undecidability of the generalized Collatz problem. TAMC 2007, 542\u2013553 (2007). https:\/\/doi.org\/10.1007\/978-3-540-72504-6_49","journal-title":"TAMC"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00029890.1985.11971528","volume":"92","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The 3x + 1 problem and its generalizations. Am. Math. Monthly 92(1), 3\u201323 (1985). http:\/\/www.jstor.org\/stable\/2322189","journal-title":"Am. Math. Monthly"},{"key":"8_CR16","unstructured":"Lagarias, J.C.: The 3x+1 problem: an annotated bibliography (1963\u20131999) (sorted by author) (2003)"},{"key":"8_CR17","unstructured":"Lagarias, J.C.: The 3x+1 problem: an annotated bibliography, ii (2000\u20132009) (2006)"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"L\u00f3pez, J., Stoll, P.: The 2-adic, binary and decimal periods of 1\/3k approach full complexity for increasing k. Integers [electronic only] 5 (2012). https:\/\/doi.org\/10.1515\/integers-2012-0013","DOI":"10.1515\/integers-2012-0013"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Monks, K.: The sufficiency of arithmetic progressions for the 3x + 1 conjecture. Proc. Am. Math. Soc. 134 (2006). https:\/\/doi.org\/10.2307\/4098142","DOI":"10.2307\/4098142"},{"key":"8_CR20","first-page":"182","volume":"46","author":"J Shallit","year":"1992","unstructured":"Shallit, J., Wilson, D.A.: The \u201c3x + 1\u201d problem and finite automata. Bull. EATCS 46, 182\u2013185 (1992)","journal-title":"Bull. EATCS"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"St\u00e9rin, T., Woods, D.: The Collatz process embeds a base conversion algorithm. In: Schmitz, S., Potapov, I. (eds.) 14th International Conference on Reachability Problems. LNCS, Springer (2020, to appear). https:\/\/arxiv.org\/abs\/2007.06979v2","DOI":"10.1007\/978-3-030-61739-4_9"},{"key":"8_CR22","unstructured":"St\u00e9rin, T.: Binary expression of ancestors in the Collatz graph (2020). Expanded version. https:\/\/arxiv.org\/abs\/1907.00775v4"},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"241","DOI":"10.4064\/aa-30-3-241-252","volume":"30","author":"R Terras","year":"1976","unstructured":"Terras, R.: A stopping time problem on the positive integers. Acta Arithmetica 30(3), 241\u2013252 (1976). http:\/\/eudml.org\/doc\/205476","journal-title":"Acta Arithmetica"},{"key":"8_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0095985","volume-title":"The Dynamical System Generated by the 3n + 1 Function","author":"GJ Wirsching","year":"1998","unstructured":"Wirsching, G.J.: The Dynamical System Generated by the 3n + 1 Function. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0095985"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61739-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T09:27:07Z","timestamp":1669195627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61739-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617387","9783030617394"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61739-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irif.fr\/~rp2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}