{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003831535,0.0001037464,0.0001781169,0.00005303945,0.00002570252,0.00006970789,0.0008088047,0.00003948364,0.00005390721],"category_scores_gemma":[0.00003358581,0.00006410001,0.00009576214,0.0004508583,0.0001172294,0.0002339611,0.0002074948,0.00009554053,0.00001385956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001738086,"about_ca_system_score_gemma":0.00004422429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001640047,"about_ca_topic_score_gemma":0.000003260981,"domain_scores_codex":[0.9990929,0.00004916577,0.0003064632,0.0001686781,0.0002364398,0.0001463153],"domain_scores_gemma":[0.999033,0.0001521705,0.00007980472,0.0006886243,0.00001721918,0.00002915192],"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.000003065428,0.0001927235,0.003545677,0.0005675559,0.00002816382,0.00001686499,0.01415675,0.00002855354,0.003253778,0.9744085,0.0001993547,0.003598983],"study_design_scores_gemma":[0.0002762823,0.00008406671,0.02016399,0.001600139,0.0000360634,0.00007480798,0.002388934,0.4492408,0.005567139,0.5197349,0.0004395075,0.0003933742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9653566,0.0001461148,0.02886833,0.0002138618,0.0002650307,0.0001138058,0.00001422067,0.00006218664,0.004959873],"genre_scores_gemma":[0.9881421,0.000003810599,0.01164043,0.0000243848,0.00001378383,0.000004374131,0.00000153742,0.00001212444,0.0001574574],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4546736,"threshold_uncertainty_score":0.2613922,"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."}}