{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002480392,0.0001405436,0.0003505859,0.0003477883,0.0002031134,0.0005305294,0.001319067,0.00003012777,0.000001134578],"category_scores_gemma":[0.00001554292,0.00008310629,0.00007730765,0.0004771632,0.00008167244,0.0008744893,0.000396567,0.00006228808,0.000002420075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003536621,"about_ca_system_score_gemma":0.0000414942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004965057,"about_ca_topic_score_gemma":0.000002592057,"domain_scores_codex":[0.9982387,0.00009003166,0.0006096527,0.0003157784,0.0003814157,0.0003644519],"domain_scores_gemma":[0.9988907,0.0003573623,0.0003026809,0.0001786345,0.0001156688,0.0001549722],"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.00002116964,0.000100536,0.0225005,0.00008736339,0.00004511813,0.0001059264,0.001029656,0.02535152,0.0001397433,0.03154997,0.007303248,0.9117652],"study_design_scores_gemma":[0.000587313,0.0004638467,0.01397537,0.0004157593,0.000004252292,0.0001817729,0.000116523,0.9774188,0.000007097327,0.0003150582,0.006343533,0.000170636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01595333,0.0001259721,0.9814995,0.0009206876,0.001071763,0.0001871284,0.000001951618,0.00002891535,0.0002107329],"genre_scores_gemma":[0.7777815,0.000006639196,0.2215022,0.0002058417,0.0004711321,0.00000136068,2.427779e-7,0.000003962788,0.00002707531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9520673,"threshold_uncertainty_score":0.5115907,"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."}}