{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00325734,0.001281758,0.003179847,0.002548046,0.003426527,0.008133502,0.004640635,0.005881261,0.02212307],"category_scores_gemma":[0.02169432,0.001426413,0.001943959,0.003076507,0.005419374,0.01898648,0.007264507,0.01103671,0.002195683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003952605,"about_ca_system_score_gemma":0.00149672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006697451,"about_ca_topic_score_gemma":0.0005568537,"domain_scores_codex":[0.9964615,0.001050532,0.0001443536,0.0008498632,0.000841087,0.0006526884],"domain_scores_gemma":[0.9764245,0.0187992,0.0008031935,0.001613483,0.0006789113,0.001680703],"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.0002880353,0.0001407648,0.000334481,0.0002140107,0.0000287341,0.0000699871,0.0002538305,0.004174164,0.001144114,0.9697382,0.008871938,0.01474177],"study_design_scores_gemma":[0.00005237043,0.00002780832,0.0001205674,0.00002060401,0.0000150088,0.00007059758,0.00005241655,0.01108717,0.0002223059,0.9871221,0.001198645,0.00001048189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4528995,0.003617724,0.3350046,0.04944945,0.001051747,0.0002621092,0.002003561,0.001586067,0.1541254],"genre_scores_gemma":[0.9201861,0.001743358,0.04786138,0.003605007,0.00135265,0.0005181956,0.001160529,0.0004580309,0.02311479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02212307,"threshold_uncertainty_score":0.07400906,"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."}}