{"id":"W34504510","doi":"10.1007/978-3-319-15612-5_24","title":"Non-repetitive Strings over Alphabet Lists","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Alphabet; Computer science; Generality; Extension (predicate logic); Combinatorics on words; Symbol (formal); Word (group theory); Combinatorics; Algorithm; Discrete mathematics; Theoretical computer science; Mathematics; Linguistics; 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.0009407384,0.0006456447,0.0006214055,0.0006968863,0.0002465203,0.0007803707,0.00465212,0.0003835986,0.00005756441],"category_scores_gemma":[0.0000753946,0.0005592461,0.0001347017,0.0005786192,0.0005885267,0.00135187,0.00399025,0.000955791,0.0001225616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004100587,"about_ca_system_score_gemma":0.0008473039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008220918,"about_ca_topic_score_gemma":0.00003844456,"domain_scores_codex":[0.9950328,0.00002319047,0.0005234182,0.002007364,0.001628777,0.0007844901],"domain_scores_gemma":[0.9965503,0.0002563477,0.0003479949,0.002040094,0.0004363476,0.0003689225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001320284,0.00006821373,0.0001107784,0.0000452199,0.00002214149,0.0003920123,0.001042746,0.007797536,0.0001503782,0.02612457,0.001841254,0.962392],"study_design_scores_gemma":[0.0008529486,0.0004109224,0.0007436923,0.001073706,0.00001436672,0.0001175542,2.346163e-7,0.765789,0.001215078,0.1871493,0.04099372,0.001639523],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009392569,0.0005402301,0.9882848,0.0002966254,0.002444632,0.0003522073,0.00002637012,0.0001771934,0.007784066],"genre_scores_gemma":[0.09275829,0.0001399388,0.8974917,0.003217804,0.002618336,0.00002584794,0.00006979318,0.0001305944,0.003547678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9607524,"threshold_uncertainty_score":0.9996859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.019235466901797,"score_gpt":0.2639828081775495,"score_spread":0.2447473412757525,"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."}}