{"id":"W1537431299","doi":"10.1007/11775096_25","title":"Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Multiset; Graph; Mathematics; Partition (number theory); Discrete mathematics; Time complexity; Split graph; Computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002530369,0.0005081831,0.0008118052,0.001128693,0.0009032734,0.00180084,0.001214436,0.001065525,0.005452731],"category_scores_gemma":[0.002867854,0.0005332027,0.0006177671,0.001691244,0.0008741873,0.003600699,0.00113113,0.0009694286,0.001220463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000625325,"about_ca_system_score_gemma":0.0005265027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243772,"about_ca_topic_score_gemma":0.002286243,"domain_scores_codex":[0.9994925,0.00006070824,0.00003348241,0.0002203448,0.0001030591,0.00008988506],"domain_scores_gemma":[0.997852,0.0007307917,0.0003179855,0.0006305451,0.0002897094,0.0001791593],"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.001113162,0.000510855,0.01381414,0.0008333044,0.00009651434,0.001358923,0.00186902,0.05786791,0.1104208,0.3511965,0.01929701,0.4416218],"study_design_scores_gemma":[0.00007003367,0.0002333601,0.009647669,0.0001159399,0.00008904601,0.001920968,0.00162707,0.3007316,0.06344324,0.595466,0.02657438,0.0000807546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.450034,0.0003907771,0.5279649,0.0003782243,0.00009092163,0.0001768912,0.001605977,0.002677774,0.01668043],"genre_scores_gemma":[0.7591391,0.0003030343,0.2232096,0.0001850102,0.00005985916,0.0001678352,0.005477027,0.0006865175,0.0107721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005452731,"threshold_uncertainty_score":0.01824117,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01957777178828869,"score_gpt":0.2545518202272691,"score_spread":0.2349740484389804,"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."}}