{"id":"W2147365795","doi":"10.1007/s00373-011-1047-9","title":"Finding a Sun in Building-Free Graphs","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Experimental Program to Stimulate Competitive Research; National Security Agency; National Science Foundation","keywords":"Combinatorics; Indifference graph; Mathematics; Chordal graph; Pathwidth; Cograph; Discrete mathematics; Clique-sum; Split graph; Vertex (graph theory); Graph product; Maximal independent set; 1-planar graph; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.0007158936,0.0006822547,0.001143952,0.0011383,0.003474737,0.0022577,0.001627802,0.001960251,0.009668837],"category_scores_gemma":[0.0038682,0.001196905,0.001258532,0.001529223,0.003007347,0.007860313,0.003767394,0.002879461,0.00167735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009118466,"about_ca_system_score_gemma":0.0007746794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673689,"about_ca_topic_score_gemma":0.004238213,"domain_scores_codex":[0.9993278,0.0001420398,0.00003403265,0.0002490907,0.0001003303,0.0001466879],"domain_scores_gemma":[0.9971836,0.001433485,0.0002036197,0.0006268353,0.0001770589,0.0003754262],"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.0005517349,0.0003078239,0.006990321,0.0007219388,0.0001069625,0.0008508811,0.002791651,0.02524864,0.01050232,0.7900138,0.01756782,0.144346],"study_design_scores_gemma":[0.00002728254,0.00005935392,0.0005674834,0.00005172752,0.00004626237,0.0002670037,0.0007104044,0.01635283,0.004503888,0.9692652,0.008129333,0.00001914561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5774451,0.001201882,0.3371426,0.003831894,0.0003226121,0.0001793006,0.0005795074,0.002300523,0.07699648],"genre_scores_gemma":[0.8236811,0.0004454128,0.1535341,0.0004442381,0.00007600315,0.00007958669,0.0006340803,0.0005178768,0.02058761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009668837,"threshold_uncertainty_score":0.03234547,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03634612366228012,"score_gpt":0.2687520286940016,"score_spread":0.2324059050317214,"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."}}