{"id":"https://openalex.org/W4408343761","doi":"https://doi.org/10.1109/access.2025.3548031","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","display_name":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4408343761","doi":"https://doi.org/10.1109/access.2025.3548031"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3548031","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3548031","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3548031","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5115829634","display_name":"Eyob Solomon Getachew","orcid":"https://orcid.org/0009-0009-5766-2041"},"institutions":[{"id":"https://openalex.org/I4210129636","display_name":"Addis Ababa Science and Technology University","ror":"https://ror.org/02psd9228","country_code":"ET","type":"education","lineage":["https://openalex.org/I4210129636"]}],"countries":["ET"],"is_corresponding":false,"raw_author_name":"Eyob Solomon Getachew","raw_affiliation_strings":["School of Information Technology and Engineering, Addis Ababa Institute of Technology, Addis Ababa, Ethiopia"],"raw_orcid":"https://orcid.org/0009-0009-5766-2041","affiliations":[{"raw_affiliation_string":"School of Information Technology and Engineering, Addis Ababa Institute of Technology, Addis Ababa, Ethiopia","institution_ids":["https://openalex.org/I4210129636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079891074","display_name":"Beakal Gizachew Assefa","orcid":"https://orcid.org/0000-0001-9510-5216"},"institutions":[{"id":"https://openalex.org/I4210129636","display_name":"Addis Ababa Science and Technology University","ror":"https://ror.org/02psd9228","country_code":"ET","type":"education","lineage":["https://openalex.org/I4210129636"]}],"countries":["ET"],"is_corresponding":false,"raw_author_name":"Beakal Gizachew Assefa","raw_affiliation_strings":["School of Information Technology and Engineering, Addis Ababa Institute of Technology, Addis Ababa, Ethiopia"],"raw_orcid":"https://orcid.org/0000-0001-9510-5216","affiliations":[{"raw_affiliation_string":"School of Information Technology and Engineering, Addis Ababa Institute of Technology, Addis Ababa, Ethiopia","institution_ids":["https://openalex.org/I4210129636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":3.845,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.91885191,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"13","issue":null,"first_page":"41210","last_page":"41220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7198115587234497},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6443861722946167},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5824502110481262},{"id":"https://openalex.org/keywords/collatz-conjecture","display_name":"Collatz conjecture","score":0.499591588973999},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46686744689941406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36294496059417725},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3528740108013153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20466849207878113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15275728702545166}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7198115587234497},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6443861722946167},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5824502110481262},{"id":"https://openalex.org/C128814272","wikidata":"https://www.wikidata.org/wiki/Q837314","display_name":"Collatz conjecture","level":3,"score":0.499591588973999},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46686744689941406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36294496059417725},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3528740108013153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20466849207878113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15275728702545166},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3548031","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3548031","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5dbe6569d0b94f9695fa914543f8e97c","is_oa":true,"landing_page_url":"https://doaj.org/article/5dbe6569d0b94f9695fa914543f8e97c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 13, Pp 41210-41220 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3548031","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3548031","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W2524317893","https://openalex.org/W2902437463","https://openalex.org/W2922466371","https://openalex.org/W2966783498","https://openalex.org/W2974402576","https://openalex.org/W2978490715","https://openalex.org/W3095712845","https://openalex.org/W3181882215","https://openalex.org/W3199614380","https://openalex.org/W4385842759","https://openalex.org/W4387353009","https://openalex.org/W4390534541","https://openalex.org/W4390824510","https://openalex.org/W4403051490","https://openalex.org/W4404006240","https://openalex.org/W6846153008","https://openalex.org/W6861679190","https://openalex.org/W6861964628","https://openalex.org/W6870293429"],"related_works":["https://openalex.org/W4386468219","https://openalex.org/W4309119152","https://openalex.org/W4387395557","https://openalex.org/W4307855714","https://openalex.org/W4307521083","https://openalex.org/W4387897742","https://openalex.org/W4388537804","https://openalex.org/W4377024181","https://openalex.org/W4233696924","https://openalex.org/W4287827790"],"abstract_inverted_index":{"The":[0],"Collatz":[1,42,54],"conjecture,":[2],"which":[3],"posits":[4],"that":[5],"any":[6],"positive":[7],"integer":[8],"will":[9],"eventually":[10],"reach":[11],"1":[12],"through":[13],"a":[14,19,105],"specific":[15],"iterative":[16],"process,":[17],"is":[18],"classic":[20],"unsolved":[21],"problem":[22],"in":[23,40,52,117],"mathematics.":[24,119],"This":[25],"research":[26],"focuses":[27],"on":[28],"designing":[29],"an":[30],"efficient":[31],"algorithm":[32,58],"to":[33],"compute":[34],"the":[35,41,53,56,99,112],"stopping":[36],"time":[37],"of":[38,90,111],"numbers":[39,74],"sequence,":[43],"achieving":[44],"significant":[45],"computational":[46,64,87,118],"improvements.":[47],"By":[48],"leveraging":[49],"structural":[50],"patterns":[51],"tree,":[55],"proposed":[57],"minimizes":[59],"redundant":[60],"operations":[61],"and":[62,102,114],"optimizes":[63],"steps.":[65],"Unlike":[66],"prior":[67],"methods,":[68],"it":[69],"efficiently":[70],"handles":[71],"extremely":[72],"large":[73],"without":[75],"requiring":[76],"advanced":[77],"techniques":[78],"such":[79],"as":[80],"memoization":[81],"or":[82],"parallelization.":[83],"Experimental":[84],"evaluations":[85],"confirm":[86],"efficiency":[88],"improvements":[89],"approximately":[91],"28%":[92],"over":[93],"state-of-the-art":[94],"methods.":[95],"These":[96],"findings":[97],"underscore":[98],"algorithm\u2019s":[100],"scalability":[101],"robustness,":[103],"providing":[104],"foundation":[106],"for":[107],"future":[108],"large-scale":[109],"verification":[110],"conjecture":[113],"potential":[115],"applications":[116]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}