{"id":"W2599540576","doi":"10.1002/jgt.20344","title":"Average distance and maximum induced forest","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Graph; Conjecture; Bipartite graph; Bound graph; Path graph; Order (exchange); Discrete mathematics; Graph power; Line graph","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.001313225,0.0001388788,0.0002483639,0.0003863272,0.0002331,0.00005237486,0.0009084939,0.00005604975,0.00001053361],"category_scores_gemma":[0.0001826847,0.0001093667,0.0001345736,0.0005366575,0.0002892735,0.0008805166,0.000174093,0.0004407441,0.00000540858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002546981,"about_ca_system_score_gemma":0.00007313589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.737887e-7,"about_ca_topic_score_gemma":0.000001850349,"domain_scores_codex":[0.9984312,0.0002710689,0.0003494114,0.0001934602,0.0004517684,0.0003030596],"domain_scores_gemma":[0.9985384,0.0003921443,0.000268911,0.00039292,0.0001970286,0.0002105793],"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.000243604,0.00009713078,0.007598806,0.00001762797,0.00006371917,0.0007824332,0.001184905,0.0001475252,0.002798185,0.9676069,0.0001916679,0.0192675],"study_design_scores_gemma":[0.0006221809,0.0002903764,0.01180825,0.0000374036,0.000003773907,0.001368785,0.00004893785,0.0001873329,0.001194019,0.9835086,0.0007851169,0.00014517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4304431,0.000935779,0.5672866,0.0001877272,0.0002020321,0.00006205796,9.108365e-7,0.00002129704,0.0008605508],"genre_scores_gemma":[0.9914749,0.0003983898,0.007748186,0.0001475441,0.00006726362,0.000001741367,1.200123e-7,0.00001211602,0.0001497237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5610318,"threshold_uncertainty_score":0.4459847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02272741783119209,"score_gpt":0.2674605634724172,"score_spread":0.2447331456412251,"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."}}