{"id":"W4405812762","doi":"10.37236/12464","title":"The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Repetition (rhetorical device); Binary number; Word (group theory); Arithmetic; Mathematics; Computer science; Combinatorics; Linguistics; Philosophy","routes":{"ca_aff":true,"ca_fund":true,"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.0003107139,0.0004088068,0.0005072271,0.0008863351,0.0009536162,0.001698765,0.0004468509,0.0008162915,0.006756606],"category_scores_gemma":[0.00290714,0.0003321733,0.0003719788,0.0005782042,0.001507892,0.00211336,0.001340868,0.0007969486,0.002462967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004888211,"about_ca_system_score_gemma":0.0005763532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000359238,"about_ca_topic_score_gemma":0.0006079407,"domain_scores_codex":[0.9994491,0.000102586,0.00005832903,0.0001413048,0.0001157636,0.0001328907],"domain_scores_gemma":[0.9986046,0.0006371903,0.0001995047,0.0001816231,0.0002108561,0.0001662463],"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.0005813354,0.00007986302,0.002057815,0.0004431901,0.00003434663,0.001073968,0.00114187,0.006693983,0.1170028,0.8116349,0.006079539,0.05317638],"study_design_scores_gemma":[0.00006486658,0.0002570048,0.001424677,0.0001192853,0.00005183188,0.001594464,0.0005287384,0.02456799,0.04940911,0.9035307,0.01834149,0.0001098225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7073993,0.0009202714,0.1984844,0.001496176,0.0001785023,0.00009229682,0.001454253,0.001531665,0.08844301],"genre_scores_gemma":[0.8961159,0.0003312815,0.08803041,0.0004308815,0.0001439004,0.0001413924,0.0006996306,0.0003369914,0.01376972],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006756606,"threshold_uncertainty_score":0.02260309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006386845421117536,"score_gpt":0.2480725838089225,"score_spread":0.2416857383878049,"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."}}