{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627275,0.0001776783,0.0002053486,0.0006472078,0.0001679063,0.00008229475,0.001355759,0.00008722166,0.00000729787],"category_scores_gemma":[0.00008359399,0.0001728688,0.00007124736,0.00205339,0.0001318128,0.0004961222,0.0006700232,0.0003138418,0.000004037482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000253509,"about_ca_system_score_gemma":0.00002841798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005789159,"about_ca_topic_score_gemma":0.00001225026,"domain_scores_codex":[0.9983913,0.00008618096,0.0002258326,0.0004684457,0.000307813,0.0005204078],"domain_scores_gemma":[0.9987805,0.0001145429,0.0000648631,0.0008027187,0.00006872576,0.0001685981],"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.000009121949,0.00009248777,0.03580467,0.00001267169,0.000007463188,0.00005285062,0.0006346377,5.889792e-7,0.00009918202,0.9598376,0.00006247008,0.003386302],"study_design_scores_gemma":[0.0006789148,0.0001470378,0.02609956,0.00002109189,0.000002302715,0.00001568987,0.00005230939,0.0004551935,0.0006921561,0.9714168,0.0002081164,0.0002108219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9655979,0.001221927,0.02557943,0.0001231771,0.000538346,0.0002845036,0.000002802472,0.0002386957,0.006413213],"genre_scores_gemma":[0.9917524,0.0002279999,0.007842125,0.00006074486,0.000002931801,0.00002789796,4.112912e-7,0.00001353937,0.00007193681],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0261545,"threshold_uncertainty_score":0.7049387,"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."}}