{"id":"W2127188248","doi":"10.1016/j.dam.2007.09.023","title":"Minimum cost homomorphisms to semicomplete multipartite digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Multipartite; Combinatorics; Mathematics; Bipartite graph; Discrete mathematics; Graph; Directed graph; Graph homomorphism; Line graph; Voltage 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003508847,0.0003337066,0.0004299866,0.0002841436,0.0003653947,0.0001077934,0.001745968,0.00008234489,0.00003041105],"category_scores_gemma":[0.00008256431,0.0002986148,0.0001346265,0.001059201,0.0002441992,0.0002593785,0.0007063752,0.0002610378,0.0008471151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004995265,"about_ca_system_score_gemma":0.00004726319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002366269,"about_ca_topic_score_gemma":0.000002538511,"domain_scores_codex":[0.9973508,0.00003021726,0.0004950155,0.0006290593,0.000701502,0.0007934505],"domain_scores_gemma":[0.9974554,0.0003384741,0.0001447246,0.001540922,0.00009876068,0.0004217863],"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.00002833656,0.0001906753,0.00005389013,0.00007509635,0.00004767272,0.00007060928,0.005427134,0.0003623774,0.05406011,0.9347873,0.0018248,0.003072009],"study_design_scores_gemma":[0.003512879,0.0004077732,0.0008296107,0.0002152708,0.00004808174,0.0004531429,0.001207586,0.08770987,0.1177571,0.7564551,0.02831809,0.003085508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06559129,0.00003580389,0.9192026,0.0002646246,0.00009850955,0.001212046,0.00002584004,0.0004108918,0.01315845],"genre_scores_gemma":[0.5859754,0.00002356936,0.4127451,0.0004088097,0.00004466572,0.0003432487,0.00001095523,0.0000493024,0.0003989043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5203841,"threshold_uncertainty_score":0.9999466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0414669072239449,"score_gpt":0.2879542246788072,"score_spread":0.2464873174548622,"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."}}