{"id":"W2572121591","doi":"","title":"Neighbor sum distinguishing total choosability of a kind of sparse graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dense graph; Combinatorics; Graph; Line graph; Pathwidth","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.0007185196,0.0003657546,0.0007247833,0.0008264313,0.001210965,0.002213595,0.001429743,0.0012429,0.009171888],"category_scores_gemma":[0.005045488,0.0004680585,0.0007660383,0.00126069,0.001570106,0.00410152,0.001833022,0.002163416,0.0005246191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100914,"about_ca_system_score_gemma":0.0005381969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219659,"about_ca_topic_score_gemma":0.002125238,"domain_scores_codex":[0.9991544,0.0002048724,0.00004569665,0.0002363678,0.0002133176,0.000145253],"domain_scores_gemma":[0.9939452,0.003872235,0.00044324,0.0009979631,0.0002748582,0.0004664272],"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.0003041386,0.0001047325,0.002393872,0.0002064541,0.00004092529,0.0001969892,0.000344817,0.0106198,0.00609037,0.9471,0.008616993,0.02398073],"study_design_scores_gemma":[0.00006809963,0.00005522745,0.001558534,0.00002384242,0.00004818149,0.0004139689,0.0001822872,0.04824806,0.003286995,0.9415037,0.004585688,0.00002552976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7335905,0.0004773893,0.1852212,0.002692133,0.0002156277,0.0001062758,0.00166373,0.0005453054,0.07548784],"genre_scores_gemma":[0.9523276,0.0001976896,0.03446158,0.0004584804,0.0001471828,0.00007257276,0.001468758,0.0001780002,0.01068829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009171888,"threshold_uncertainty_score":0.03068298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01370193740466274,"score_gpt":0.2262964173756014,"score_spread":0.2125944799709386,"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."}}