{"id":"W1597703390","doi":"10.1007/11604686_18","title":"Ultimate Generalizations of LexBFS and LEX M","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Chordal graph; Graph; Combinatorics; Set (abstract data type); Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008138717,0.0003424949,0.0004212852,0.0009606571,0.00019331,0.0002022363,0.00231493,0.0001848757,0.00002229061],"category_scores_gemma":[0.0001204423,0.0003168588,0.0000751053,0.0006900243,0.00140187,0.0006331095,0.00144043,0.0004420084,0.00001195067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001063729,"about_ca_system_score_gemma":0.0003035458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008591444,"about_ca_topic_score_gemma":0.00003921679,"domain_scores_codex":[0.9971626,0.00004769763,0.0004257114,0.001072281,0.0007803622,0.0005113483],"domain_scores_gemma":[0.997664,0.0005327037,0.000218119,0.001150721,0.000279381,0.0001551297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006142202,0.00002196107,0.00005072884,0.00004191559,0.00001044295,0.00002174404,0.0006957575,0.07147395,0.001154244,0.2992024,0.000008049207,0.6273127],"study_design_scores_gemma":[0.0002428708,0.0001190287,0.0001498492,0.0001942891,0.000004770528,0.00008254359,1.315232e-7,0.4898001,0.002892535,0.5050582,0.0009874129,0.0004682491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000104463,0.0007961632,0.9942853,0.0004547303,0.0002999698,0.000273173,0.000007687634,0.00007961449,0.003698835],"genre_scores_gemma":[0.09341641,0.0002714622,0.9047268,0.0005467199,0.0002286817,0.000007960203,0.000004366531,0.00003656362,0.0007610223],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6268445,"threshold_uncertainty_score":0.9999284,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02324736625080393,"score_gpt":0.2896899513063959,"score_spread":0.266442585055592,"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."}}