{"id":"W2401458535","doi":"","title":"Quasi-tree graphs with the second largest number of maximal independent sets.","year":2010,"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.0007173322,0.0003361593,0.0005948693,0.001081259,0.001331836,0.002463206,0.0008896005,0.001124487,0.009705295],"category_scores_gemma":[0.004773498,0.0005760533,0.0005542345,0.001089608,0.001052889,0.003636652,0.0009040414,0.001278149,0.001156293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008646618,"about_ca_system_score_gemma":0.0008014975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006872824,"about_ca_topic_score_gemma":0.001631441,"domain_scores_codex":[0.9994791,0.0001442217,0.00002826256,0.0001187823,0.0001190849,0.0001106892],"domain_scores_gemma":[0.9945055,0.003091142,0.0006522856,0.0006498442,0.0005053931,0.0005958547],"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.0003010881,0.00007601462,0.002180277,0.0002174113,0.00004962108,0.0003773929,0.0001920436,0.002971984,0.01293885,0.9492455,0.01359747,0.01785224],"study_design_scores_gemma":[0.000081148,0.00006510639,0.004102668,0.00006298291,0.00007117812,0.001466108,0.0002122969,0.01993991,0.005675643,0.9524505,0.0158413,0.00003114136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5754211,0.002695558,0.2918413,0.004546233,0.0006672152,0.000190675,0.00714433,0.001219278,0.1162742],"genre_scores_gemma":[0.9007427,0.0007435238,0.07418035,0.0007525362,0.0002969565,0.0001506531,0.002736085,0.0002468125,0.02015035],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009705295,"threshold_uncertainty_score":0.03246748,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009570758433077683,"score_gpt":0.2655886262805301,"score_spread":0.2560178678474524,"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."}}