{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542645,0.0006947857,0.00104694,0.001680756,0.001340005,0.004629345,0.002550878,0.001862754,0.008861952],"category_scores_gemma":[0.01255299,0.0007339704,0.001333409,0.002662767,0.002008346,0.01234127,0.002554475,0.002560691,0.000663012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003177403,"about_ca_system_score_gemma":0.001717641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00365841,"about_ca_topic_score_gemma":0.002609501,"domain_scores_codex":[0.9970698,0.0008473305,0.0002350927,0.0007956306,0.0005270856,0.0005249192],"domain_scores_gemma":[0.9724844,0.02084452,0.002109478,0.00202665,0.001229967,0.001305073],"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.002285407,0.001344341,0.01661338,0.002271108,0.0004294068,0.0009856003,0.003015141,0.3876023,0.01806883,0.4218168,0.02031914,0.1252486],"study_design_scores_gemma":[0.0002098976,0.0001340041,0.002360842,0.00006622291,0.0001126205,0.0004577214,0.0007234256,0.3887682,0.0053932,0.5965469,0.005147039,0.0000799785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8097314,0.0009172129,0.1647372,0.004622635,0.00009111419,0.0003119432,0.004551261,0.001788954,0.01324825],"genre_scores_gemma":[0.945365,0.0005611283,0.0470975,0.0003034891,0.0001168673,0.0001951895,0.003137041,0.0001809051,0.003042907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008861952,"threshold_uncertainty_score":0.02964622,"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."}}