{"id":"W1979119667","doi":"10.1109/lics.2012.24","title":"Near Unanimity Constraints Have Bounded Pathwidth Duality","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Nondeterministic algorithm; Unanimity; Bounded function; Conjecture; Constraint satisfaction problem; Mathematics; Duality (order theory); Discrete mathematics; Equivalence (formal languages); Backtracking; Combinatorics; Mathematical optimization","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.001252753,0.000137419,0.0001547748,0.00005336711,0.0002579076,0.000188797,0.0008091488,0.00006434866,0.0003079054],"category_scores_gemma":[0.0001608834,0.000115862,0.00007099989,0.0002830267,0.0005470818,0.001045594,0.0004716156,0.0002169725,0.0003981933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005720512,"about_ca_system_score_gemma":0.00009568543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002281861,"about_ca_topic_score_gemma":0.00001108961,"domain_scores_codex":[0.9981114,0.0002375333,0.0001929634,0.0003192761,0.0004185812,0.0007202735],"domain_scores_gemma":[0.9984885,0.0002116956,0.0000510462,0.0008129614,0.00009875833,0.0003370751],"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.000007101956,0.0001177607,0.0194934,0.000006386718,0.00001225128,0.000006645851,0.0005875219,0.000002671328,0.0003864067,0.9564041,0.0003016257,0.02267406],"study_design_scores_gemma":[0.001945972,0.0002256357,0.1113843,0.00002473579,0.0000107389,0.0001822334,0.0005267993,0.01370332,0.03049164,0.8028456,0.03739641,0.001262628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1297197,0.00007758439,0.8019044,0.0005437435,0.0003094206,0.0002600165,0.000006174054,0.0003662957,0.06681266],"genre_scores_gemma":[0.9162417,0.000003077007,0.08255775,0.0004008308,0.0000436644,0.000009372003,0.000001328558,0.000007567335,0.00073469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.786522,"threshold_uncertainty_score":0.5118101,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04729336190534559,"score_gpt":0.3271589810276005,"score_spread":0.2798656191222549,"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."}}