{"id":"W2150231253","doi":"","title":"Min-Max Problems on Factor Graphs","year":2014,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Cluster analysis; Combinatorics; Travelling salesman problem; Set cover problem; Mathematics; Independent set; Mathematical optimization; Hamiltonian path; Bottleneck; Computer science; Graph; Set (abstract data type); Artificial intelligence","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.00289299,0.002052248,0.001802978,0.001500093,0.001101985,0.002495169,0.001913679,0.001900389,0.01056852],"category_scores_gemma":[0.01513647,0.0009724791,0.001588089,0.003809232,0.002239525,0.006733595,0.001622362,0.003153275,0.001221541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002321781,"about_ca_system_score_gemma":0.001018395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003188155,"about_ca_topic_score_gemma":0.002666012,"domain_scores_codex":[0.9975805,0.001123825,0.00008885696,0.0005294409,0.0003962309,0.0002810545],"domain_scores_gemma":[0.9920387,0.006448838,0.0005274974,0.0004740173,0.0003227176,0.0001882287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00016939,0.0001053778,0.0006519019,0.000553357,0.0001159001,0.0001309913,0.0002199949,0.3670364,0.001057793,0.5608651,0.009414028,0.05967975],"study_design_scores_gemma":[0.00002844983,0.00003936322,0.0001796458,0.00003966896,0.00002670769,0.00007637917,0.00006117587,0.3613245,0.0006310528,0.6310595,0.006518858,0.0000147835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01681896,0.001879584,0.9656669,0.0009936491,0.00008265293,0.0001255459,0.0005140759,0.0002897734,0.0136288],"genre_scores_gemma":[0.4417633,0.005640262,0.5358303,0.0005767932,0.0006743554,0.0005022244,0.001584502,0.0004731209,0.01295521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01056852,"threshold_uncertainty_score":0.03535527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01239376679039596,"score_gpt":0.2117623382143289,"score_spread":0.199368571423933,"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."}}