{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008410246,0.0001713166,0.0002688749,0.0001131118,0.0002956386,0.0000875148,0.001187321,0.0000514058,0.00001013791],"category_scores_gemma":[0.000272055,0.00008695156,0.0001078954,0.0004654172,0.001848518,0.0002481005,0.0004654647,0.00009785984,0.00001280416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357462,"about_ca_system_score_gemma":0.00002839213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002057179,"about_ca_topic_score_gemma":0.000006575485,"domain_scores_codex":[0.9984018,0.0001367076,0.0003675484,0.0002793114,0.0004338606,0.0003807399],"domain_scores_gemma":[0.997546,0.0009850622,0.0002109296,0.0009927124,0.0001438416,0.0001214466],"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.00001146056,0.0000361019,0.00004752133,0.00003881082,0.00003041334,0.000003008711,0.0005230812,7.162641e-7,0.007449665,0.9869259,0.0001065319,0.004826817],"study_design_scores_gemma":[0.0003766684,0.000109235,0.0004096749,0.00006197707,0.000007752993,0.00001311975,0.0001313002,0.001056243,0.007588751,0.9899536,0.0001489767,0.0001426575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0369588,0.0002726564,0.9582394,0.001978965,0.0000975041,0.000432495,0.00002399083,0.0001040193,0.001892102],"genre_scores_gemma":[0.9079445,0.0001185573,0.09150285,0.00003175381,0.00001627754,0.00003599926,8.840324e-7,0.00002023464,0.0003289274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8709857,"threshold_uncertainty_score":0.6810941,"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."}}