{"id":"W1558213091","doi":"10.1007/978-3-540-79719-7_10","title":"Complexity and Algorithms for Well-Structured k-SAT Instances","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Constructive; Discrete mathematics; Path (computing); Computational complexity theory; Algorithm; Graph; Pathwidth; Computer science; 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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008775974,0.0006364204,0.0007448452,0.000910529,0.0006721407,0.0004279696,0.003591495,0.0003244785,0.00001150047],"category_scores_gemma":[0.0001376142,0.0005696384,0.0001529304,0.0006717283,0.003374381,0.0008204329,0.001612402,0.00086041,0.00001299576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002214231,"about_ca_system_score_gemma":0.0004289807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008656632,"about_ca_topic_score_gemma":0.00009128122,"domain_scores_codex":[0.9952624,0.00005452577,0.0005214849,0.002082632,0.001106243,0.0009726835],"domain_scores_gemma":[0.9966247,0.001016611,0.0002795063,0.00142488,0.0003677073,0.0002866166],"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.00003798558,0.00002558468,0.00007807269,0.000105253,0.00002508697,0.0001023365,0.001081372,0.003947681,0.0001423096,0.1000926,0.00009278322,0.8942689],"study_design_scores_gemma":[0.0005375393,0.0002566943,0.000198991,0.0001612285,0.00000448388,0.0001995313,3.083607e-7,0.2468774,0.001047974,0.7430902,0.00689373,0.0007318373],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001599188,0.001618978,0.9941182,0.0006396979,0.001152625,0.0008958995,0.00002914146,0.0001735939,0.001211913],"genre_scores_gemma":[0.04382454,0.0003927272,0.9539161,0.0009211167,0.000440779,0.00003108244,0.00001377618,0.00005400973,0.0004058182],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8935371,"threshold_uncertainty_score":0.9996755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04733726490897559,"score_gpt":0.3021002439137633,"score_spread":0.2547629790047877,"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."}}