{"id":"W2404038546","doi":"","title":"On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510381,0.00009307024,0.0001908204,0.00002567318,0.0001734413,0.00003454037,0.000600214,0.00005369418,0.00001793715],"category_scores_gemma":[0.0002929849,0.00005034644,0.00006961061,0.0003168512,0.001427538,0.00006597267,0.0002062112,0.0002800919,0.000002428147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003604162,"about_ca_system_score_gemma":0.00003125987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003426834,"about_ca_topic_score_gemma":0.00002599581,"domain_scores_codex":[0.9989913,0.0002236792,0.0002485621,0.0001916242,0.000216801,0.0001281091],"domain_scores_gemma":[0.9978828,0.0009768563,0.000168802,0.0007586895,0.0001714245,0.00004143347],"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.00001514122,0.00007578447,0.005820614,0.000009719703,0.00001081814,2.632569e-7,0.0003671129,0.000001175402,0.001046789,0.9922482,0.0003321771,0.00007220414],"study_design_scores_gemma":[0.0006115959,0.0000376711,0.006251063,0.00001622992,0.000005303957,0.000003640316,0.00001589826,0.00141969,0.005165187,0.9863876,0.00002942453,0.00005669393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9944104,0.00002016039,0.00003227519,0.003079351,0.0006513026,0.0001881473,0.000001918002,0.00003007715,0.001586401],"genre_scores_gemma":[0.9989828,0.000004670663,0.0007857485,0.0002030622,3.451813e-7,0.000007639765,3.624496e-7,0.000003774156,0.00001160175],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005860599,"threshold_uncertainty_score":0.5259821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01872638316445307,"score_gpt":0.2443311298134413,"score_spread":0.2256047466489882,"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."}}