{"id":"W2973098730","doi":"10.4230/lipics.mfcs.2020.20","title":"Homomorphisms of signed graphs: An update","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Grantová Agentura, Univerzita Karlova; European Commission; Univerzita Karlova v Praze","keywords":"Signed graph; Combinatorics; Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Adjacency list; Graph; 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.001508854,0.0007271279,0.0006720485,0.002043683,0.001330331,0.003299454,0.001924363,0.0009981756,0.01553258],"category_scores_gemma":[0.009950192,0.0007541846,0.001308441,0.002421015,0.001985478,0.01144917,0.003105649,0.003489126,0.004263123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001899312,"about_ca_system_score_gemma":0.001071514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00191353,"about_ca_topic_score_gemma":0.002262954,"domain_scores_codex":[0.9983753,0.0003189707,0.0001245949,0.0006056086,0.0004687993,0.0001066789],"domain_scores_gemma":[0.9961767,0.001279571,0.0001411425,0.001578111,0.0006788861,0.0001454682],"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.0001000437,0.00009961789,0.0005872131,0.0001981721,0.00003098091,0.0001438438,0.000307168,0.003767295,0.002497867,0.7482457,0.02403051,0.2199915],"study_design_scores_gemma":[0.00002976482,0.00007998028,0.0006906073,0.0000851825,0.00005526352,0.0006060808,0.0001689695,0.02927938,0.004832706,0.7791609,0.1849504,0.00006086372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02543602,0.004315428,0.8823202,0.004319855,0.004414254,0.0002027265,0.002019678,0.002314804,0.07465705],"genre_scores_gemma":[0.3010892,0.006162953,0.626123,0.00201323,0.004249156,0.0002683848,0.00291009,0.00130231,0.05588169],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01553258,"threshold_uncertainty_score":0.05196166,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02473593597194896,"score_gpt":0.2980308278716488,"score_spread":0.2732948918996999,"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."}}