{"id":"W2184112757","doi":"","title":"The Vital Core Connectivity Problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Upper and lower bounds; Approximation algorithm; Linear programming relaxation; Enhanced Data Rates for GSM Evolution; Mathematics; Core (optical fiber); Graph; Linear programming; Computer science; Discrete mathematics; Algorithm; 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.000395267,0.00006368793,0.00005396546,0.00001649749,0.0003486186,0.0001190266,0.0005794484,0.00002003998,0.00001859543],"category_scores_gemma":[0.00002127751,0.00003798202,0.00004498881,0.0001939582,0.0000719217,0.0004359969,0.0002850323,0.00008857277,0.00008342121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001109144,"about_ca_system_score_gemma":0.00001433643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002174051,"about_ca_topic_score_gemma":0.00002159684,"domain_scores_codex":[0.9993464,0.00002738037,0.00007810855,0.0001166127,0.0001444567,0.0002870861],"domain_scores_gemma":[0.9992773,0.0002389625,0.00002531986,0.0003577229,0.00002787257,0.00007284623],"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":[6.531894e-7,0.00003603891,0.00176984,0.000001110206,0.000004974852,3.734219e-7,0.0001895497,7.682706e-7,0.00005695708,0.9351451,0.001940218,0.06085438],"study_design_scores_gemma":[0.0005198983,0.0001695668,0.0479435,0.0000133479,0.000007372455,0.0001363863,0.0002135002,0.04408588,0.004339211,0.5714493,0.3304904,0.0006316362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02785305,0.0003487989,0.8849592,0.002546671,0.001255433,0.0002181852,0.000001340724,0.0003902667,0.08242707],"genre_scores_gemma":[0.9616475,0.000005024493,0.03727563,0.0002136786,0.0001095855,0.00001037715,2.429074e-7,0.0000026079,0.0007354304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9337944,"threshold_uncertainty_score":0.2681328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03668245112756905,"score_gpt":0.2630818510553934,"score_spread":0.2263993999278244,"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."}}