{"id":"W4386827762","doi":"10.1016/j.ipl.2023.106446","title":"Relating planar graph drawings to planar satisfiability problems","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"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":"Satisfiability; Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Discrete mathematics; Boolean satisfiability problem; Neighbourhood (mathematics); Epigraph; Graph; Algorithm; Mathematical optimization","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.001373079,0.001138773,0.001152172,0.002934196,0.00141063,0.003256448,0.002418795,0.002872029,0.008123755],"category_scores_gemma":[0.02768579,0.00154506,0.001688363,0.006023733,0.001954835,0.006690607,0.003699425,0.004958893,0.0006859145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001776552,"about_ca_system_score_gemma":0.001028608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004046845,"about_ca_topic_score_gemma":0.003664398,"domain_scores_codex":[0.9980046,0.0007349369,0.000140147,0.000379605,0.0005502962,0.0001904993],"domain_scores_gemma":[0.9820968,0.0144598,0.001454946,0.001004216,0.0007937451,0.0001906149],"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.0001133367,0.0001765864,0.001102988,0.0003920784,0.00005890996,0.0003075188,0.0004773712,0.207011,0.001538516,0.6835254,0.007463109,0.0978333],"study_design_scores_gemma":[0.00001780268,0.00001778604,0.0001940511,0.00003118681,0.0000214183,0.00006374742,0.0000969759,0.1246354,0.0005274035,0.8720182,0.002364194,0.00001183339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05588991,0.0007889952,0.9209242,0.0018383,0.0001180807,0.0002036466,0.0004290853,0.0005477365,0.01925999],"genre_scores_gemma":[0.5084391,0.00366019,0.4679092,0.001047389,0.0003964003,0.0004893023,0.003398307,0.0006118641,0.01404821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008123755,"threshold_uncertainty_score":0.02717668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01238862614883005,"score_gpt":0.225678256072386,"score_spread":0.2132896299235559,"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."}}