{"id":"W2031219522","doi":"10.2991/cse.2013.26","title":"Task Level Parallelization of All Pair Shortest Path Algorithm in OpenMP 3.0","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Parallel computing; Task (project management); Shortest path problem; Path (computing); Algorithm; Theoretical computer science; Operating system; Graph; Engineering","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.0003086403,0.000111583,0.0001555542,0.0001134821,0.00002823494,0.0000631198,0.0006380737,0.00005332023,0.0001130645],"category_scores_gemma":[0.0000172324,0.00009215042,0.00004487282,0.0003886281,0.00003750248,0.0007139312,0.0001640312,0.00007594672,0.00008963567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001102227,"about_ca_system_score_gemma":0.00002619979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003369706,"about_ca_topic_score_gemma":0.00001743698,"domain_scores_codex":[0.9989752,0.00007961775,0.0002773281,0.0002686847,0.0001767,0.0002224386],"domain_scores_gemma":[0.9993587,0.00005845458,0.0000637772,0.0003692483,0.00008143918,0.00006841646],"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.000003048254,0.0005952026,0.0092055,0.00001809087,0.00003786476,0.00002805671,0.00236738,0.001082396,0.002871242,0.3476014,0.003690239,0.6324996],"study_design_scores_gemma":[0.0006230299,0.0001580806,0.04887641,0.00003439246,0.000003841251,0.00001171733,0.00015507,0.8297681,0.002734064,0.1165327,0.0007533288,0.0003492425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01557876,0.00003748015,0.9811448,0.0004671656,0.0001316828,0.0002556998,0.000003890955,0.00007242357,0.002308126],"genre_scores_gemma":[0.8167596,0.00001113133,0.1821667,0.0004062982,0.0000176826,0.00002970163,0.000008273729,0.000006103487,0.0005945134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8286858,"threshold_uncertainty_score":0.3757785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02443955077098859,"score_gpt":0.2332819620227585,"score_spread":0.2088424112517699,"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."}}