{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499185,0.0001780252,0.0001526683,0.0005345017,0.0002365012,0.0004356267,0.0006518106,0.0000735584,0.000001481078],"category_scores_gemma":[0.00004636675,0.0001827083,0.00004491306,0.001388338,0.00002906274,0.003576827,0.0001019231,0.000213053,0.0001509792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009921263,"about_ca_system_score_gemma":0.00004590546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003615094,"about_ca_topic_score_gemma":0.000001411862,"domain_scores_codex":[0.9984316,0.00002398979,0.0004857515,0.0002371308,0.0004459605,0.000375544],"domain_scores_gemma":[0.9991782,0.00004844459,0.0001695045,0.0004037066,0.0000918586,0.0001083196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001275618,0.00002734532,0.01227771,0.001338983,0.00003819078,0.00001433204,0.06006468,0.1406623,0.01083966,0.03688614,0.06479337,0.6730446],"study_design_scores_gemma":[0.000809265,0.0001751012,0.0407746,0.001357547,0.00001777055,0.0000688842,0.0001060792,0.7460965,0.004823893,0.01076227,0.1929878,0.002020308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03786373,0.000004296082,0.9527311,0.005100695,0.0001431412,0.0003016597,0.000004398284,0.00369686,0.0001540972],"genre_scores_gemma":[0.3612771,0.000001734511,0.6338872,0.004554163,0.00004147965,0.0001551987,0.00004627328,0.0000192233,0.00001765271],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6710243,"threshold_uncertainty_score":0.7450628,"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."}}