{"id":"W2952959227","doi":"10.1137/1.9781611973730.106","title":"Compatible Connectivity-Augmentation of Planar Disconnected Graphs","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Morphing; Upper and lower bounds; Planar; Mathematics; Graph; Discrete mathematics; Computer science; Computer graphics (images)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009369632,0.001052643,0.0008018009,0.0008056989,0.0007327914,0.001256737,0.001685763,0.001263466,0.004212266],"category_scores_gemma":[0.006398004,0.0007335127,0.001063165,0.001315474,0.001562391,0.003911686,0.002556912,0.001291624,0.0005462213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006400918,"about_ca_system_score_gemma":0.0004757314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006915695,"about_ca_topic_score_gemma":0.0007874059,"domain_scores_codex":[0.9986528,0.0004478584,0.00007719786,0.0003720885,0.0003204474,0.000129582],"domain_scores_gemma":[0.9956667,0.002503863,0.0005173996,0.0008273253,0.0002323629,0.0002522774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007667434,0.0003717494,0.00574421,0.0007843945,0.00009707531,0.001474913,0.0008793888,0.4696867,0.03260369,0.3296473,0.006147798,0.151796],"study_design_scores_gemma":[0.00009947747,0.0002410888,0.001320759,0.00008342004,0.00005064558,0.00097973,0.0003603403,0.669489,0.01958476,0.2965035,0.01123826,0.00004905593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3092237,0.0003071103,0.6733111,0.0008080571,0.00005694242,0.0003382298,0.0006334452,0.0009429517,0.0143785],"genre_scores_gemma":[0.6548871,0.000303319,0.3385945,0.0001525107,0.0000655605,0.0003360326,0.001788871,0.0001973875,0.003674673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004212266,"threshold_uncertainty_score":0.01409143,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02246285873730274,"score_gpt":0.2678417124603997,"score_spread":0.245378853723097,"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."}}