{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.004124864,0.0007278239,0.001178251,0.0009077682,0.0005208816,0.0008672911,0.012526,0.0002382375,0.0001127011],"category_scores_gemma":[0.0006428977,0.0006124375,0.0003587612,0.002273448,0.015244,0.0005238659,0.02172864,0.001015797,0.000171414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002556918,"about_ca_system_score_gemma":0.0005629954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006616105,"about_ca_topic_score_gemma":0.000001435296,"domain_scores_codex":[0.9920354,0.0003426805,0.00118762,0.002060855,0.002976953,0.001396519],"domain_scores_gemma":[0.9921464,0.0006422906,0.0005857574,0.0040865,0.001607436,0.0009316429],"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.00002529125,0.0002397078,0.00001048035,0.0001810902,0.00004503766,0.0000194451,0.002731212,0.0004937811,0.0004475392,0.993356,0.000066474,0.002383928],"study_design_scores_gemma":[0.0001598685,0.0004231294,0.00006731699,0.0004531757,0.0000139237,0.00002260675,0.00003597067,0.3424965,0.006365954,0.6495081,0.000007829864,0.0004456401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02134777,0.00002660811,0.9701828,0.0006920331,0.0009751089,0.001295494,0.00005735662,0.0002273227,0.005195502],"genre_scores_gemma":[0.4963036,0.00000363852,0.5033509,0.0001649503,0.00009880334,0.00003772139,0.000002963189,0.0000279202,0.000009519264],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4749559,"threshold_uncertainty_score":0.9996327,"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."}}