{"id":"W2990034237","doi":"10.1109/smc.2019.8914046","title":"Constrained LP-trees","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Lexicographical order; Outcome (game theory); Tree (set theory); Mathematical optimization; Computer science; Preference; Search tree; Set (abstract data type); Mathematics; Search algorithm; Combinatorics; Statistics; Mathematical economics","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":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00005153646,0.00004349957,0.00004851271,0.00004310886,0.00002250001,0.00006534865,0.0001503922,0.00002084693,0.001723686],"category_scores_gemma":[0.000007280476,0.00003764346,0.00002272617,0.0001224307,0.00001527275,0.0002608465,0.00003703873,0.00003131297,0.0008134776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008601565,"about_ca_system_score_gemma":0.0000334494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006089698,"about_ca_topic_score_gemma":0.00001202145,"domain_scores_codex":[0.999611,0.00001092434,0.00007536569,0.0001342514,0.00008451719,0.00008394639],"domain_scores_gemma":[0.9996957,0.000028363,0.0000198602,0.000192448,0.00002808514,0.00003550137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001120818,0.00001355833,0.01448112,0.000002458725,0.000007157031,0.00000180059,0.0001148962,0.0007360053,0.001422811,0.8493509,0.001125046,0.1327431],"study_design_scores_gemma":[0.001487353,0.0001220292,0.1036811,0.00001685262,0.000004142182,0.00007849561,0.0001828231,0.8532524,0.00365131,0.005559789,0.03142643,0.0005372054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007436293,0.000003927557,0.7970736,0.001153323,0.0002829852,0.00007646507,3.190734e-7,0.0002230209,0.1937501],"genre_scores_gemma":[0.9381367,0.000002369453,0.05716274,0.0005504842,0.000009178288,0.00000120588,9.561534e-7,0.000001726224,0.004134639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9307004,"threshold_uncertainty_score":0.9999645,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006319064842535145,"score_gpt":0.2086475164426546,"score_spread":0.2023284516001194,"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."}}