{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00118636,0.0005434368,0.0005445717,0.0008614637,0.0003093409,0.000955598,0.002283301,0.0003341217,0.000006943123],"category_scores_gemma":[0.00009162138,0.0004890743,0.0001062681,0.0005152609,0.0006112607,0.0005262035,0.001689928,0.00101816,0.00004486329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009973159,"about_ca_system_score_gemma":0.0003877872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005388129,"about_ca_topic_score_gemma":0.00004933115,"domain_scores_codex":[0.995788,0.0000292198,0.0005338326,0.001847605,0.001090677,0.0007106488],"domain_scores_gemma":[0.9974924,0.0004131701,0.0003313152,0.001265952,0.0002664893,0.0002306796],"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.000006734133,0.00004128874,0.0009050179,0.000120064,0.00002726438,0.000127249,0.001337529,0.0190705,0.000333204,0.6254061,0.00005029856,0.3525747],"study_design_scores_gemma":[0.0003645004,0.0001754785,0.0001542205,0.000579729,0.0000108277,0.00007692449,2.257768e-7,0.2455211,0.0003131173,0.7512872,0.0007770249,0.0007395854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002352285,0.00146126,0.989722,0.0005925209,0.002221926,0.0003676575,0.000004508842,0.0002667931,0.003011067],"genre_scores_gemma":[0.6328183,0.0001753816,0.3643512,0.001479858,0.00008345709,0.000005664559,0.00000711831,0.00006564469,0.001013303],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.630466,"threshold_uncertainty_score":0.9997561,"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."}}