{"id":"W2083976285","doi":"10.1007/s00373-007-0706-3","title":"An O(n3)-Time Recognition Algorithm for hhds-free Graphs","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Split graph; Indifference graph; Pathwidth; Mathematics; Time complexity; Discrete mathematics; Maximal independent set; Interval graph; Graph; 1-planar graph; 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":[],"consensus_categories":[],"category_scores_codex":[0.00136457,0.0002173422,0.0002257922,0.0004733088,0.0003993217,0.0001786336,0.001074965,0.0001322665,0.000004742697],"category_scores_gemma":[0.00006775375,0.0002166558,0.0001152851,0.001317983,0.0001409055,0.0007585107,0.0002083164,0.0002098831,0.00001107974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002796427,"about_ca_system_score_gemma":0.00003015983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008773985,"about_ca_topic_score_gemma":0.000003345981,"domain_scores_codex":[0.9980308,0.00007051252,0.0002767995,0.0005855532,0.0003988878,0.0006374777],"domain_scores_gemma":[0.9980622,0.0003090666,0.00009468226,0.0008666424,0.0003330397,0.0003343717],"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.00001992793,0.0001785381,0.0001765665,0.00001350067,0.00001808542,0.00001367423,0.0001272117,6.799917e-7,0.0003777792,0.5990192,0.0005041628,0.3995506],"study_design_scores_gemma":[0.001225957,0.0006964791,0.0007648417,0.00001178113,0.000009287775,0.00001682642,0.00004916339,0.01133946,0.002115618,0.9823195,0.001137497,0.0003136308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0723187,0.0005151814,0.9241793,0.0001441627,0.000590369,0.0006226223,0.00004269592,0.0005520189,0.001035023],"genre_scores_gemma":[0.6642601,0.0005139482,0.3336072,0.0006245571,0.0001003127,0.0001966625,0.0001051004,0.0001065234,0.0004855504],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5919414,"threshold_uncertainty_score":0.8834967,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01891511058609866,"score_gpt":0.2779508647299208,"score_spread":0.2590357541438221,"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."}}