{"id":"W2033972173","doi":"10.7151/dmgt.1205","title":"On maximal finite antichains in the homomorphism order of directed graphs","year":2003,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Algebra homomorphism; Tree (set theory); Discrete mathematics; Order (exchange); Dual (grammatical number)","routes":{"ca_aff":true,"ca_fund":false,"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.0033234,0.0003233768,0.0004495475,0.0007697557,0.0002291647,0.00006987309,0.001749199,0.00009942886,0.0001178896],"category_scores_gemma":[0.001815552,0.00016896,0.0002250577,0.003307805,0.0005245638,0.0002914711,0.0001569174,0.0004107998,0.00004867531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001409381,"about_ca_system_score_gemma":0.00005453547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001374628,"about_ca_topic_score_gemma":0.000003054848,"domain_scores_codex":[0.9958093,0.001700216,0.0005763974,0.0005255843,0.0008032522,0.0005852945],"domain_scores_gemma":[0.9947539,0.003163509,0.0002116669,0.001634574,0.000131928,0.0001044078],"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.00004826229,0.0006417391,0.000157877,0.00006087107,0.00002708971,0.00003281137,0.003534158,0.00006835184,0.0003915595,0.99387,0.00006084825,0.001106398],"study_design_scores_gemma":[0.0005444479,0.000138194,0.0008637914,0.0001688773,0.00001062126,0.00002389214,0.0009317153,0.0008962928,0.0009900843,0.9951211,0.00006406048,0.0002469599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2692657,0.0004329945,0.6999589,0.001189201,0.0003405627,0.001647806,0.00002444621,0.0003925875,0.02674788],"genre_scores_gemma":[0.9844428,0.00003765203,0.01489554,0.0002206917,0.000005597584,0.0001182974,0.00000323069,0.0000311663,0.0002449624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7151772,"threshold_uncertainty_score":0.6889989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01911656552065495,"score_gpt":0.2735449358042366,"score_spread":0.2544283702835817,"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."}}