{"id":"W2896168333","doi":"10.1177/1094342018803672","title":"New BSP/CGM algorithms for spanning trees","year":2018,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Spanning tree; Parallel algorithm; Algorithm; Graph; Computation; Bulk synchronous parallel; Ranking (information retrieval); Theoretical computer science; Parallel computing; Mathematics; Artificial intelligence; Combinatorics","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.0009285019,0.0001141717,0.0001440239,0.000220175,0.0004117261,0.0002007586,0.003421845,0.00003119605,0.00001103859],"category_scores_gemma":[0.00005991341,0.00008382603,0.00009138182,0.000362689,0.0001324533,0.000465299,0.0003568137,0.0002335863,0.00003351202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008462205,"about_ca_system_score_gemma":0.0001910238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001173722,"about_ca_topic_score_gemma":0.000002768692,"domain_scores_codex":[0.9985205,0.00002977353,0.0004355005,0.0001924272,0.0005759906,0.0002458344],"domain_scores_gemma":[0.9975363,0.0004232937,0.0004245191,0.0003817427,0.00114233,0.0000917877],"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.00005858077,0.0000494954,0.0002811592,0.000004656501,0.0001117709,0.000001363661,0.0006213803,0.005496781,0.001305275,0.1304573,0.00268129,0.8589309],"study_design_scores_gemma":[0.001968588,0.0007222862,0.008638011,0.0001904805,0.0000317973,0.0006179435,0.0001349756,0.6624801,0.02719714,0.1844334,0.1131746,0.0004106542],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03882689,0.0001047273,0.9552642,0.004684955,0.0006345201,0.000199534,0.000002789367,0.0000465482,0.0002358517],"genre_scores_gemma":[0.696815,0.00003059708,0.300749,0.0002303417,0.001960282,0.00001040708,0.000001756171,0.000009958095,0.0001927119],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8585203,"threshold_uncertainty_score":0.6358696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03186813572026007,"score_gpt":0.3448644533184474,"score_spread":0.3129963175981873,"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."}}