{"id":"W1975847110","doi":"10.2298/yjor130402037h","title":"On the maximum orders of an induced forest, an induced tree, and a stable set","year":2013,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Tree (set theory); Integer (computer science); Order (exchange); Upper and lower bounds; Set (abstract data type); Stability (learning theory); Discrete mathematics; Computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268178,0.0009922175,0.001170362,0.0028909,0.001890393,0.003643111,0.001558759,0.0009069074,0.006077562],"category_scores_gemma":[0.01304951,0.0008795815,0.0007596398,0.001955675,0.002929952,0.008089023,0.001764851,0.00197411,0.0008421262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002902214,"about_ca_system_score_gemma":0.001340043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002561455,"about_ca_topic_score_gemma":0.004254316,"domain_scores_codex":[0.9986143,0.0003409963,0.00007414314,0.0002598313,0.0003533225,0.0003573733],"domain_scores_gemma":[0.9718679,0.02142694,0.002040619,0.001290941,0.00123158,0.002142094],"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.001630883,0.0003496441,0.01040104,0.0004858844,0.000088972,0.0004299138,0.001328062,0.08061583,0.01194159,0.8307186,0.008020554,0.05398901],"study_design_scores_gemma":[0.0001271149,0.000388156,0.007299026,0.0001715102,0.0001102117,0.0007346527,0.0006605528,0.1755797,0.007507216,0.7988343,0.008499715,0.00008771084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7577589,0.003028191,0.1596635,0.00274119,0.0001597811,0.0001245316,0.002064,0.0004493883,0.07401051],"genre_scores_gemma":[0.9365495,0.001875324,0.04940726,0.0002373974,0.0003850663,0.0001736777,0.001524725,0.0002405238,0.009606641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006077562,"threshold_uncertainty_score":0.02105713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1236571809826586,"score_gpt":0.400127747145303,"score_spread":0.2764705661626444,"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."}}