{"id":"W2965180164","doi":"10.1002/net.22068","title":"Constraint programming approaches for the discretizable molecular distance geometry problem","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Discretization; Integer programming; Vertex (graph theory); Constraint satisfaction problem; Computational geometry; Domain (mathematical analysis); Constraint (computer-aided design); Set (abstract data type)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208335,0.001252527,0.001067469,0.0009477721,0.0007104398,0.002095316,0.001918447,0.001523395,0.007148351],"category_scores_gemma":[0.008055028,0.000735165,0.001078328,0.002569082,0.001792015,0.002276215,0.001387261,0.003647789,0.0005570658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00211242,"about_ca_system_score_gemma":0.002008867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008187891,"about_ca_topic_score_gemma":0.008281672,"domain_scores_codex":[0.9983106,0.0007453701,0.00007134969,0.0002527912,0.0004824879,0.0001374305],"domain_scores_gemma":[0.9936718,0.005137011,0.0003628765,0.0003262333,0.0003678067,0.0001343538],"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.00002499701,0.00004091613,0.0001580108,0.00009349553,0.00001864295,0.00007213876,0.00003948993,0.8832367,0.0003608056,0.1003721,0.001692334,0.01389042],"study_design_scores_gemma":[0.00001972776,0.00001405535,0.00003785897,0.00001894114,0.000004970389,0.0000249107,0.00002637717,0.9296744,0.0002107437,0.06749413,0.002468069,0.000005871688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01211068,0.0005635177,0.9767019,0.0008681507,0.00006956593,0.0001581477,0.0006241529,0.0001267741,0.008777177],"genre_scores_gemma":[0.2124246,0.001286951,0.7799588,0.0003837517,0.0001197151,0.0006087633,0.000998318,0.000158732,0.004060385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008187891,"threshold_uncertainty_score":0.02391362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06243605348160239,"score_gpt":0.3252412656153425,"score_spread":0.2628052121337401,"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."}}