{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001817307,0.0009469705,0.001409711,0.001234499,0.0002827186,0.0006532608,0.007038863,0.0007825462,0.00005022876],"category_scores_gemma":[0.0001460801,0.0008978696,0.0007905806,0.0007642431,0.0004744317,0.002906528,0.004757823,0.001627906,0.0002256942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001728205,"about_ca_system_score_gemma":0.0004068867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001799024,"about_ca_topic_score_gemma":0.000007535707,"domain_scores_codex":[0.9938241,0.0002077553,0.002204206,0.0009104151,0.001428899,0.001424671],"domain_scores_gemma":[0.9919629,0.0003023687,0.001600023,0.004574469,0.001082509,0.0004777124],"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.0008720364,0.002138694,0.003157443,0.008727442,0.001495527,0.00004210215,0.01585024,0.0116047,0.0008563139,0.9085799,0.004473557,0.042202],"study_design_scores_gemma":[0.008398527,0.002279249,0.000840826,0.001516805,0.0001841386,0.0001250552,0.00140153,0.3853322,0.011564,0.5602165,0.02416727,0.003973871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1281449,0.0001959509,0.8595405,0.0002060421,0.002185336,0.003943401,0.002217282,0.0005085125,0.003058057],"genre_scores_gemma":[0.8563431,0.0001911038,0.1398183,0.0007104994,0.0001350654,0.0004018608,0.001915505,0.0001529728,0.0003316577],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7281982,"threshold_uncertainty_score":0.9993472,"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."}}