{"id":"W4391197450","doi":"10.1016/j.disc.2024.113902","title":"An upper bound of the number of distinct powers in binary words","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Binary number; Upper and lower bounds; Combinatorics; Discrete mathematics; Arithmetic","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005502478,0.002503224,0.003352362,0.003284085,0.004153464,0.01008933,0.006287313,0.004591513,0.01993654],"category_scores_gemma":[0.04566629,0.002376492,0.002790578,0.003142576,0.007685971,0.02380488,0.008488449,0.008797626,0.004677365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00261808,"about_ca_system_score_gemma":0.001646517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005367824,"about_ca_topic_score_gemma":0.0006621564,"domain_scores_codex":[0.9903733,0.002435285,0.0006892183,0.002472813,0.002321033,0.001708462],"domain_scores_gemma":[0.9106205,0.07261873,0.002066479,0.008146207,0.002604587,0.003943545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001350407,0.0002861428,0.002246731,0.0006569392,0.00009830805,0.0005476353,0.0006920039,0.01354388,0.01241748,0.92493,0.009963103,0.03326743],"study_design_scores_gemma":[0.00005847786,0.00006894918,0.0005440715,0.0001083529,0.00007021814,0.0005598044,0.00008494443,0.03443425,0.004703125,0.9524022,0.006906554,0.00005901069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2214613,0.007856663,0.5816106,0.01493784,0.002643447,0.0002552106,0.002670416,0.00184215,0.1667223],"genre_scores_gemma":[0.8291588,0.003532572,0.1224226,0.002352758,0.002980266,0.000491275,0.001625671,0.001221144,0.03621483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01993654,"threshold_uncertainty_score":0.06669432,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009969578661615004,"score_gpt":0.2774593452152697,"score_spread":0.2674897665536547,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}