{"id":"W3136071702","doi":"10.5555/2722129.2722235","title":"Compatible connectivity-augmentation of planar disconnected graphs","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","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); Upper and lower bounds; Planar; Morphing; Mathematics; Graph; Vertex connectivity; Discrete mathematics; Computer science; Artificial intelligence","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.0003549315,0.000173931,0.0002243096,0.0002753568,0.00009549984,0.00008759481,0.0003520888,0.00005429718,0.000007206616],"category_scores_gemma":[0.00004282305,0.0001595059,0.00007978856,0.0007635683,0.00005117176,0.0005561623,0.00006848766,0.00009737377,0.00003252404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005693474,"about_ca_system_score_gemma":0.0001089867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007839514,"about_ca_topic_score_gemma":0.00001356626,"domain_scores_codex":[0.9983788,0.0001553794,0.0003168859,0.0003977634,0.0005389841,0.0002122029],"domain_scores_gemma":[0.9989064,0.0001629997,0.0001840073,0.0003772012,0.0002059165,0.0001634472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002442708,0.0007398846,0.001628501,0.00006960247,0.0002095331,0.00002974715,0.004564027,0.06138792,0.03381113,0.8684001,0.006413425,0.02250184],"study_design_scores_gemma":[0.005659013,0.002989437,0.009303186,0.0001214105,0.00005767418,0.00004975247,0.0005210505,0.709806,0.1341382,0.1340699,0.002218979,0.001065376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.151401,0.0001350394,0.8391613,0.002371482,0.001183093,0.0004243956,0.00004609878,0.0001950945,0.00508242],"genre_scores_gemma":[0.9708434,0.00001147533,0.02853143,0.0001960811,0.00008713598,0.00002569373,0.000133264,0.00001129574,0.0001602267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8194423,"threshold_uncertainty_score":0.6504461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02786275951915704,"score_gpt":0.2748712602260167,"score_spread":0.2470085007068597,"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."}}