{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015447,0.000861059,0.001167666,0.0008800367,0.0009707522,0.002408501,0.002407325,0.002168301,0.008233512],"category_scores_gemma":[0.007696591,0.0005855184,0.0007352501,0.00165353,0.001566647,0.004997426,0.002818177,0.002082029,0.0006481489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001374578,"about_ca_system_score_gemma":0.001128815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001589979,"about_ca_topic_score_gemma":0.001371095,"domain_scores_codex":[0.9989329,0.0002849592,0.00004346254,0.0002962117,0.0001963434,0.0002460661],"domain_scores_gemma":[0.9971648,0.001638687,0.0002904092,0.000287924,0.0002703624,0.0003478757],"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.0006216169,0.0003181122,0.002934968,0.001113691,0.0001510296,0.0006729819,0.0007296898,0.2341776,0.005282746,0.5686645,0.05274265,0.1325905],"study_design_scores_gemma":[0.0001495193,0.0001528565,0.001152476,0.0001394601,0.00007434712,0.001114306,0.000531434,0.3564999,0.003293957,0.6010957,0.03575654,0.00003960312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2445012,0.002500011,0.6621292,0.007659713,0.0002689478,0.0005755582,0.004097414,0.0009114105,0.07735647],"genre_scores_gemma":[0.797519,0.002292329,0.1750688,0.00128961,0.0002740931,0.0005526594,0.005093277,0.000313092,0.01759722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008233512,"threshold_uncertainty_score":0.02754384,"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."}}