{"id":"W2125862453","doi":"10.1016/s0012-365x(01)00466-6","title":"On the injective chromatic number of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds pour la Formation de Chercheurs et l'Aide à la Recherche; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Injective function; Mathematics; Chromatic scale; Combinatorics; Graph; Discrete mathematics; Monomorphism; Upper and lower bounds; Hypercube; Critical graph; Context (archaeology); Line graph; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0001537699,0.0001247382,0.0001835685,0.00003453094,0.00004327012,0.00001448844,0.0001655598,0.00004279061,0.0005825274],"category_scores_gemma":[0.0000473065,0.00007834503,0.00009744853,0.0001903848,0.00006090426,0.00003718207,0.00001202528,0.00009728389,0.0002921654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009954559,"about_ca_system_score_gemma":9.089104e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.683943e-7,"about_ca_topic_score_gemma":5.591323e-7,"domain_scores_codex":[0.9993784,0.00003230634,0.0002329543,0.00006576638,0.0001561765,0.0001343457],"domain_scores_gemma":[0.9993042,0.000269121,0.00005283195,0.0003312705,0.00001588378,0.00002663497],"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.00000128643,0.00005213992,0.00005775954,0.0004172009,0.0001185392,0.000001828376,0.008427766,0.0004130401,0.0005491009,0.9877007,0.002143387,0.0001172455],"study_design_scores_gemma":[0.0003036033,0.00006869034,0.0001475601,0.0005754982,0.00007313305,0.00003898844,0.003839,0.1198024,0.00717573,0.8674098,0.0001853514,0.0003802759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8609872,0.00006517881,0.001216257,0.00002371892,0.0001182325,0.0002064324,0.00001124324,0.0001091406,0.1372626],"genre_scores_gemma":[0.9994625,0.000009270313,0.000254818,0.00001620082,0.00001164093,0.00002617491,8.126506e-7,0.00002552336,0.0001930985],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1384752,"threshold_uncertainty_score":0.6378267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01241056388756599,"score_gpt":0.2081247982007641,"score_spread":0.1957142343131981,"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."}}