{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001036129,0.0008187953,0.0008084145,0.002463465,0.0005586406,0.0004977529,0.007799342,0.0003947787,0.00003356254],"category_scores_gemma":[0.0002183253,0.0007736694,0.0002481653,0.002269594,0.00189727,0.0008481074,0.003288812,0.001423207,0.0003479273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004841459,"about_ca_system_score_gemma":0.0007613095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001236142,"about_ca_topic_score_gemma":0.00004969072,"domain_scores_codex":[0.9929693,0.0000792277,0.0006745572,0.002739453,0.002044542,0.001492868],"domain_scores_gemma":[0.9946123,0.0009097276,0.0002632577,0.003008494,0.0005355754,0.0006706818],"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.00004441425,0.00006817067,0.00003466323,0.00003094138,0.00002534792,0.0009814424,0.001882299,0.01982399,0.0004523748,0.09516388,0.0003797746,0.8811127],"study_design_scores_gemma":[0.0008901515,0.001190204,0.0002032955,0.0008237929,0.00001115944,0.0006896956,6.002213e-7,0.08537768,0.006494615,0.8646467,0.03682959,0.002842467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001007377,0.0005440828,0.9863424,0.001113303,0.001544007,0.001151054,0.00001718161,0.000292204,0.008895085],"genre_scores_gemma":[0.1082634,0.0003732149,0.8811434,0.006192653,0.0008212911,0.0001115196,0.00001371747,0.0001541018,0.00292666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8782702,"threshold_uncertainty_score":0.9994714,"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."}}