{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00430008,0.0001441903,0.0002424023,0.000869355,0.0006419016,0.0006687393,0.001781481,0.00008664817,0.0001229167],"category_scores_gemma":[0.0009855723,0.00009279887,0.00005448219,0.001427994,0.0002700971,0.002727694,0.0003085877,0.001077056,0.00002062758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006945004,"about_ca_system_score_gemma":0.0005712794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004004851,"about_ca_topic_score_gemma":0.0003540069,"domain_scores_codex":[0.9959069,0.001437669,0.0004774836,0.0002937733,0.001357303,0.0005269031],"domain_scores_gemma":[0.9959146,0.0007491548,0.00008857543,0.0008961968,0.002003553,0.0003478836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004280948,0.001697797,0.001354058,0.00005383852,0.0002472304,0.0001213604,0.01087704,0.01192183,0.4730525,0.3877095,0.004012693,0.1085241],"study_design_scores_gemma":[0.004893447,0.02220089,0.02567853,0.0002945553,0.0000205781,0.000527471,0.0126418,0.4291571,0.1049693,0.398215,0.0005129104,0.0008883467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9880794,0.00004114916,0.007516793,0.002950633,0.00005212987,0.0005592032,0.000003707721,0.00001110234,0.0007858899],"genre_scores_gemma":[0.9921883,0.00002797495,0.00746071,0.00007945632,0.00005148142,0.00004222691,0.000001688254,0.00001754421,0.0001306408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4172353,"threshold_uncertainty_score":0.6448669,"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."}}