{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004314307,0.0001458723,0.0001886107,0.00002459907,0.0002435686,0.000137435,0.0002245285,0.00009245214,0.0000597896],"category_scores_gemma":[0.0004220837,0.0001078537,0.0001013245,0.0005023383,0.0001700835,0.00007723369,0.0001137636,0.0002763643,0.000001718203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005318796,"about_ca_system_score_gemma":0.00007221935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.155458e-7,"about_ca_topic_score_gemma":0.000008293135,"domain_scores_codex":[0.9986364,0.00006390535,0.0002493852,0.000312111,0.0002717137,0.000466543],"domain_scores_gemma":[0.9984,0.0008109533,0.00009289098,0.0004226107,0.0001952194,0.00007826688],"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.00002544302,0.0001646653,0.00008428095,0.0001885458,0.0001390341,0.0000243732,0.0001703397,0.3967238,0.00001200089,0.3739301,0.001483251,0.2270541],"study_design_scores_gemma":[0.0004871351,0.0000280082,0.000005833623,0.00006685148,0.00004097856,0.00001847464,0.000760718,0.9251103,0.0002837325,0.04650183,0.02648101,0.0002150787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005300719,0.001688169,0.9947049,0.0009164838,0.00006966889,0.001020567,0.000009203723,0.00008698506,0.001450986],"genre_scores_gemma":[0.04585963,0.00008064062,0.9501426,0.00008826855,0.00017134,0.0007314827,0.00005147034,0.00006872709,0.002805818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5283865,"threshold_uncertainty_score":0.4398145,"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."}}