{"id":"W2146959334","doi":"10.1016/j.ejc.2007.11.012","title":"A dichotomy for minimum cost graph homomorphisms","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Algebra homomorphism; Line graph; Graph power","routes":{"ca_aff":true,"ca_fund":true,"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.001792768,0.0001709223,0.0002900922,0.0003933939,0.0002877434,0.00007622349,0.00198793,0.00002306114,0.00000534822],"category_scores_gemma":[0.0003134873,0.0001506236,0.0002476908,0.000844497,0.0001760727,0.0005946122,0.0002103117,0.0003901578,0.00003112811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005463593,"about_ca_system_score_gemma":0.0001241205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.07941e-7,"about_ca_topic_score_gemma":3.114657e-8,"domain_scores_codex":[0.9977773,0.0004512768,0.000544432,0.0002169669,0.0006065515,0.000403432],"domain_scores_gemma":[0.9976324,0.0003687227,0.0004305899,0.0005036708,0.0007488464,0.0003158062],"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.0002617585,0.0008058971,0.001721484,0.00004791731,0.0001525413,0.0049603,0.001379664,0.0001989001,0.001668074,0.9480988,0.02491073,0.01579397],"study_design_scores_gemma":[0.01294737,0.005616562,0.008935044,0.0001848994,0.00004627077,0.005951307,0.0001143164,0.001929247,0.005686984,0.6558422,0.3016421,0.001103769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05157327,0.0006313951,0.9411591,0.0004057447,0.001260784,0.0002950128,0.00000342635,0.00005584777,0.004615411],"genre_scores_gemma":[0.9825633,0.000221002,0.01638073,0.0001557245,0.0001244592,0.000004245762,7.153016e-7,0.00003815806,0.0005116249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.93099,"threshold_uncertainty_score":0.6142253,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0400559946199954,"score_gpt":0.2741690628301987,"score_spread":0.2341130682102033,"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."}}