{"id":"W1576493106","doi":"10.1007/978-3-540-85097-7_35","title":"Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Discrete mathematics; Computer science","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001322274,0.0008469974,0.0009737081,0.002518941,0.0004315127,0.0004131938,0.006930338,0.0004660536,0.00001405986],"category_scores_gemma":[0.0002180412,0.0008199583,0.0003128898,0.001687825,0.002291057,0.0009060585,0.001835194,0.001463845,0.0000431359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004963065,"about_ca_system_score_gemma":0.0009026126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000182822,"about_ca_topic_score_gemma":0.0001478344,"domain_scores_codex":[0.9932319,0.00007605922,0.0009037541,0.002629443,0.001510061,0.001648806],"domain_scores_gemma":[0.9946265,0.001877093,0.0003563353,0.002291059,0.0004704596,0.0003785288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009214609,0.0001314105,0.0002811543,0.0001206755,0.00003123127,0.0007115309,0.001433149,0.02007333,0.000649882,0.06003721,0.0002548126,0.9161835],"study_design_scores_gemma":[0.001887796,0.0005757246,0.0002677221,0.0008632041,0.000007660246,0.000283517,3.712589e-7,0.379272,0.001340503,0.586301,0.02737725,0.001823244],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001562673,0.000974919,0.9925151,0.0005906874,0.001183754,0.002071458,0.00003116253,0.0001882826,0.002288395],"genre_scores_gemma":[0.1825794,0.0007516998,0.8105084,0.003569797,0.0007778732,0.000412457,0.0000407127,0.0002106154,0.001149075],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9143602,"threshold_uncertainty_score":0.9994251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02943857393104914,"score_gpt":0.2795745616088338,"score_spread":0.2501359876777846,"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."}}