{"id":"W2966130377","doi":"10.1287/ijoc.2020.1039","title":"Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Vertex (graph theory); Discretization; Integer programming; Constraint programming; Combinatorics; Mathematical optimization; Discrete mathematics; Graph","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","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001756682,0.0006292715,0.0007299701,0.000487751,0.000357534,0.002219252,0.0004310396,0.000266637,0.00001650452],"category_scores_gemma":[0.0001975648,0.0005856832,0.0002179917,0.0004322693,0.0001052668,0.000310156,0.0005883095,0.002401998,0.000004548306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004414934,"about_ca_system_score_gemma":0.0001305192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006640321,"about_ca_topic_score_gemma":0.000002901753,"domain_scores_codex":[0.9967818,0.0001022615,0.001238868,0.0005213729,0.0005547063,0.0008009867],"domain_scores_gemma":[0.9982389,0.0001656853,0.0005036538,0.0003989009,0.000223907,0.0004689082],"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.00000904647,0.00004168537,0.0009838981,0.0005298572,0.0001293718,0.00003530539,0.001046914,0.68774,0.00001230544,0.0001924984,0.00004327063,0.3092358],"study_design_scores_gemma":[0.0005969953,0.0002094672,0.0005242768,0.00476436,0.00007386162,0.001148647,0.0009129473,0.9834028,0.0006338204,0.0002546835,0.006281905,0.001196169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1757403,0.0005545602,0.8207043,0.0001511742,0.0009556276,0.0007831618,0.00001174249,0.0004408052,0.0006582501],"genre_scores_gemma":[0.5923528,0.00005197005,0.4070391,0.00006906995,0.0002891928,0.00002776049,0.00006864034,0.00008332745,0.00001814292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4166125,"threshold_uncertainty_score":0.9998995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04288099152760674,"score_gpt":0.2772684581902206,"score_spread":0.2343874666626138,"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."}}