{"id":"W2087402722","doi":"10.1007/978-3-642-31606-7_16","title":"Automatic Theorem-Proving in Combinatorics on Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Combinatorics on words; Computer science; Automaton; Function (biology); Combinatorics; Computation; Discrete mathematics; Extremal combinatorics; Algorithm; Mathematics; Theoretical computer science; Word (group theory); Programming language","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002109795,0.000641082,0.0006582243,0.001293522,0.0001971785,0.0005200974,0.004274307,0.0003808712,0.00005133767],"category_scores_gemma":[0.000141428,0.0005586326,0.0001345988,0.0009726186,0.0005305105,0.0007781627,0.001504726,0.001171679,0.000128973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005805534,"about_ca_system_score_gemma":0.0003595993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001792863,"about_ca_topic_score_gemma":0.0000217697,"domain_scores_codex":[0.9957533,0.0000851469,0.0006331262,0.001369625,0.001144886,0.001013912],"domain_scores_gemma":[0.9964769,0.001048138,0.0003245877,0.001858811,0.00008524586,0.0002063392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001997844,0.00005451053,0.00008246871,0.00003576139,0.000003948371,0.00006329798,0.0009195184,0.001629235,0.00002504226,0.3510508,0.000007630353,0.6461259],"study_design_scores_gemma":[0.00025566,0.0001243481,0.0003572071,0.0006907714,0.00000399256,0.00003762464,3.435842e-7,0.4474359,0.000405451,0.5497663,0.0003160461,0.0006064064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001636124,0.0008408342,0.9860671,0.0004389207,0.002963262,0.0004419532,0.000002419558,0.0003466416,0.007262758],"genre_scores_gemma":[0.9211064,0.00004675729,0.07634886,0.001823468,0.0003849788,0.00001600967,0.000003280685,0.00005941015,0.0002108516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9194703,"threshold_uncertainty_score":0.9996865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0130593615674536,"score_gpt":0.2308174175266998,"score_spread":0.2177580559592462,"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."}}