{"id":"W4394913316","doi":"10.1016/j.tcs.2024.114580","title":"List homomorphisms to separable signed graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Agence Nationale de la Recherche; Univerzita Karlova v Praze; HORIZON EUROPE Framework Programme; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; European Commission","keywords":"Signed graph; Separable space; Homomorphism; Mathematics; Focus (optics); Combinatorics; Conjecture; Discrete mathematics; Chordal graph; Indifference graph; Pathwidth; Graph; Line 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.0008905389,0.0008417631,0.0007124474,0.003305505,0.001653433,0.003566765,0.001383199,0.001078556,0.01438037],"category_scores_gemma":[0.004711309,0.0006789197,0.0009192391,0.003152681,0.002166644,0.009113814,0.004104983,0.003301735,0.002494635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001535577,"about_ca_system_score_gemma":0.0007595305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006375111,"about_ca_topic_score_gemma":0.0007053118,"domain_scores_codex":[0.9990612,0.0002534662,0.00006274087,0.0002204729,0.0002361808,0.0001659491],"domain_scores_gemma":[0.9969708,0.001334776,0.0003858638,0.0003908621,0.0004173665,0.0005002187],"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.0000598729,0.00005502542,0.0001163669,0.00005612232,0.000006056899,0.00008956056,0.000465086,0.0005432674,0.0009709508,0.9791679,0.001694896,0.01677493],"study_design_scores_gemma":[0.00001859243,0.0000223809,0.00009720353,0.00001693871,0.00001073188,0.00009660846,0.0001506572,0.003100323,0.0009076439,0.9906176,0.004947104,0.00001413179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3294753,0.001221626,0.56994,0.003146325,0.001009465,0.0001910587,0.0008628159,0.002469541,0.09168384],"genre_scores_gemma":[0.8381138,0.001472682,0.0722511,0.001208513,0.0008071326,0.0002654928,0.0008853081,0.001103287,0.08389258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01438037,"threshold_uncertainty_score":0.04810709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01353134405805026,"score_gpt":0.3004726099934867,"score_spread":0.2869412659354364,"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."}}