{"id":"W2401454933","doi":"","title":"Up-embeddability and independent number of simple graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); 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.0004862111,0.0004363552,0.0005368154,0.001857871,0.001406747,0.002668403,0.001009835,0.0007265893,0.01018997],"category_scores_gemma":[0.005727951,0.0004808288,0.0006059977,0.001322976,0.002713993,0.00493229,0.001900772,0.002017594,0.0009726495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000639108,"about_ca_system_score_gemma":0.0003083228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004398673,"about_ca_topic_score_gemma":0.0007273919,"domain_scores_codex":[0.9993474,0.0001389832,0.00003507868,0.0001742121,0.0001829794,0.0001213829],"domain_scores_gemma":[0.9938114,0.003563956,0.0008923666,0.0007559172,0.0003288248,0.0006475645],"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.0001628907,0.0001041389,0.003264479,0.0001457199,0.00003896397,0.0003587334,0.0004647135,0.002907942,0.004272841,0.9568275,0.003787803,0.0276644],"study_design_scores_gemma":[0.00002444748,0.00002877635,0.002515385,0.00002360646,0.00003260922,0.0004631,0.0001555432,0.005403389,0.003086812,0.9844861,0.003765014,0.00001522588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7488613,0.001425695,0.09761579,0.001606532,0.0002923049,0.00008476261,0.0008217908,0.000412819,0.1488791],"genre_scores_gemma":[0.9789601,0.0004683764,0.008087534,0.000122106,0.0001861643,0.00004224951,0.0004805342,0.00006396817,0.01158906],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01018997,"threshold_uncertainty_score":0.03408891,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02679606737701527,"score_gpt":0.2976182622539376,"score_spread":0.2708221948769223,"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."}}