{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003958643,0.001143191,0.001998137,0.002632625,0.003115015,0.007430574,0.004682307,0.003869316,0.02228065],"category_scores_gemma":[0.03750234,0.001346084,0.002047393,0.004582615,0.006462255,0.01774019,0.004432445,0.005950502,0.001573894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004766277,"about_ca_system_score_gemma":0.002382473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004420025,"about_ca_topic_score_gemma":0.004046134,"domain_scores_codex":[0.9960217,0.001373462,0.0001829746,0.0007999415,0.0007518143,0.000870089],"domain_scores_gemma":[0.9418017,0.0497387,0.002516586,0.003369668,0.0009595201,0.00161387],"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.0005374991,0.0001967877,0.004210128,0.0004381597,0.00009906815,0.0001809628,0.0005069044,0.04142085,0.001444443,0.8962414,0.02283548,0.03188829],"study_design_scores_gemma":[0.00007190934,0.00002626856,0.001113884,0.00005127502,0.00005574089,0.0001964334,0.0001911852,0.04402647,0.0007124741,0.9503484,0.003166367,0.00003961762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6155777,0.007147247,0.1788227,0.02147684,0.0009151166,0.0002723616,0.005222985,0.001357009,0.169208],"genre_scores_gemma":[0.9499438,0.002716533,0.03095888,0.0008290503,0.0007520813,0.0002426916,0.002239396,0.0004605139,0.011857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02228065,"threshold_uncertainty_score":0.07453626,"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."}}