{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429719,0.0002156723,0.0003100193,0.0001627717,0.0005834657,0.0001968218,0.001237905,0.00007298361,0.000008065853],"category_scores_gemma":[0.00009143633,0.0001674269,0.0002211177,0.001142966,0.00008412222,0.0002550636,0.0003822713,0.0001762888,0.00001606316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002413939,"about_ca_system_score_gemma":0.00007067649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003840293,"about_ca_topic_score_gemma":0.000006268788,"domain_scores_codex":[0.997997,0.0001151862,0.0005135353,0.0004581005,0.0003620221,0.0005541475],"domain_scores_gemma":[0.997798,0.001140564,0.0002940293,0.0005267913,0.0001647582,0.00007586124],"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.00003128326,0.0001024341,0.0004182245,0.0001469444,0.0001946387,0.00001398532,0.003795342,0.5200233,0.0003555551,0.3121414,0.003277483,0.1594994],"study_design_scores_gemma":[0.0008136015,0.00006376104,0.001940054,0.00006244666,0.00001472347,0.000006441315,0.0001251617,0.9692965,0.0002790794,0.02476111,0.002428042,0.0002090653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00487021,0.0004253955,0.9915201,0.00122162,0.000673504,0.0005657363,0.000007870176,0.0003858766,0.0003296559],"genre_scores_gemma":[0.8575309,0.0001448476,0.1415324,0.0001821086,0.0003395474,0.00004128615,0.00003056111,0.00002623199,0.0001720855],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8526607,"threshold_uncertainty_score":0.6827471,"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."}}