{"id":"W179471450","doi":"","title":"A new optimal algorithm for outerplanar graph testing.","year":2004,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Algorithm; Outerplanar graph; Graph; Computer science; Mathematics; Combinatorics; Pathwidth; Line graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005740215,0.0002632099,0.000344831,0.0003880616,0.0005364135,0.00009631864,0.001821317,0.0002117566,0.00001561531],"category_scores_gemma":[0.0003038991,0.0003246662,0.0002359121,0.0008731007,0.0001161246,0.0009739116,0.0005190831,0.0002997776,0.00004219622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001441575,"about_ca_system_score_gemma":0.0003111822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004332227,"about_ca_topic_score_gemma":0.00003198048,"domain_scores_codex":[0.9981415,0.00005432026,0.0002057229,0.0006643934,0.0004202104,0.0005138773],"domain_scores_gemma":[0.9980521,0.0003357774,0.0002382617,0.0007852305,0.0002742778,0.0003143885],"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.0002729532,0.0007426784,0.06239622,0.0002206242,0.0004108854,0.0005485357,0.009500352,0.001418559,0.004201678,0.0107778,0.02679071,0.882719],"study_design_scores_gemma":[0.02361466,0.006277836,0.2363541,0.002089692,0.000545379,0.001266784,0.0004933542,0.0339312,0.02423082,0.6457927,0.01963065,0.00577291],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05877715,0.0000943594,0.9360456,0.000878807,0.0001884228,0.0003164276,0.00002811801,0.003349691,0.0003213619],"genre_scores_gemma":[0.07753967,0.000003484801,0.9215582,0.0001640679,0.00007164199,0.000001069223,0.00001146445,0.00002173023,0.0006286508],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8769461,"threshold_uncertainty_score":0.9999205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02900811811539521,"score_gpt":0.2375180997442143,"score_spread":0.2085099816288191,"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."}}