{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005891709,0.0001508272,0.0003167401,0.0006738937,0.0002831811,0.00005584565,0.001727352,0.00006281004,0.000005113762],"category_scores_gemma":[0.0006823951,0.00009725001,0.0004017522,0.002335126,0.0005826305,0.0004583808,0.0001904016,0.0004847111,0.000009078048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002268853,"about_ca_system_score_gemma":0.000132574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001740383,"about_ca_topic_score_gemma":0.000003635706,"domain_scores_codex":[0.9973223,0.0009051363,0.0004857664,0.0001965086,0.0006753015,0.0004150422],"domain_scores_gemma":[0.9947167,0.00364526,0.0003840346,0.000595885,0.0005195751,0.0001385321],"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.0003199244,0.00007397101,0.0007064046,0.00001552026,0.0002112606,0.0000842007,0.001063199,0.0001325464,0.01115541,0.9324096,0.0002923345,0.05353564],"study_design_scores_gemma":[0.0004670177,0.0003359822,0.007553786,0.00005263479,0.00001585032,0.00009154774,0.000545616,0.0004854313,0.01060993,0.9792909,0.0004354466,0.0001158361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8146431,0.002431192,0.1750796,0.001794931,0.001705326,0.0002754856,0.00000756182,0.0001184031,0.003944454],"genre_scores_gemma":[0.9984439,0.0006117111,0.0006874296,0.00005334727,0.00004810472,0.000003966569,1.668108e-7,0.00001480381,0.0001365446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1838008,"threshold_uncertainty_score":0.396574,"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."}}