{"id":"W4387172124","doi":"10.1002/jgt.23035","title":"The edge‐connectivity of vertex‐transitive hypergraphs","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Hypergraph; Discrete mathematics; Transitive reduction; Automorphism; Graph; Line graph; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"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.0004042446,0.0002259506,0.0003049259,0.001731529,0.0009155174,0.001599986,0.0005681958,0.0006420399,0.004372802],"category_scores_gemma":[0.003504169,0.0003235975,0.0002212499,0.001714123,0.001667327,0.002361649,0.001022835,0.00054268,0.0002058896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004982181,"about_ca_system_score_gemma":0.0002128593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001066919,"about_ca_topic_score_gemma":0.0009058426,"domain_scores_codex":[0.9994251,0.0002219697,0.00003506793,0.0001237142,0.0001227464,0.00007151299],"domain_scores_gemma":[0.9962339,0.002451285,0.000494947,0.0002501111,0.0002971038,0.0002726458],"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.0002277381,0.00005571262,0.007209852,0.0002701005,0.00007193087,0.0007722391,0.001211025,0.01975251,0.01294615,0.9296679,0.002301785,0.02551312],"study_design_scores_gemma":[0.00004280791,0.00004825671,0.005641803,0.00009174647,0.00007857841,0.0006625077,0.0006315185,0.05908872,0.007436261,0.9196059,0.006640021,0.00003191061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8937547,0.0004266593,0.06887153,0.0004930613,0.0000298382,0.00005048028,0.0005695091,0.0001255244,0.03567875],"genre_scores_gemma":[0.9914238,0.0001888602,0.006922474,0.00004796864,0.0000236162,0.00004330787,0.00024428,0.00001934736,0.001086315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004372802,"threshold_uncertainty_score":0.01462847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01647421525668126,"score_gpt":0.2826238086771157,"score_spread":0.2661495934204344,"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."}}