{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002797039,0.00004199288,0.0000586313,0.00003475317,0.00002385774,0.00001693243,0.0001113515,0.00002701975,0.002670194],"category_scores_gemma":[0.0002107357,0.00003213784,0.00002663095,0.00006688594,0.00001265228,0.00004673436,0.00001016833,0.00008009646,0.0007122547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001032465,"about_ca_system_score_gemma":0.000008181247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001298613,"about_ca_topic_score_gemma":0.000001415824,"domain_scores_codex":[0.9995565,0.00001055622,0.00008255233,0.00007138958,0.0001368958,0.0001421363],"domain_scores_gemma":[0.9995311,0.0002009378,0.00001155422,0.0001938585,0.00002153972,0.00004096436],"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.000008388294,0.00007073725,0.00003163475,0.000006236617,0.000002834812,0.000008908406,0.00005746753,1.003156e-7,0.002940621,0.9675851,0.01692677,0.0123612],"study_design_scores_gemma":[0.0001060131,0.00003639951,0.004530179,0.00000407602,0.000001130919,0.000003018056,0.0000302906,0.00002005358,0.002577748,0.9907145,0.001923827,0.00005277996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2936228,0.0000070458,0.0005497394,0.000649977,0.00001676674,0.00006854917,4.80721e-7,0.0001304089,0.7049542],"genre_scores_gemma":[0.9857329,0.000001164942,0.006683663,0.0001881587,0.00003885686,0.000001008202,4.401924e-7,0.000005107333,0.007348775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6976054,"threshold_uncertainty_score":0.9982415,"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."}}