{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002734919,0.0002771153,0.0002607187,0.0008471514,0.0005900859,0.001815162,0.004958016,0.00005963719,0.0001446289],"category_scores_gemma":[0.0001422558,0.0002270195,0.0001263768,0.006612454,0.00322137,0.001365264,0.002196584,0.0003798002,0.001025272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001127902,"about_ca_system_score_gemma":0.0002492324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003529707,"about_ca_topic_score_gemma":5.960148e-7,"domain_scores_codex":[0.9955251,0.0001676527,0.0003122338,0.001467115,0.001332265,0.001195615],"domain_scores_gemma":[0.9968532,0.0006177191,0.00002317119,0.001463936,0.000241734,0.0008002931],"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.000009417495,0.00003489327,0.000004637069,0.00001306863,0.00000550578,0.000114795,0.0003590607,0.0001962631,0.004749629,0.9585443,0.0003368308,0.03563164],"study_design_scores_gemma":[0.00007447589,0.0002840638,0.00004239492,0.00005718779,0.000002506479,0.00006785957,0.000003559774,0.2664503,0.008069033,0.7235078,0.001165916,0.0002749985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0127118,0.0001571902,0.9741113,0.002436832,0.00120227,0.0003405529,0.000003805766,0.0009134558,0.008122814],"genre_scores_gemma":[0.8304865,0.000004612356,0.1684061,0.0008500518,0.00009548887,0.00002711247,5.531143e-7,0.00001781346,0.0001117773],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8177747,"threshold_uncertainty_score":0.9997525,"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."}}