{"id":"W2018547288","doi":"10.1002/jgt.10073","title":"Bi‐arc graphs and the complexity of list homomorphisms","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Graph; Line graph; Graph power","routes":{"ca_aff":true,"ca_fund":false,"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"],"consensus_categories":[],"category_scores_codex":[0.003983254,0.0001594503,0.0004320975,0.0005226178,0.0002276303,0.0000790503,0.001581321,0.0000542616,0.00008926597],"category_scores_gemma":[0.0003015385,0.00009637835,0.0003208532,0.0009474717,0.004097895,0.0005068326,0.0002719474,0.000514711,0.000003815684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001282757,"about_ca_system_score_gemma":0.00002135776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003999555,"about_ca_topic_score_gemma":0.000002157489,"domain_scores_codex":[0.9973715,0.0009596737,0.0005730355,0.0001840191,0.0006180585,0.0002936936],"domain_scores_gemma":[0.9972312,0.001097384,0.0005705381,0.0006027347,0.0003344554,0.0001636357],"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.0002075766,0.00009064998,0.0002673029,0.00001523659,0.00008187283,0.00003004153,0.0008199528,0.00001069466,0.000566686,0.9893486,0.0002758231,0.008285597],"study_design_scores_gemma":[0.001574702,0.0002287191,0.001049115,0.00004323839,0.00002041041,0.0003684611,0.0001407839,0.0006985355,0.0009346327,0.9945567,0.0002792408,0.0001055032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5284723,0.02699076,0.4194351,0.009487778,0.001235071,0.0007886961,0.0000242912,0.0001162265,0.0134498],"genre_scores_gemma":[0.99172,0.0009531116,0.006926532,0.0002134147,0.00003234343,0.000002318686,1.157632e-7,0.00001119648,0.0001410188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4632476,"threshold_uncertainty_score":0.9986124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0487071365618233,"score_gpt":0.2748106614581519,"score_spread":0.2261035248963286,"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."}}