{"id":"W1832761474","doi":"10.1007/978-3-540-78773-0_16","title":"Minimum Cost Homomorphisms to Reflexive Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Graph homomorphism; Graph; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516544,0.0005869757,0.0008210564,0.001168956,0.0006969592,0.002019857,0.001550312,0.0008201771,0.007564418],"category_scores_gemma":[0.003447817,0.0006661031,0.0007895134,0.001353276,0.001002105,0.003968413,0.001620541,0.002597784,0.0009662953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00130664,"about_ca_system_score_gemma":0.0005328311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003937001,"about_ca_topic_score_gemma":0.0007646883,"domain_scores_codex":[0.9993883,0.000155031,0.00003802105,0.0001483269,0.000177166,0.00009310366],"domain_scores_gemma":[0.9975849,0.001355835,0.0001341623,0.0004324991,0.0002299589,0.0002625703],"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.0001057518,0.00009152637,0.0001908845,0.0002786626,0.00002525872,0.0000743914,0.0002992726,0.009777335,0.004969592,0.9125646,0.00416523,0.06745758],"study_design_scores_gemma":[0.00003332944,0.00005344337,0.0001835999,0.0000317482,0.00002542146,0.0001387853,0.00009005242,0.01735266,0.003079321,0.9708553,0.008142187,0.00001419361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2179621,0.001414835,0.6886123,0.001294032,0.0003866219,0.0002401648,0.0007602684,0.001713322,0.08761642],"genre_scores_gemma":[0.7503868,0.001429931,0.2032291,0.0003380351,0.0002813235,0.000297743,0.0007169399,0.0006103112,0.04270984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007564418,"threshold_uncertainty_score":0.02530551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0334414931792028,"score_gpt":0.3030028647787649,"score_spread":0.2695613715995621,"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."}}