{"id":"W2960283505","doi":"10.1007/978-3-030-25070-6_4","title":"Strongly n-e.c. Graphs and Independent Distinguishing Labellings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University; University of Saskatchewan","funders":"","keywords":"Countable set; Adjacency list; Enumeration; Combinatorics; Vertex (graph theory); Discrete mathematics; Probabilistic logic; Computer science; Graph; Mathematics; Artificial intelligence","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.00114013,0.0008051601,0.0006613381,0.001391907,0.002044863,0.002370052,0.00125075,0.001856,0.007557448],"category_scores_gemma":[0.00574328,0.0008363234,0.001071393,0.001751743,0.003389003,0.004161912,0.001937151,0.004603725,0.002143042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00223045,"about_ca_system_score_gemma":0.001044912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001399378,"about_ca_topic_score_gemma":0.001729145,"domain_scores_codex":[0.9989447,0.0002345498,0.000050048,0.0003913794,0.0002184389,0.0001609231],"domain_scores_gemma":[0.9912667,0.005702343,0.0005656478,0.001271289,0.0007918346,0.0004021638],"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.00006180993,0.00002156145,0.0002056909,0.00007338193,0.000005320654,0.0000731988,0.00009724447,0.002541402,0.0010672,0.9707566,0.006789134,0.01830737],"study_design_scores_gemma":[0.000008454054,0.000007104798,0.000189225,0.00001589856,0.000005450587,0.0001231598,0.00002366981,0.004559866,0.0006925515,0.9888796,0.005486894,0.000008197234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1259269,0.001782271,0.4824955,0.005351386,0.0004625266,0.0001470234,0.001994202,0.000798277,0.3810419],"genre_scores_gemma":[0.7071663,0.001739241,0.1829811,0.002056592,0.0004756438,0.00035576,0.002267637,0.0005178139,0.1024398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007557448,"threshold_uncertainty_score":0.0252822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01359819183333387,"score_gpt":0.2231363074469879,"score_spread":0.209538115613654,"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."}}