{"id":"W2019497371","doi":"10.1016/j.jda.2009.01.002","title":"On the Ehrenfeucht–Mycielski sequence","year":2009,"lang":"pl","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Upper and lower bounds; Combinatorics; Ackermann function; Prefix; Mathematics; Sequence (biology); Suffix; Discrete mathematics; Inverse","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.001820407,0.0005258262,0.0006778835,0.0002599886,0.000562083,0.0009067985,0.003638119,0.0002139521,0.0002225335],"category_scores_gemma":[0.0003437356,0.0003015606,0.0005423505,0.0008073677,0.0002034223,0.001605351,0.0003563242,0.001467477,0.0001623368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001593516,"about_ca_system_score_gemma":0.000435903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001903207,"about_ca_topic_score_gemma":0.000001219394,"domain_scores_codex":[0.9952005,0.0004044834,0.001254387,0.0005408797,0.00183389,0.0007659254],"domain_scores_gemma":[0.9956122,0.0006555471,0.001419961,0.001338751,0.0005097773,0.0004637388],"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.0001923959,0.0006596881,0.00003453921,0.00002026372,0.0002302263,0.001330963,0.00196314,0.001002937,0.001880065,0.08427198,0.09437799,0.8140358],"study_design_scores_gemma":[0.004340758,0.01401223,0.007180933,0.003801953,0.0003992274,0.003558742,0.0004832286,0.5932087,0.006549164,0.2790938,0.0849793,0.002391961],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01532655,0.01010201,0.8919877,0.0654693,0.008601577,0.0007533466,0.0001832141,0.0001101029,0.007466215],"genre_scores_gemma":[0.9125152,0.002440588,0.07026702,0.008935018,0.003865085,0.000004256504,0.00001323259,0.00005847205,0.001901149],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8971886,"threshold_uncertainty_score":0.9999437,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03914521642632646,"score_gpt":0.3010556464635271,"score_spread":0.2619104300372007,"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."}}