{"id":"W7099463684","doi":"","title":"Abstract","year":2009,"lang":"en","type":"article","venue":"","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Subsequence; Upper and lower bounds; Sequence (biology); Constant (computer programming); Longest increasing subsequence; Longest common subsequence problem","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008628088,0.0008669845,0.0007577108,0.001240876,0.002030882,0.003370455,0.001553437,0.001303884,0.1350097],"category_scores_gemma":[0.004117018,0.0002815725,0.0007857176,0.001666333,0.001319683,0.003515295,0.002970209,0.001631364,0.06398041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001615305,"about_ca_system_score_gemma":0.00146515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001331839,"about_ca_topic_score_gemma":0.001288768,"domain_scores_codex":[0.9985477,0.0001969486,0.0001107537,0.0006096049,0.0003821942,0.0001527586],"domain_scores_gemma":[0.9977525,0.000343275,0.0001961086,0.0006904855,0.0006925589,0.0003250806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005373039,0.0001289593,0.002304981,0.0005904687,0.00006213732,0.0004813175,0.0006273526,0.002713347,0.004879285,0.4861631,0.2245637,0.2769481],"study_design_scores_gemma":[0.00002668833,0.00008916478,0.001268144,0.0001570494,0.00002368838,0.0005859055,0.0001973993,0.002351024,0.002487306,0.1664122,0.8263685,0.00003298257],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.03259191,0.01168645,0.1779666,0.01398164,0.01122603,0.00044293,0.009913993,0.00357841,0.7386119],"genre_scores_gemma":[0.3337156,0.005984539,0.05855719,0.004354363,0.003424973,0.0004377876,0.01225095,0.00108661,0.580188],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8649904,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1286965035062652,"score_gpt":0.403103273852178,"score_spread":0.2744067703459129,"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."}}