{"id":"W2093939144","doi":"10.1007/s00236-007-0056-x","title":"Solving #SAT using vertex covers","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Discrete mathematics; Cluster analysis; Vertex (graph theory); Time complexity; Graph; Pathwidth; Line graph","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.0007902266,0.001178794,0.0009998627,0.000989345,0.000998929,0.002698715,0.002026862,0.001401604,0.01179578],"category_scores_gemma":[0.005361162,0.0009294452,0.001953477,0.00191352,0.00098095,0.004380394,0.00260483,0.002637743,0.001794928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001354437,"about_ca_system_score_gemma":0.001602966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004333425,"about_ca_topic_score_gemma":0.008359846,"domain_scores_codex":[0.9986847,0.0004170212,0.00005634066,0.0002851093,0.0002759724,0.0002808886],"domain_scores_gemma":[0.9952627,0.003729399,0.0001732357,0.0005181904,0.0001823019,0.0001341133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001427232,0.000486348,0.004180402,0.00125972,0.0003972657,0.0004294298,0.0006126569,0.271956,0.01396163,0.2180185,0.04130205,0.445969],"study_design_scores_gemma":[0.0002281925,0.0001579029,0.0009203078,0.00008661373,0.0001890983,0.0002045525,0.0002789052,0.5210271,0.01111042,0.4515659,0.01419996,0.00003113311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3120993,0.001395142,0.5995672,0.005592315,0.0003766796,0.0002897975,0.003072188,0.006049828,0.07155762],"genre_scores_gemma":[0.6470575,0.0005848004,0.3299653,0.0005460305,0.0002169322,0.0001940953,0.00407248,0.0009512243,0.01641165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01179578,"threshold_uncertainty_score":0.03946084,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0258547673811828,"score_gpt":0.3054329410701412,"score_spread":0.2795781736889584,"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."}}