{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005414267,0.0001751238,0.0003243783,0.00005168079,0.000103222,0.00002982593,0.0007864214,0.00005266485,0.0000274709],"category_scores_gemma":[0.0001576866,0.00009260185,0.0001115915,0.0003035215,0.0003358388,0.00005829915,0.0002465591,0.0000977249,0.00003152992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001641345,"about_ca_system_score_gemma":0.00002545183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001303495,"about_ca_topic_score_gemma":0.000001240521,"domain_scores_codex":[0.9984996,0.0000271326,0.0004964408,0.000264087,0.0004645857,0.0002481936],"domain_scores_gemma":[0.9979147,0.0007035522,0.0004070532,0.0008061139,0.0001046565,0.00006391561],"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.000006575251,0.00009810994,0.00003017908,0.00007256889,0.00002733301,5.847513e-7,0.0007012995,0.000003942231,0.01323667,0.9845723,0.0002380702,0.00101237],"study_design_scores_gemma":[0.0004342738,0.00003914804,0.0001243793,0.0002458635,0.00001615886,0.000002545705,0.0001017259,0.003281822,0.02871522,0.9668655,0.00003007335,0.0001432523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7884271,0.00002331436,0.1846328,0.001218224,0.0002334152,0.0007492912,0.00003580216,0.0001969334,0.02448317],"genre_scores_gemma":[0.9276338,0.000006598058,0.07221446,0.00007432953,0.000002624566,0.00002361401,0.000001249064,0.00001364931,0.00002963423],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1392068,"threshold_uncertainty_score":0.3776194,"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."}}