{"id":"W2082613046","doi":"10.1002/net.10098","title":"On the power of BFS to determine a graph's diameter","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Lexicographical order; Upper and lower bounds; Graph; Mathematics; Constant (computer programming); Induced subgraph; Discrete mathematics; Algorithm; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0005474329,0.00009696354,0.000114867,0.00009669668,0.000070377,0.00003523764,0.0007775383,0.00004087262,0.0000669377],"category_scores_gemma":[0.0001915337,0.00006253103,0.00007231245,0.0007830695,0.00007197983,0.00008550735,0.0001247452,0.0001876475,0.00002919634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001058882,"about_ca_system_score_gemma":0.00001293659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001129479,"about_ca_topic_score_gemma":0.000003083429,"domain_scores_codex":[0.9988672,0.0001871511,0.000134877,0.0002441785,0.0002462261,0.0003204402],"domain_scores_gemma":[0.9982646,0.0007017748,0.00003958109,0.000846567,0.00005870366,0.00008884704],"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.00002978109,0.00006923622,0.0003647476,0.000002268303,0.0000226259,0.00001307027,0.0003614773,0.01018041,0.0002635464,0.9632272,0.004087073,0.02137856],"study_design_scores_gemma":[0.001009651,0.001993423,0.003723986,0.0001606358,0.00001234481,0.00003555678,0.00007225633,0.04633906,0.01149588,0.910816,0.02351415,0.0008270672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05150348,0.0001192568,0.9392393,0.0003887758,0.0002487946,0.0002524213,5.965861e-7,0.00003899047,0.008208379],"genre_scores_gemma":[0.9891912,0.000005307319,0.009349721,0.001191005,0.00001594573,0.0000263777,1.207021e-7,0.00000932459,0.0002109627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9376878,"threshold_uncertainty_score":0.2549942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02081870194448071,"score_gpt":0.27063153885149,"score_spread":0.2498128369070093,"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."}}