{"id":"W2154562890","doi":"10.1007/s00373-009-0853-9","title":"Minimum Cost Homomorphism Dichotomy for Oriented Cycles","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Combinatorics; Digraph; Mathematics; Conjecture; Vertex (graph theory); Graph; Algebra homomorphism; Discrete mathematics; Graph homomorphism; Line graph; Graph power","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.0002898693,0.0001705826,0.0002014698,0.0002216227,0.0003170752,0.0001225501,0.0005951953,0.0000743147,0.000001907817],"category_scores_gemma":[0.00005630197,0.0001587298,0.00008652658,0.0008976046,0.0001041976,0.0003384531,0.0001091525,0.0001537419,0.000003602467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002199911,"about_ca_system_score_gemma":0.00003075182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002080714,"about_ca_topic_score_gemma":5.910804e-7,"domain_scores_codex":[0.9986159,0.00004234697,0.000188533,0.0004265592,0.0002763481,0.0004503424],"domain_scores_gemma":[0.9988804,0.0001785193,0.00006661787,0.0004898216,0.0001766261,0.0002079855],"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.00001858166,0.000114733,0.0006525428,0.000008294314,0.000008809053,0.00001013618,0.000116651,0.000001224199,0.0001897164,0.9698592,0.0007816748,0.0282384],"study_design_scores_gemma":[0.001150089,0.0003990921,0.00289946,0.00001252067,0.000005824257,0.00001077342,0.00003011565,0.00236014,0.000648575,0.9738629,0.01839961,0.0002208323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2660073,0.002537468,0.7210231,0.002621514,0.001257821,0.002074844,0.00003264436,0.0006802153,0.003765011],"genre_scores_gemma":[0.9944737,0.0002005204,0.004644912,0.0003084216,0.00001294256,0.00007685198,0.000006366621,0.00001101055,0.0002653016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7284663,"threshold_uncertainty_score":0.6472815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01796953592690599,"score_gpt":0.2812984227620912,"score_spread":0.2633288868351852,"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."}}