{"id":"W2117946984","doi":"10.5555/1109557.1109614","title":"All-pairs shortest paths for unweighted undirected graphs in o(mn) time","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Undirected graph; Mathematics; Graph; Discrete mathematics","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.0003408077,0.0001911675,0.000227078,0.0003217665,0.0001062161,0.0001349212,0.0007954757,0.00008518482,0.00008231095],"category_scores_gemma":[0.0000211237,0.0001781225,0.0001345901,0.001117818,0.0000646485,0.0003199856,0.0001477475,0.0001157109,0.000056645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003846786,"about_ca_system_score_gemma":0.00004297143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003294788,"about_ca_topic_score_gemma":0.0005455383,"domain_scores_codex":[0.9984124,0.00006533333,0.0003355916,0.0004966218,0.0002266161,0.000463444],"domain_scores_gemma":[0.9990553,0.0002504637,0.00005612401,0.0004803989,0.0000817253,0.00007603754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001683456,0.0007945734,0.003491906,0.00001840112,0.00004925536,0.00005751691,0.000244208,0.0001876974,0.001959175,0.9197896,0.03086262,0.04252823],"study_design_scores_gemma":[0.00141962,0.000201632,0.04634897,0.00003800733,0.00001381206,0.00001998151,0.0000171576,0.5061801,0.003698402,0.4144643,0.02682955,0.0007684978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1000686,0.0002915787,0.839956,0.002849222,0.001005623,0.00157703,0.00005811148,0.002392442,0.05180134],"genre_scores_gemma":[0.7168825,0.0000115498,0.2784999,0.0008380298,0.0001360374,0.0001315133,0.0001380193,0.00003271954,0.003329665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6168139,"threshold_uncertainty_score":0.7263626,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560847232180834,"score_gpt":0.2342218529718607,"score_spread":0.2186133806500523,"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."}}