{"id":"W20688002","doi":"","title":"Minimum cost homomorphisms to oriented cycles with some loops","year":2009,"lang":"en","type":"article","venue":"Computing: The Australasian Theory Symposium","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Partition (number theory); Algebra homomorphism; Mathematics; Loop (graph theory); Discrete mathematics; Vertex (graph theory); Graph homomorphism; Directed graph; Graph; Line graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00161599,0.000541208,0.0004589616,0.0003700761,0.0007842036,0.0004271078,0.003882785,0.0001244365,0.00001998423],"category_scores_gemma":[0.00009727877,0.0003743106,0.0001631816,0.001713792,0.0005051446,0.0006684847,0.0006271845,0.0006620953,0.0003012024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001291755,"about_ca_system_score_gemma":0.0001368973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002868208,"about_ca_topic_score_gemma":0.000001499884,"domain_scores_codex":[0.9955602,0.0006880667,0.0004953974,0.00108902,0.0007754625,0.001391871],"domain_scores_gemma":[0.9960715,0.000631105,0.0002193757,0.002275099,0.0002299851,0.0005729558],"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.0002921839,0.0002314913,0.0001695384,0.00001167837,0.00006430182,0.0001495077,0.002214439,0.004918423,0.008257275,0.9563887,0.0008398331,0.02646266],"study_design_scores_gemma":[0.004361947,0.00498795,0.01663011,0.0005805769,0.0001231439,0.001343325,0.001753431,0.01421754,0.07465491,0.8651864,0.0130554,0.003105266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2135203,0.0001389446,0.7547222,0.0210738,0.0007771474,0.002189464,0.00001361408,0.001067026,0.006497537],"genre_scores_gemma":[0.9838102,0.000006446651,0.01194981,0.002125146,0.0002921447,0.00002425397,0.000006464712,0.00004690886,0.001738608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7702899,"threshold_uncertainty_score":0.9998709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01475483218754116,"score_gpt":0.2761076520725751,"score_spread":0.261352819885034,"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."}}