{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003790515,0.000152354,0.0002305755,0.0003557352,0.0001573825,0.00006132235,0.0007829284,0.0000697628,0.00001760765],"category_scores_gemma":[0.00007050329,0.0001590757,0.0001140604,0.001118893,0.0001304676,0.0007575068,0.00009704184,0.0002031465,0.00002824776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003509523,"about_ca_system_score_gemma":0.00003273246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000719454,"about_ca_topic_score_gemma":0.000001495289,"domain_scores_codex":[0.998385,0.0001537436,0.0003069495,0.000352356,0.0004618907,0.0003401096],"domain_scores_gemma":[0.9987153,0.0001878592,0.0001571413,0.0006637617,0.0001637175,0.0001122548],"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.00001017547,0.0001080665,0.001280759,0.000009958198,0.00001101743,0.000007786862,0.0001655549,0.00001367857,0.01086198,0.979191,0.0001064475,0.008233571],"study_design_scores_gemma":[0.0006252868,0.000270444,0.02599212,0.00004307952,0.000004118977,0.000008334117,0.00002058981,0.0004789422,0.01344281,0.9588425,0.0001151756,0.0001565788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9730453,0.0002579718,0.01965483,0.0004978182,0.0007691596,0.0003413921,0.000005675688,0.0002848724,0.00514296],"genre_scores_gemma":[0.9964532,0.00004932486,0.003316555,0.0001253766,0.000003110524,0.00001020306,0.00001048004,0.000008192995,0.00002359832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02471136,"threshold_uncertainty_score":0.648692,"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."}}