{"id":"W2555363315","doi":"10.4153/cmb-2018-005-9","title":"Connectivity in Hypergraphs","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Hypergraph; Vertex (graph theory); Bounded function; Vertex connectivity; Vertex cover; Polynomial","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.0009384204,0.0005378669,0.000521689,0.002216439,0.001294088,0.003111566,0.001168643,0.001215526,0.008263126],"category_scores_gemma":[0.006897133,0.0005083113,0.0006629081,0.002955598,0.002953298,0.00735733,0.002532105,0.002491652,0.0005587935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442908,"about_ca_system_score_gemma":0.0006011976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001947768,"about_ca_topic_score_gemma":0.001866755,"domain_scores_codex":[0.9981768,0.0005215677,0.0001144889,0.000582434,0.0004251349,0.0001795332],"domain_scores_gemma":[0.9913415,0.005608579,0.0009821826,0.0007171282,0.0007984776,0.0005520754],"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.000138287,0.00004710348,0.003215087,0.0004344508,0.00005738649,0.000511173,0.0005941054,0.02965687,0.00568487,0.9251043,0.004053667,0.03050275],"study_design_scores_gemma":[0.00002278209,0.00004403172,0.001627874,0.00009467469,0.00003704142,0.0006337935,0.0003333192,0.05393518,0.002323684,0.9251077,0.01581763,0.00002239969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3107148,0.004687165,0.6024802,0.006420902,0.0002652981,0.00025517,0.001652907,0.0006006801,0.07292284],"genre_scores_gemma":[0.8573526,0.002433232,0.1281826,0.0007190864,0.0004068447,0.0002822199,0.001309347,0.0001559927,0.009158019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008263126,"threshold_uncertainty_score":0.02764297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01484490502968463,"score_gpt":0.2255064902211542,"score_spread":0.2106615851914696,"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."}}