{"id":"W2028556486","doi":"10.1007/s00224-011-9333-8","title":"The Complexity of the List Homomorphism Problem for Graphs","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval; Concordia University; McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Homomorphism; Combinatorics; Mathematics; Algebraic number; Discrete mathematics; Computational complexity theory; Graph; Computer science; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.004921438,0.0001668691,0.0003412216,0.00008760834,0.0005902821,0.00004978219,0.003239865,0.00005264356,0.000001773141],"category_scores_gemma":[0.0001584688,0.00009624876,0.0002268834,0.0005636332,0.001924054,0.0001159661,0.0006105463,0.0001819808,0.000002096943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002361124,"about_ca_system_score_gemma":0.00007207795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005386514,"about_ca_topic_score_gemma":0.00000648249,"domain_scores_codex":[0.9972817,0.0009608248,0.0006117445,0.0002986725,0.0004257379,0.0004213023],"domain_scores_gemma":[0.9960842,0.001485594,0.0006193394,0.001354146,0.000397057,0.00005968],"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.00004991363,0.00004872679,0.0002382908,0.000133745,0.00004777887,3.552727e-7,0.002558144,0.0001199533,0.0006979476,0.993498,0.00009142636,0.002515671],"study_design_scores_gemma":[0.0003238625,0.0001442738,0.001237611,0.000187231,0.000009399439,0.00001814389,0.0003447894,0.01229394,0.004669146,0.9803484,0.0002952607,0.0001279021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06958145,0.0007362555,0.9192839,0.0002140008,0.001202314,0.001884021,0.00001762252,0.0001458922,0.006934594],"genre_scores_gemma":[0.9897566,0.000003421163,0.009908312,0.00001665173,0.00003527038,0.00002325908,4.677275e-7,0.00001642742,0.0002395552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9201752,"threshold_uncertainty_score":0.7089257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09207204870786918,"score_gpt":0.2876164445971816,"score_spread":0.1955443958893124,"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."}}