{"id":"W2403590840","doi":"","title":"Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009552935,0.000388377,0.0005954618,0.001341655,0.001313842,0.0025505,0.0009776698,0.001131997,0.009103213],"category_scores_gemma":[0.007978339,0.0006428479,0.0006911383,0.00126001,0.001321376,0.004538272,0.0009487735,0.0015446,0.000937057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001006796,"about_ca_system_score_gemma":0.0009043282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007917873,"about_ca_topic_score_gemma":0.001763895,"domain_scores_codex":[0.9993037,0.0002114886,0.00003629676,0.0001586772,0.0001607083,0.0001290732],"domain_scores_gemma":[0.9915583,0.005301462,0.0009160645,0.0008020396,0.0006949877,0.0007271375],"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.0002979405,0.00005760065,0.001764566,0.0001980182,0.00003792914,0.0002110725,0.0001725274,0.003848943,0.007191878,0.9564767,0.01216164,0.01758116],"study_design_scores_gemma":[0.00006330519,0.00004776996,0.003161858,0.00005913396,0.00005114344,0.0009575701,0.0001540296,0.02087734,0.003556446,0.959582,0.01146002,0.00002937039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4761719,0.004093921,0.386387,0.005776837,0.000950107,0.0001804842,0.007211378,0.001196714,0.1180317],"genre_scores_gemma":[0.8753117,0.001038583,0.1025426,0.0008510646,0.0004584667,0.0001788494,0.002268708,0.0002574736,0.01709245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009103213,"threshold_uncertainty_score":0.03045326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007807377460355607,"score_gpt":0.2340013149317196,"score_spread":0.226193937471364,"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."}}