{"id":"W2623150993","doi":"10.1145/2344422.2344424","title":"All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Log-log plot; Combinatorics; Binary logarithm; Mathematics; Undirected graph; Running time; Graph; Time complexity; Discrete mathematics; Algorithm","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.001326872,0.002029974,0.001688467,0.001367461,0.001630345,0.002874159,0.002972205,0.001611815,0.01119626],"category_scores_gemma":[0.006542698,0.0009886614,0.001726112,0.00257935,0.001082552,0.01085237,0.003800526,0.001599304,0.002595754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002043786,"about_ca_system_score_gemma":0.002523328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002833813,"about_ca_topic_score_gemma":0.005155643,"domain_scores_codex":[0.9978492,0.0005181818,0.0001904631,0.0007275499,0.0004005325,0.0003140918],"domain_scores_gemma":[0.995976,0.002183121,0.000449729,0.0007837723,0.0002993813,0.0003079142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001484971,0.0006889256,0.002823205,0.003160582,0.0003460497,0.0005472637,0.001482823,0.2551612,0.02729773,0.1033095,0.04187528,0.5618225],"study_design_scores_gemma":[0.0006170223,0.0004997706,0.001263474,0.000175667,0.0002004411,0.0009190458,0.001175786,0.5218437,0.02081741,0.4162505,0.03611876,0.0001184885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1305842,0.001761309,0.8342351,0.002678525,0.0003110928,0.0009333415,0.002467419,0.005612167,0.02141673],"genre_scores_gemma":[0.2175597,0.001070348,0.7657136,0.0002910273,0.0001603732,0.0005340654,0.004014109,0.00109889,0.009557887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01119626,"threshold_uncertainty_score":0.0374552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03057676437967018,"score_gpt":0.2668495776188133,"score_spread":0.2362728132391431,"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."}}