{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003905031,0.0001173795,0.0001736001,0.0002596828,0.0001285574,0.00009825559,0.0006928016,0.00006935294,0.003402338],"category_scores_gemma":[0.0002447653,0.0001151226,0.00005560839,0.0004994956,0.0002076945,0.00005669879,0.00009029979,0.0001558512,0.007252401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007653572,"about_ca_system_score_gemma":0.000129302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001894723,"about_ca_topic_score_gemma":0.01023701,"domain_scores_codex":[0.9988396,0.00006043059,0.0001897727,0.0003064212,0.0001467334,0.0004571046],"domain_scores_gemma":[0.9988774,0.0001861528,0.00002404514,0.0004851551,0.00005140599,0.0003758391],"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":[9.745916e-7,0.00003769972,0.0001859923,0.00001077619,0.000004141439,0.00005236704,0.0002913648,3.705907e-7,0.00001389367,0.9887,0.004556433,0.006146043],"study_design_scores_gemma":[0.0002767825,0.00008562361,0.00226617,0.00006247161,0.000002270851,0.00005889829,0.00003785885,0.01157141,0.0002185706,0.885542,0.09956849,0.0003094753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.261855,0.0001323289,0.2470654,0.04261759,0.0008441271,0.0006811997,0.00001717493,0.000391065,0.4463961],"genre_scores_gemma":[0.9716411,0.000001445178,0.02630971,0.00158141,0.00007803777,0.00001515466,5.75768e-7,0.000007947168,0.0003646428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7097861,"threshold_uncertainty_score":0.9975087,"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."}}