{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002892863,0.0008191945,0.001431402,0.003834787,0.0009235633,0.001602688,0.001712923,0.001167909,0.003374675],"category_scores_gemma":[0.02669483,0.0008725089,0.0007264121,0.001982136,0.001805165,0.005074873,0.001614797,0.001803189,0.001070551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001484062,"about_ca_system_score_gemma":0.000832553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00413882,"about_ca_topic_score_gemma":0.003462662,"domain_scores_codex":[0.9980009,0.0007114465,0.00009954,0.0004095265,0.0005421264,0.0002364126],"domain_scores_gemma":[0.9721281,0.02250846,0.001124943,0.002405148,0.001142489,0.0006909188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002036217,0.000262025,0.04204889,0.0008261831,0.000269332,0.0003575229,0.000815466,0.4733166,0.03826911,0.1464445,0.01676011,0.278594],"study_design_scores_gemma":[0.000039825,0.00007395805,0.002262059,0.00006731511,0.0000227026,0.0002213854,0.00009926778,0.8836356,0.005456199,0.1043391,0.00375811,0.00002449271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3439096,0.004592921,0.6313341,0.002283119,0.0001233638,0.0001014095,0.001056622,0.002192166,0.01440672],"genre_scores_gemma":[0.7766128,0.001292121,0.2183488,0.0003026878,0.0001809323,0.0001318877,0.0009900235,0.0003541259,0.001786553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00413882,"threshold_uncertainty_score":0.01529914,"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."}}