{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005694346,0.00006162336,0.00005349442,0.0000726083,0.00005375776,0.00008131238,0.0001698952,0.00002714393,0.0002679669],"category_scores_gemma":[0.00002044571,0.00004950681,0.00002994444,0.0001494574,0.00001445464,0.0001685195,0.0000263456,0.00004529085,0.0002112706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009497354,"about_ca_system_score_gemma":0.00001096289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009126737,"about_ca_topic_score_gemma":0.00002710997,"domain_scores_codex":[0.9994874,0.00002390615,0.00008883783,0.0001741991,0.0001228474,0.0001027881],"domain_scores_gemma":[0.9996221,0.00004444371,0.00002805407,0.0002230014,0.00002882663,0.00005356864],"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":[9.246413e-7,0.00003107602,0.001999465,0.000003772976,0.000004338169,3.393093e-7,0.0001810522,0.001070579,0.0002233155,0.6466134,0.001384667,0.348487],"study_design_scores_gemma":[0.001242197,0.0006116707,0.07782865,0.00004308008,0.000005096038,0.00001457483,0.00002502923,0.7545907,0.004503753,0.04507794,0.1152605,0.0007967935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003627845,0.000001556039,0.9280442,0.001293284,0.0002599375,0.00008011094,4.197778e-7,0.0002235443,0.06646908],"genre_scores_gemma":[0.9714183,0.000002987131,0.02646979,0.0007834219,0.00001478708,0.000004323572,0.000001009257,0.000003118657,0.001302295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9677904,"threshold_uncertainty_score":0.293405,"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."}}