{"id":"W2200162493","doi":"10.1016/j.disc.2016.08.005","title":"The complexity of signed graph and edge-coloured graph homomorphisms","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Homomorphism; Mathematics; Combinatorics; Discrete mathematics; Graph homomorphism; Vertex (graph theory); Conjecture; Graph; Line graph; Voltage graph","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.001934297,0.0009067873,0.001740111,0.001905028,0.001616571,0.007513321,0.00375614,0.002769286,0.0136774],"category_scores_gemma":[0.01994664,0.0008022992,0.001736352,0.002833288,0.004184862,0.01971603,0.004234721,0.004605811,0.0009951773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003953636,"about_ca_system_score_gemma":0.002013789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606297,"about_ca_topic_score_gemma":0.002263832,"domain_scores_codex":[0.9966606,0.0009182853,0.0001778258,0.0006494086,0.001051723,0.0005422049],"domain_scores_gemma":[0.9755893,0.01822203,0.001806088,0.001933267,0.001003468,0.001445795],"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.0004610883,0.000170624,0.002395936,0.000253946,0.00006276253,0.0001718597,0.0006677722,0.04073751,0.00183381,0.9277437,0.005619662,0.01988132],"study_design_scores_gemma":[0.00003597836,0.00002215146,0.0004301266,0.0000133912,0.00001877986,0.00007504893,0.0000935584,0.0595971,0.0005209756,0.9383006,0.0008722278,0.00002006906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7321886,0.001580322,0.2103491,0.007655545,0.0003113431,0.0001353281,0.00232089,0.0005562276,0.04490254],"genre_scores_gemma":[0.9644627,0.0008586218,0.02212816,0.0003631439,0.0003629528,0.0001342257,0.001387822,0.0002060228,0.0100964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0136774,"threshold_uncertainty_score":0.04575551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0429401250024845,"score_gpt":0.2891177170639073,"score_spread":0.2461775920614228,"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."}}