{"id":"W4367397470","doi":"10.1016/j.parco.2023.103024","title":"A lightweight semi-centralized strategy for the massive parallelization of branching algorithms","year":2023,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Programmer; Vertex cover; Bounded function; Algorithm; Branching (polymer chemistry); Parallel computing; Vertex (graph theory); Theoretical computer science; Graph; Approximation algorithm; Mathematics; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.001779896,0.0009875073,0.0014612,0.001106961,0.001536073,0.002175864,0.003417651,0.0009034149,0.006993963],"category_scores_gemma":[0.006548,0.0006484195,0.0008327172,0.00161064,0.001443767,0.002679999,0.004385677,0.002341447,0.003319229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237063,"about_ca_system_score_gemma":0.00342722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205355,"about_ca_topic_score_gemma":0.004221062,"domain_scores_codex":[0.9975988,0.0006330782,0.0001313341,0.0004427797,0.0008720112,0.000321995],"domain_scores_gemma":[0.994953,0.001159975,0.0002586881,0.002478829,0.0007088065,0.0004406556],"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.002177108,0.000734798,0.001946583,0.0004591889,0.0001859397,0.0003482551,0.0005189442,0.1492002,0.09675451,0.2173272,0.03281387,0.4975334],"study_design_scores_gemma":[0.0001937793,0.0001589471,0.0003655302,0.00002161665,0.00004595426,0.0001070131,0.00005723902,0.8792204,0.0152391,0.09918648,0.005365611,0.00003832134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0124222,0.0001471807,0.979081,0.0002836119,0.00009502871,0.0001009869,0.00008494946,0.003620537,0.004164591],"genre_scores_gemma":[0.3617648,0.0001649858,0.6299503,0.0003077257,0.0002303111,0.0004568966,0.0004143639,0.0008990485,0.005811573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006993963,"threshold_uncertainty_score":0.02339709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05154537697838242,"score_gpt":0.3049463212381897,"score_spread":0.2534009442598072,"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."}}