{"id":"W2913061818","doi":"10.1016/j.tcs.2019.08.005","title":"Refining the r-index","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Japan Society for the Promotion of Science","keywords":"Index (typography); Computer science; Parsing; Matching (statistics); Lemma (botany); Product (mathematics); Data mining; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Programming language; Biology","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":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002668259,0.0003881325,0.0003858387,0.0001947899,0.0007205976,0.002072767,0.01293925,0.0001847683,0.0000404454],"category_scores_gemma":[0.00009103439,0.0002327262,0.0001515266,0.0008102729,0.002638767,0.0006049199,0.02636167,0.00124611,0.0002842082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009569968,"about_ca_system_score_gemma":0.00053234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002044854,"about_ca_topic_score_gemma":5.14213e-7,"domain_scores_codex":[0.9954332,0.0002040411,0.0004178103,0.001619203,0.001521651,0.0008040814],"domain_scores_gemma":[0.9946037,0.0004670228,0.0002134546,0.004199912,0.0002668622,0.000249049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003526267,0.00002589195,0.00005849222,0.00001511065,0.000005683758,0.00001019771,0.0002081673,0.00456621,0.00002302071,0.9110966,0.0004739979,0.0835131],"study_design_scores_gemma":[0.0001020721,0.00005872148,0.000978025,0.000125913,0.00000494296,0.0000261293,0.000002333438,0.8581219,0.0001691745,0.1385024,0.001588184,0.0003201267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001830293,0.0001198242,0.9846179,0.002409286,0.004490445,0.0002250174,0.000006792848,0.0003114905,0.005988918],"genre_scores_gemma":[0.8427301,0.00001044931,0.155476,0.001256149,0.0004427518,0.00001550982,0.000004041355,0.00001507566,0.00004986998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8535557,"threshold_uncertainty_score":0.9989632,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0147654139422844,"score_gpt":0.2647630129646452,"score_spread":0.2499975990223608,"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."}}