{"id":"W2963906609","doi":"","title":"On the hypercompetition numbers of hypergraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Hypergraph; Digraph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002592857,0.001527636,0.001020585,0.005315633,0.001775514,0.003221579,0.0019392,0.001806289,0.009510934],"category_scores_gemma":[0.01876081,0.0009424399,0.0008562266,0.004471722,0.005091432,0.008065592,0.002101401,0.004056599,0.001203542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003125136,"about_ca_system_score_gemma":0.001188838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001413984,"about_ca_topic_score_gemma":0.001409657,"domain_scores_codex":[0.9971049,0.0007485043,0.0001437297,0.000632311,0.0008516457,0.0005188487],"domain_scores_gemma":[0.9746962,0.02025526,0.001335556,0.001325654,0.001123249,0.001264071],"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.0002518633,0.00007754358,0.002017303,0.0003409339,0.00004896404,0.0002124622,0.000353902,0.02414247,0.003901852,0.9286677,0.005658718,0.03432642],"study_design_scores_gemma":[0.00005240921,0.0001041929,0.001878391,0.00014791,0.0000463444,0.000644247,0.0001385815,0.06390828,0.004005136,0.9179388,0.01106687,0.00006886282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3410377,0.01000128,0.4424841,0.003795856,0.0005852656,0.0003081243,0.002236616,0.0006403217,0.1989108],"genre_scores_gemma":[0.8486037,0.004978669,0.1289317,0.0007436345,0.0008184787,0.0006729849,0.001404009,0.0002504274,0.01359639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009510934,"threshold_uncertainty_score":0.03181726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02624788001298216,"score_gpt":0.2501475346993157,"score_spread":0.2238996546863335,"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."}}