{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007106406,0.0003972067,0.0004023856,0.0005798371,0.0003410323,0.0001316888,0.001502159,0.0002033525,0.000101999],"category_scores_gemma":[0.00004443816,0.0004047083,0.0003258774,0.001755244,0.0001219446,0.000957133,0.00003894171,0.0004569858,0.0001429826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001084156,"about_ca_system_score_gemma":0.00006680225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007117294,"about_ca_topic_score_gemma":0.00004974103,"domain_scores_codex":[0.9972229,0.000168982,0.0005136284,0.0006630523,0.0004410378,0.000990403],"domain_scores_gemma":[0.9974713,0.000686678,0.0001010771,0.001300728,0.0001124294,0.000327823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006700149,0.003592111,0.0003422367,0.00004027607,0.0003019641,0.00002733651,0.002219144,0.0005304038,0.001311576,0.01178194,0.002296293,0.9774897],"study_design_scores_gemma":[0.0130897,0.002523761,0.02519381,0.0005064725,0.0004672818,0.0004469738,0.000485547,0.5605665,0.05415698,0.1533876,0.1825618,0.006613622],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003693816,0.0002366403,0.9906369,0.001379979,0.001560549,0.0008104879,0.0001514615,0.0007793518,0.0007508402],"genre_scores_gemma":[0.407741,0.0001894298,0.5881047,0.002141423,0.000249194,0.0006654902,0.0001015162,0.00009872697,0.0007085243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9708761,"threshold_uncertainty_score":0.9998405,"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."}}