{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004120796,0.000319914,0.0003771954,0.0009544952,0.0007956545,0.001030887,0.0007764568,0.0007282353,0.003780171],"category_scores_gemma":[0.004598949,0.0002828627,0.0004527666,0.000832426,0.0007773923,0.001613149,0.001222933,0.000725004,0.0003448598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007249743,"about_ca_system_score_gemma":0.0003985083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000953361,"about_ca_topic_score_gemma":0.001069535,"domain_scores_codex":[0.9996064,0.0001051621,0.00002756336,0.00008406281,0.00007530349,0.0001015695],"domain_scores_gemma":[0.9979448,0.001152592,0.0002384989,0.0002234884,0.0002118766,0.0002287448],"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.0004894591,0.0002502925,0.003487103,0.0003728576,0.00009870448,0.001813897,0.001646312,0.07931995,0.01019916,0.8083416,0.006705509,0.08727518],"study_design_scores_gemma":[0.000078591,0.0001038184,0.0009076963,0.00002933663,0.00003727652,0.0005722683,0.0003219676,0.1456016,0.002928605,0.8428386,0.006555844,0.00002433273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8128856,0.0003921156,0.1632298,0.00091183,0.0001118615,0.0001449139,0.0003763023,0.0004351392,0.02151246],"genre_scores_gemma":[0.9520702,0.0001869291,0.03863323,0.0001542056,0.00008953889,0.00008553824,0.0003270017,0.00008445232,0.008368922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003780171,"threshold_uncertainty_score":0.0126459,"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."}}