{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005489425,0.001152446,0.001940321,0.004395446,0.001742518,0.005151846,0.002503444,0.002193115,0.01122241],"category_scores_gemma":[0.03274025,0.0005885617,0.0009436601,0.003267483,0.003311872,0.009722671,0.005797052,0.003611017,0.007053204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001702295,"about_ca_system_score_gemma":0.001733337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009724397,"about_ca_topic_score_gemma":0.001001652,"domain_scores_codex":[0.9934034,0.002349325,0.0005208805,0.001251148,0.001954067,0.0005211781],"domain_scores_gemma":[0.9806616,0.007280044,0.0009510822,0.007394329,0.003189637,0.0005232412],"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.0004539121,0.00008759081,0.001052924,0.0002215503,0.00003788263,0.000151352,0.0002508374,0.009494619,0.00667003,0.8195004,0.01264733,0.1494316],"study_design_scores_gemma":[0.00005547546,0.0001506235,0.0003525772,0.0001169109,0.00003696893,0.0004052644,0.0001034791,0.08246705,0.007794768,0.8793259,0.02913786,0.00005310166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05716825,0.005346621,0.8469154,0.003556373,0.001421861,0.0001713799,0.0008059629,0.001851244,0.08276293],"genre_scores_gemma":[0.5227104,0.003291254,0.4357877,0.002157797,0.002495808,0.0002970928,0.001524172,0.002055639,0.02968014],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01122241,"threshold_uncertainty_score":0.03754264,"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."}}