{"id":"W2133642716","doi":"10.1142/s021819591000344x","title":"CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; General position; Embedding; Planar graph; Discrete mathematics; Parameterized complexity; Disjoint sets; Graph; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0009845251,0.0002030568,0.0003218674,0.001125953,0.0001215717,0.0001489343,0.001736088,0.0001095648,0.0001384435],"category_scores_gemma":[0.000208356,0.0002022672,0.0002953278,0.001185605,0.0002162495,0.0008077609,0.0001315388,0.0004349804,0.00002885298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005757834,"about_ca_system_score_gemma":0.0005295452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006978436,"about_ca_topic_score_gemma":0.000004626937,"domain_scores_codex":[0.9968781,0.00007884736,0.001208951,0.0003270594,0.00131121,0.0001958632],"domain_scores_gemma":[0.9942068,0.0008729023,0.001070728,0.0003413171,0.003313207,0.000195054],"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.00006836258,0.0006974958,0.00223603,0.00002949313,0.0003818185,0.00001522652,0.0002395264,0.04198772,0.007197928,0.8537715,0.001188768,0.09218609],"study_design_scores_gemma":[0.002099591,0.0002705501,0.02491397,0.00004255987,0.00005913165,0.001265654,0.0001063828,0.02603099,0.004528233,0.8941556,0.0460183,0.000509051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05912666,0.000112702,0.9365734,0.001815221,0.00101274,0.000299048,0.0001001849,0.0000444891,0.0009155828],"genre_scores_gemma":[0.7693168,0.00001357167,0.2298367,0.0002625298,0.0004058319,0.00002917951,0.00009127151,0.000009460064,0.00003463555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7101902,"threshold_uncertainty_score":0.8248219,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01085905222239662,"score_gpt":0.2885099065773357,"score_spread":0.277650854354939,"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."}}