{"id":"W2407981822","doi":"","title":"Stratified sampling for even workload partitioning applied to single source shortest path algorithm","year":2015,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Workload; Shortest path problem; Algorithm; Scheduling (production processes); Parallel computing; Sampling (signal processing); Graph; Graph algorithms; Graph partition; Theoretical computer science; Distributed computing; Mathematical optimization; Mathematics","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.001229525,0.0001928079,0.0001928891,0.0002180787,0.0003282992,0.0007042747,0.0007832902,0.00004507786,3.69304e-7],"category_scores_gemma":[0.0001909315,0.000194366,0.00003700953,0.0009263519,0.00007341603,0.0006532372,0.000369912,0.0001095609,0.000005013457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006062587,"about_ca_system_score_gemma":0.0001112359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002441947,"about_ca_topic_score_gemma":4.724807e-7,"domain_scores_codex":[0.9982432,0.00001074194,0.000217716,0.0006127445,0.0003871746,0.0005283815],"domain_scores_gemma":[0.9987271,0.0002118483,0.00004212044,0.0003673669,0.0002196624,0.0004318481],"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.000003067888,0.00004216676,0.0001223029,0.00001401198,0.000009258686,0.000004211758,0.002524358,0.1716824,0.001260567,0.006509887,0.00007862802,0.8177491],"study_design_scores_gemma":[0.0002914022,0.0001870501,0.0006067531,0.0001007216,0.000004895663,0.00002213494,0.0000519041,0.9928761,0.001671675,0.00230909,0.001463164,0.0004151093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01610758,0.00008281223,0.9823508,0.00006458874,0.0006989087,0.000256532,0.000002525615,0.0004263445,0.000009907313],"genre_scores_gemma":[0.2919976,6.879794e-7,0.7075873,0.0001765207,0.0001817804,0.00003766262,0.000001416232,0.00001019132,0.000006832729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8211937,"threshold_uncertainty_score":0.7926013,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02804920754298108,"score_gpt":0.2293140820036398,"score_spread":0.2012648744606587,"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."}}