{"id":"W2531121659","doi":"10.1016/j.jcss.2016.09.011","title":"Computing source-to-target shortest paths for complex networks in RDBMS","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Relational database management system; Shortest path problem; Theoretical computer science; Distributed computing; Parallel computing; Relational database; Database; Graph","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.001943294,0.0009370686,0.001426022,0.001613858,0.001249845,0.002847363,0.002421481,0.001496087,0.005488642],"category_scores_gemma":[0.01155626,0.0008043821,0.0008262155,0.002673684,0.0007781917,0.004306725,0.001953486,0.001113133,0.0009602165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002208082,"about_ca_system_score_gemma":0.002784278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01489253,"about_ca_topic_score_gemma":0.02289669,"domain_scores_codex":[0.9988528,0.0002596811,0.0001226563,0.000307113,0.000305008,0.0001526462],"domain_scores_gemma":[0.9955485,0.002622144,0.0002860994,0.0008333462,0.000441459,0.0002683672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006929119,0.0002175351,0.004113751,0.0003865992,0.0001450401,0.0001389587,0.0003790143,0.8417463,0.005040603,0.01876345,0.006360381,0.1220155],"study_design_scores_gemma":[0.00002328442,0.0000286004,0.0002415635,0.000008417801,0.00001341763,0.00002167749,0.00007119083,0.9800352,0.001151588,0.01771802,0.0006811075,0.000005779685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3495492,0.001236159,0.6306647,0.001276127,0.0001935531,0.0003031284,0.002724775,0.007166172,0.006886154],"genre_scores_gemma":[0.5787627,0.0003580594,0.4143321,0.000133028,0.00006581422,0.0001627354,0.002476737,0.0004439552,0.003264945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01489253,"threshold_uncertainty_score":0.02961165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02856876478531118,"score_gpt":0.2616750358609549,"score_spread":0.2331062710756437,"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."}}