{"id":"W2766367798","doi":"10.23638/dmtcs-20-2-4","title":"Complexity of locally-injective homomorphisms to tournaments","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Homomorphism; Injective function; Mathematics; Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001695529,0.0007914822,0.001423758,0.0006405615,0.001705951,0.007549355,0.003203371,0.002062159,0.01806814],"category_scores_gemma":[0.0161946,0.0008073501,0.001931842,0.001394389,0.002539781,0.01131885,0.003896292,0.003478359,0.001193634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00292049,"about_ca_system_score_gemma":0.001795682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003505963,"about_ca_topic_score_gemma":0.002907668,"domain_scores_codex":[0.9972312,0.0007382291,0.0001896958,0.0008498718,0.0003963136,0.0005946257],"domain_scores_gemma":[0.9837214,0.01154246,0.001189753,0.00151079,0.0005856507,0.001449864],"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.002954502,0.001230318,0.02428465,0.001861897,0.0004465698,0.00125738,0.00501691,0.1937682,0.01247919,0.6421322,0.02467388,0.08989441],"study_design_scores_gemma":[0.0003964182,0.0001643048,0.002668215,0.00005795416,0.0001540581,0.0005158719,0.00116421,0.1666347,0.004205128,0.8193156,0.004661401,0.00006229219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.89138,0.0006059764,0.07689434,0.004834204,0.0001118182,0.0002794808,0.002408931,0.001050632,0.02243461],"genre_scores_gemma":[0.9728961,0.0004002854,0.01619554,0.0003644637,0.0001628466,0.0001734297,0.002460844,0.0001882552,0.007158301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01806814,"threshold_uncertainty_score":0.06044394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04145060192530764,"score_gpt":0.3299344338413944,"score_spread":0.2884838319160868,"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."}}