{"id":"W2155865206","doi":"10.1017/s0963548307008905","title":"Induced Forests in Regular Graphs with Large Girth","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Upper and lower bounds; Random regular graph; Random graph; Graph; Discrete mathematics; Line graph; Pathwidth","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001868201,0.000307478,0.0004192483,0.0004007543,0.0005028598,0.00007724794,0.001720428,0.0001301914,0.000002077291],"category_scores_gemma":[0.0003468798,0.0002855872,0.00009314506,0.003407986,0.0002064643,0.0006333402,0.001020139,0.0007389497,0.00001133188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000267389,"about_ca_system_score_gemma":0.0002595781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002026223,"about_ca_topic_score_gemma":0.00005355501,"domain_scores_codex":[0.9962868,0.0004132626,0.0004982341,0.001003716,0.0007743304,0.001023666],"domain_scores_gemma":[0.9973347,0.0004109188,0.0001709175,0.001497638,0.0003606026,0.0002252709],"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.00002124839,0.0004470347,0.3148375,0.00004898432,0.00001003129,0.0001283577,0.0009297525,0.0004606285,0.0000720165,0.681603,0.00001277573,0.001428681],"study_design_scores_gemma":[0.001687718,0.0003559034,0.1376394,0.00006804663,0.000001859194,0.00008050857,0.00002761927,0.03184645,0.0009132,0.8268795,0.00007898298,0.0004207897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8422531,0.0000928011,0.1558525,0.0001531808,0.0001921426,0.0006327897,7.115689e-7,0.0003070617,0.0005157246],"genre_scores_gemma":[0.9846421,0.000004856844,0.01521498,0.00005087719,0.00001448284,0.00002107814,0.000002340905,0.00002536807,0.00002393503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1771981,"threshold_uncertainty_score":0.9999596,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03350324420973928,"score_gpt":0.271821734146239,"score_spread":0.2383184899364997,"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."}}