{"id":"W1507564261","doi":"10.1007/978-3-540-39890-5_11","title":"A Simple Linear Time LexBFS Cograph Recognition Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lexicographical order; Simple (philosophy); Algorithm; Complement (music); Cograph; Time complexity; Graph; Theoretical computer science; Combinatorics; Mathematics; Pathwidth; Line graph","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.001630264,0.0006878654,0.0006542537,0.001761209,0.0004591125,0.000466299,0.003695019,0.0004315939,0.0001028192],"category_scores_gemma":[0.0001880935,0.000668362,0.0002448039,0.001799652,0.001307671,0.0009816716,0.001261092,0.001380094,0.0004742861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002688962,"about_ca_system_score_gemma":0.0004264485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009591406,"about_ca_topic_score_gemma":0.00001193998,"domain_scores_codex":[0.994399,0.0001285933,0.0006046038,0.002181676,0.001520801,0.001165395],"domain_scores_gemma":[0.9961638,0.0007711936,0.0002996841,0.001856919,0.0005666779,0.0003417064],"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.000006704635,0.00003786456,0.000005351858,0.0000187342,0.00001647416,0.000114607,0.0002041162,0.003070214,0.0001513074,0.002953687,0.00009668587,0.9933243],"study_design_scores_gemma":[0.0002952074,0.0002433247,0.000005856332,0.0001545551,0.000006311939,0.0001085615,1.150618e-7,0.4126272,0.001805643,0.5791411,0.004836609,0.0007754677],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002105594,0.0003889617,0.9940532,0.0002908038,0.0007608588,0.0006305533,0.00003009326,0.0003755542,0.003448851],"genre_scores_gemma":[0.001724978,0.0001243292,0.9943871,0.002382134,0.0004313463,0.00003001167,0.00003996177,0.00008544026,0.0007947316],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9925488,"threshold_uncertainty_score":0.9995767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02345618118134686,"score_gpt":0.2791666446707617,"score_spread":0.2557104634894149,"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."}}