{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.003747792,0.0002269994,0.000264791,0.0001777484,0.001382517,0.0003731575,0.003103946,0.00003532626,0.0003191888],"category_scores_gemma":[0.00007407601,0.0002037538,0.00009253746,0.001353216,0.004814401,0.0006698589,0.002275354,0.0004253245,0.00004249201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002406894,"about_ca_system_score_gemma":0.0002662609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001511294,"about_ca_topic_score_gemma":9.951813e-7,"domain_scores_codex":[0.9962586,0.0005169614,0.0003020538,0.001117711,0.001065964,0.0007387197],"domain_scores_gemma":[0.9976779,0.0007569758,0.0001002308,0.001065564,0.000115217,0.0002841633],"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.000006671807,0.0001365682,0.0001338778,0.000004139505,0.000006285751,0.00001722544,0.0006712048,0.0008881727,0.0009854828,0.9659497,0.00004122612,0.03115946],"study_design_scores_gemma":[0.000257822,0.0003214442,0.006664752,0.000009969093,0.000003696356,0.0001884023,0.00004637879,0.2898913,0.001319887,0.7009547,0.00004128423,0.0003003444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1420523,0.00001798393,0.8513893,0.001897792,0.0006642787,0.0002934963,0.00002067281,0.0003381548,0.003326042],"genre_scores_gemma":[0.9614236,6.391576e-7,0.03667402,0.001800667,0.00005512104,0.00002960188,0.00000237987,0.00000847654,0.000005436509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8193714,"threshold_uncertainty_score":0.9999176,"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."}}