{"id":"W2086340885","doi":"10.1016/j.jda.2011.08.005","title":"On the structure of run-maximal strings","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Property (philosophy); Combinatorics; Cover (algebra); Mathematics; Compression (physics); String searching algorithm; Computer science; Algorithm; Data structure; Discrete mathematics; Physics; Engineering","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.000316949,0.0001506275,0.0002544974,0.000116982,0.00009850535,0.00005910699,0.001584026,0.00006346333,0.0001259504],"category_scores_gemma":[0.00006844503,0.00007916504,0.0001554492,0.0002440237,0.00007622793,0.0006202717,0.0002811434,0.0003707662,0.000004667814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000020157,"about_ca_system_score_gemma":0.00007389041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002871731,"about_ca_topic_score_gemma":9.386404e-7,"domain_scores_codex":[0.9984941,0.00007438166,0.0004728885,0.0001627652,0.0005893483,0.0002064892],"domain_scores_gemma":[0.9984258,0.0001317153,0.0006161821,0.0005185269,0.0001987139,0.0001090359],"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.0006105165,0.000915949,0.001521871,0.0001021296,0.0008294666,0.0005927508,0.0136717,0.0004830263,0.03601209,0.4636509,0.02822095,0.4533886],"study_design_scores_gemma":[0.005514879,0.009398552,0.05936595,0.001402174,0.0002503538,0.001599719,0.001390492,0.1223912,0.3849043,0.4004799,0.01148007,0.001822394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2111316,0.0004817508,0.7839696,0.0007859645,0.001523571,0.0001933492,0.00007360035,0.00003242753,0.001808108],"genre_scores_gemma":[0.9007943,0.0000366973,0.09878752,0.0001518866,0.0001841951,3.21509e-7,0.000001080993,0.00001005739,0.00003390629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6896627,"threshold_uncertainty_score":0.3228256,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02079478762518111,"score_gpt":0.2360137644056544,"score_spread":0.2152189767804733,"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."}}