{"id":"W3196411836","doi":"10.1016/j.tcs.2022.03.013","title":"Positive planar satisfiability problems under 3-connectivity constraints","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Combinatorics; Mathematics; Planar graph; Planarity testing; Satisfiability; Discrete mathematics; Planar; Matching (statistics); Graph; Time complexity; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001472389,0.0007968256,0.001165562,0.0009151105,0.00139242,0.004203074,0.002109567,0.00256898,0.01195241],"category_scores_gemma":[0.01156425,0.001076068,0.001472962,0.002116742,0.002390545,0.009137537,0.002791459,0.003494162,0.0007951569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001409991,"about_ca_system_score_gemma":0.0009416187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001885902,"about_ca_topic_score_gemma":0.002448708,"domain_scores_codex":[0.9985101,0.0004956915,0.0001103249,0.0003616242,0.000296895,0.0002253383],"domain_scores_gemma":[0.9829271,0.01459047,0.001092606,0.0004949503,0.0005152849,0.0003794876],"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.0006536486,0.0002688421,0.001693253,0.0009188994,0.0001689355,0.0009570399,0.001012711,0.1145598,0.00771471,0.811934,0.01229979,0.04781834],"study_design_scores_gemma":[0.0001404168,0.00004976502,0.0003932278,0.00004870363,0.00006573244,0.0002732283,0.0004130815,0.07732577,0.003742278,0.9143454,0.003172299,0.00002999273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5199673,0.001190372,0.3958591,0.01084222,0.0002691933,0.000350966,0.002511051,0.001142244,0.06786747],"genre_scores_gemma":[0.9071831,0.000725456,0.0752072,0.0008234441,0.0003186335,0.000249569,0.001983927,0.0002957126,0.01321288],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01195241,"threshold_uncertainty_score":0.03998476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009563311863093891,"score_gpt":0.2284865948402183,"score_spread":0.2189232829771244,"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."}}