{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008646733,0.0001107125,0.0001206321,0.0002089049,0.0002028554,0.0001606748,0.0009356678,0.00005088808,0.00003366382],"category_scores_gemma":[0.0002980168,0.0001016517,0.0000522069,0.0005267265,0.00008132228,0.002640533,0.0004192069,0.0001941263,0.0002044694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000946322,"about_ca_system_score_gemma":0.00007007971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005305632,"about_ca_topic_score_gemma":0.000001948988,"domain_scores_codex":[0.9985926,0.00001868331,0.0002975571,0.00012429,0.0004195947,0.0005473287],"domain_scores_gemma":[0.9986932,0.0004203648,0.0000853987,0.0005682791,0.00007596191,0.0001567985],"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.0001499944,0.0001264146,0.001826622,0.0001921269,0.0001299481,0.0001128462,0.01577614,0.001293023,0.02390253,0.7348701,0.002733651,0.2188866],"study_design_scores_gemma":[0.001494881,0.0003297832,0.002791373,0.0001696976,0.00001491858,0.0002490214,0.001458161,0.857229,0.01997811,0.06829675,0.04692291,0.001065396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1044266,0.00001654641,0.8634289,0.0001231954,0.0002271228,0.0001503091,9.277121e-7,0.0001552744,0.0314711],"genre_scores_gemma":[0.9121026,0.000004582374,0.08733039,0.0004783952,0.00001672202,0.000001293515,0.000001243139,0.000006665294,0.00005805234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.855936,"threshold_uncertainty_score":0.4145235,"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."}}