{"id":"W2403154468","doi":"","title":"Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Competition (biology); Discrete mathematics; Biology","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.001295402,0.0005333493,0.0007565741,0.001385198,0.002104809,0.002813234,0.001237672,0.001440425,0.02242941],"category_scores_gemma":[0.0101411,0.0005662593,0.0006798572,0.001811487,0.001425045,0.00369416,0.001540019,0.001626684,0.00161916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001459336,"about_ca_system_score_gemma":0.002201024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004011844,"about_ca_topic_score_gemma":0.005783261,"domain_scores_codex":[0.9985396,0.000329374,0.0001047721,0.0003782714,0.0002630111,0.000384922],"domain_scores_gemma":[0.9890906,0.006186298,0.0009659041,0.000798695,0.001248769,0.001709715],"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.0004458444,0.0001677112,0.002862849,0.0003858558,0.00005640198,0.0007051072,0.0002660076,0.008725673,0.006042276,0.9430597,0.01822549,0.01905705],"study_design_scores_gemma":[0.0001804881,0.0001293724,0.002550203,0.00008654368,0.00006991311,0.001292922,0.0004864708,0.04455375,0.004365426,0.9212107,0.02501672,0.00005763244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4964812,0.0008070485,0.2372146,0.003028766,0.0003445364,0.000720662,0.009968734,0.001226647,0.2502079],"genre_scores_gemma":[0.9397489,0.0003384907,0.0340796,0.0006390834,0.0001089826,0.0003073927,0.004865403,0.000173539,0.01973861],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02242941,"threshold_uncertainty_score":0.07503384,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01341552056771734,"score_gpt":0.2833103321507263,"score_spread":0.269894811583009,"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."}}