{"id":"W2760492644","doi":"10.1080/10556788.2019.1692344","title":"mts: a light framework for parallelizing tree search codes","year":2019,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science","keywords":"Computer science; Backtracking; Enumeration; Satisfiability; Debugging; Search tree; Parallel computing; Vertex (graph theory); Theoretical computer science; Branch and bound; Search algorithm; Algorithm; Graph; Programming language; Discrete mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002995308,0.000606189,0.0008696755,0.0004352722,0.0003388022,0.0008831605,0.002476663,0.00095633,0.00002613996],"category_scores_gemma":[0.008078913,0.0006074924,0.0003819655,0.0006342307,0.0000617115,0.0003193469,0.002069744,0.001056823,0.00001379239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001883518,"about_ca_system_score_gemma":0.0004910196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000339855,"about_ca_topic_score_gemma":8.953987e-7,"domain_scores_codex":[0.9956126,0.0008915589,0.0007199845,0.001553693,0.0005376637,0.0006844703],"domain_scores_gemma":[0.9903144,0.005696697,0.000513336,0.00243562,0.0008486949,0.0001913066],"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.00002637981,0.0000922617,0.0009452505,0.0006665416,0.0001031594,0.000005601584,0.001300597,0.7556555,0.000006975278,0.007537734,0.009641236,0.2240188],"study_design_scores_gemma":[0.0002233925,0.0001025472,0.0000436391,0.0009603516,0.00005097028,0.000009673669,0.000009206802,0.7527859,0.0005723734,0.2427087,0.001782337,0.0007508867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006544094,0.00117293,0.9787992,0.001056001,0.00140877,0.001398806,0.00003323817,0.01593336,0.0001911907],"genre_scores_gemma":[0.0001489026,0.0001878294,0.9976665,0.0006285423,0.0002687142,0.0005451979,0.0001421818,0.0001200047,0.0002921782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.235171,"threshold_uncertainty_score":0.9996377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0714005721263264,"score_gpt":0.401624404560027,"score_spread":0.3302238324337006,"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."}}