{"id":"W2519800085","doi":"10.1007/s10801-017-0768-0","title":"A graph for which the inertia bound is not tight","year":2017,"lang":"en","type":"preprint","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Independence number; Graph; Discrete mathematics","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.002049784,0.0003592928,0.000727015,0.0002202778,0.0006843469,0.0003470715,0.00196646,0.0003814197,0.00004218569],"category_scores_gemma":[0.001381557,0.0002442012,0.0007361557,0.000222999,0.0001542018,0.0001236439,0.0004329574,0.001404108,0.000006722247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008386598,"about_ca_system_score_gemma":0.0004178194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004545339,"about_ca_topic_score_gemma":0.000007603187,"domain_scores_codex":[0.9977581,0.0001160757,0.0009819422,0.0002746236,0.0005575559,0.0003117018],"domain_scores_gemma":[0.9932601,0.001285576,0.002564328,0.001428835,0.001310526,0.0001506384],"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.00005569161,0.0003057166,0.00005739206,0.0002753279,0.0003993308,0.000004040762,0.0009136027,0.000002850676,0.00007961791,0.938554,0.05897518,0.000377222],"study_design_scores_gemma":[0.0007442667,0.0001199731,0.0003000365,0.0002315508,0.0005253991,0.00005339127,0.0000682209,0.00005526236,0.0009607124,0.969853,0.02682481,0.0002633763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9415482,0.002133864,0.01091446,0.03212867,0.007032612,0.002262205,0.000190064,0.00008804619,0.003701864],"genre_scores_gemma":[0.996326,0.000315039,0.001229896,0.0003216668,0.0004526681,0.00009210147,0.000005617475,0.00006777518,0.001189283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05477774,"threshold_uncertainty_score":0.9958234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06945843814273166,"score_gpt":0.3474304814415874,"score_spread":0.2779720432988557,"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."}}