{"id":"W2741433091","doi":"","title":"Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Partition (number theory); Transitive relation; Algebra homomorphism; Vertex (graph theory); Graph homomorphism; Discrete mathematics; 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.001374863,0.0007069575,0.001085632,0.001113984,0.0006948589,0.002836707,0.001726065,0.001267939,0.005736338],"category_scores_gemma":[0.009291291,0.0007305667,0.001317317,0.00168891,0.001845364,0.006820255,0.001706291,0.002432859,0.0003748022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002607777,"about_ca_system_score_gemma":0.001267823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00166278,"about_ca_topic_score_gemma":0.001959276,"domain_scores_codex":[0.9982942,0.0005264418,0.0001197249,0.0005341343,0.0002970279,0.0002284501],"domain_scores_gemma":[0.989795,0.007100394,0.0008337694,0.001367456,0.0003706101,0.0005327998],"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.0004788257,0.000402747,0.003204846,0.0005805371,0.0001251118,0.0002989477,0.0008360172,0.1851669,0.005404498,0.7173215,0.006055265,0.08012489],"study_design_scores_gemma":[0.00009784928,0.0001205242,0.001299475,0.00003710071,0.00004464756,0.0002694113,0.0002598911,0.2367143,0.00206383,0.755999,0.003064676,0.00002937615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4297611,0.001335179,0.5498804,0.002352017,0.00007425009,0.000356445,0.001830509,0.0006118764,0.01379821],"genre_scores_gemma":[0.8398302,0.0011617,0.1496912,0.000244085,0.0001816777,0.0003831184,0.002066659,0.0001031394,0.006338209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005736338,"threshold_uncertainty_score":0.01919001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01430524002511131,"score_gpt":0.2726525584143579,"score_spread":0.2583473183892466,"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."}}