{"id":"W2560469491","doi":"10.1016/j.dam.2016.10.028","title":"On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Graph; Neighbourhood (mathematics); Discrete mathematics; Bound graph; Natural number; Graph power; Line graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003445071,0.001378261,0.002077524,0.002489656,0.003053635,0.009905562,0.006461123,0.00307303,0.01345073],"category_scores_gemma":[0.02849469,0.001369013,0.001953712,0.003797687,0.005525807,0.01497618,0.004871454,0.006659074,0.000947601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006144777,"about_ca_system_score_gemma":0.003777279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004163256,"about_ca_topic_score_gemma":0.0053291,"domain_scores_codex":[0.99529,0.001577781,0.000208693,0.001159085,0.0009280196,0.0008363363],"domain_scores_gemma":[0.9429084,0.0483496,0.00237268,0.002989122,0.001319147,0.00206101],"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.001751471,0.0006896502,0.0155385,0.0007939975,0.0002055644,0.0002641147,0.001541649,0.1593321,0.005427966,0.7479038,0.0185225,0.0480288],"study_design_scores_gemma":[0.0001436152,0.00007016823,0.002145466,0.00004423531,0.00008636463,0.0001627647,0.0003641516,0.2378297,0.001263403,0.7559839,0.001861959,0.00004421354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7717477,0.002086658,0.1642537,0.01270092,0.0003596801,0.0002244,0.003093055,0.000828606,0.0447053],"genre_scores_gemma":[0.9453797,0.0008814936,0.04243636,0.0006707313,0.000462933,0.000227724,0.002176589,0.000309326,0.007455107],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01345073,"threshold_uncertainty_score":0.04499722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03271396001853293,"score_gpt":0.2527626002009583,"score_spread":0.2200486401824254,"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."}}