{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007055121,0.0003535489,0.0006717847,0.001902712,0.001097629,0.001157914,0.001352224,0.0006978987,0.004074665],"category_scores_gemma":[0.006613037,0.0003307554,0.0003423103,0.001588387,0.001286955,0.002819092,0.001030001,0.0009076149,0.0005148781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001407999,"about_ca_system_score_gemma":0.0004164806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009910407,"about_ca_topic_score_gemma":0.001278876,"domain_scores_codex":[0.9992067,0.0001678949,0.00003244085,0.0002367477,0.0001891243,0.0001671026],"domain_scores_gemma":[0.9920543,0.004562202,0.001076589,0.0006907103,0.0007421004,0.0008740785],"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.001013754,0.0003045994,0.02358073,0.0005954793,0.0001541681,0.0004127247,0.000827258,0.193102,0.02045544,0.657397,0.01094775,0.09120899],"study_design_scores_gemma":[0.00006180978,0.0002193421,0.008030124,0.00004009722,0.00005808485,0.001006788,0.0002487867,0.2271788,0.008335516,0.7474336,0.007341759,0.00004534623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.789491,0.001382665,0.1836597,0.0007578436,0.00005421327,0.00005037148,0.0009059554,0.0004461255,0.02325214],"genre_scores_gemma":[0.9759105,0.0002235377,0.02129948,0.00006820571,0.00005139754,0.00003471442,0.0004200666,0.00006437112,0.001927699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004074665,"threshold_uncertainty_score":0.01363111,"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."}}