{"id":"W4312849998","doi":"10.1007/978-3-031-20624-5_31","title":"Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Combinatorics; Conjecture; Mathematics; Discrete mathematics; Graph homomorphism; Bipartite graph; Graph; Line graph","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.001052152,0.000544894,0.0007342694,0.001913471,0.002501247,0.005080834,0.00120904,0.001209261,0.01083157],"category_scores_gemma":[0.003874255,0.0005863248,0.0009105187,0.002337824,0.003298342,0.01092889,0.002211414,0.004294459,0.001122822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002181586,"about_ca_system_score_gemma":0.001000371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008168567,"about_ca_topic_score_gemma":0.001112614,"domain_scores_codex":[0.9991586,0.0002051245,0.0000496774,0.0001611231,0.0002474623,0.0001780121],"domain_scores_gemma":[0.9977531,0.001467256,0.0001622547,0.0002258546,0.0001962073,0.0001952866],"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.00005975427,0.00002850432,0.0001129618,0.00003734597,0.000003608761,0.00003102338,0.0002222098,0.0003610367,0.0004304776,0.9874541,0.002234718,0.009024274],"study_design_scores_gemma":[0.000008320394,0.000008352687,0.00008489018,0.000009813005,0.000003618958,0.00003822504,0.00007675116,0.00132458,0.0002825337,0.9960797,0.002076762,0.000006407924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.387062,0.004448928,0.2315218,0.008661102,0.00119612,0.0001244351,0.001478637,0.001118709,0.3643882],"genre_scores_gemma":[0.8937876,0.001851168,0.03846265,0.001291746,0.0007854,0.0001786919,0.001083348,0.0003911099,0.06216831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01083157,"threshold_uncertainty_score":0.03623521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.016646946668138,"score_gpt":0.2586985705551679,"score_spread":0.2420516238870299,"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."}}