{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087363,0.0007161822,0.001668515,0.001592385,0.001888201,0.004683231,0.002330187,0.002556591,0.01483766],"category_scores_gemma":[0.00721341,0.0007291673,0.0009046554,0.001898935,0.002250907,0.008675563,0.002947629,0.004063768,0.0009542038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002168186,"about_ca_system_score_gemma":0.001005732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008159151,"about_ca_topic_score_gemma":0.0009438773,"domain_scores_codex":[0.9991328,0.0002137321,0.00003207356,0.0001704583,0.0002607986,0.0001901729],"domain_scores_gemma":[0.9947476,0.003672901,0.0002862713,0.0004445505,0.0002474556,0.000601197],"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.0002479822,0.0001252506,0.0005597651,0.0001895895,0.00002553074,0.0001024304,0.0002784785,0.0048969,0.001657789,0.9708512,0.006031866,0.01503323],"study_design_scores_gemma":[0.00004601659,0.00001699612,0.0002010624,0.00001500674,0.00001431352,0.0000580314,0.00007586512,0.01120463,0.0003548418,0.986946,0.001059652,0.000007635525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7303087,0.001901529,0.1343306,0.009328006,0.000342253,0.0001543269,0.001088798,0.0006989272,0.1218467],"genre_scores_gemma":[0.9577941,0.001009397,0.02231162,0.0009009564,0.000389547,0.0002328635,0.0008518662,0.0002287852,0.0162808],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01483766,"threshold_uncertainty_score":0.0496369,"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."}}