{"id":"W1909458272","doi":"10.3968/j.sms.1923845220110302.220","title":"A Class of ‘n’ Distant Graceful Trees","year":2011,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Tree (set theory); Integer (computer science); Discrete mathematics; Computer science; Graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011591,0.00009274032,0.0002467443,0.0001112992,0.000107987,0.00001793802,0.0007120029,0.00002298084,0.00001499743],"category_scores_gemma":[0.0003488367,0.00005653785,0.00004714253,0.0008069679,0.001330282,0.0001811649,0.000328475,0.00005575276,0.00001724067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009707315,"about_ca_system_score_gemma":0.00002257649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268483,"about_ca_topic_score_gemma":0.00002183987,"domain_scores_codex":[0.9987355,0.00004906346,0.0003461466,0.0002756483,0.0003475262,0.0002461475],"domain_scores_gemma":[0.9992949,0.0002611004,0.00009011143,0.0002520428,0.00005926718,0.0000426283],"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.00000130944,0.000112078,0.0007870347,0.00003667509,0.000008123848,0.000004593074,0.007696856,0.000005239358,0.0001264979,0.990321,0.00009796571,0.0008025589],"study_design_scores_gemma":[0.00009194754,0.0001354389,0.0004223922,0.0001259835,0.00000317167,0.000003786219,0.001806619,0.003650391,0.001066964,0.9925871,0.00002140769,0.00008482117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8563766,0.003868934,0.03733275,0.001484252,0.0009305285,0.0004374743,0.000001700147,0.0002363179,0.0993314],"genre_scores_gemma":[0.9137357,0.00005174342,0.08611162,0.00004326895,0.000001637976,0.00001095899,1.869e-8,0.000001646365,0.00004338082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09928802,"threshold_uncertainty_score":0.4901479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1561925425882598,"score_gpt":0.3392599156995638,"score_spread":0.183067373111304,"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."}}