{"id":"W2116562963","doi":"10.37236/1621","title":"Relaxed Graceful Labellings of Trees","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bijection; Vertex (graph theory); Combinatorics; Mathematics; Upper and lower bounds; Graph; Discrete mathematics","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.00176482,0.0006773749,0.0007784483,0.00119479,0.001637392,0.002435329,0.001784502,0.00116698,0.003882491],"category_scores_gemma":[0.01047574,0.0006701474,0.001157018,0.001592557,0.002397487,0.005455918,0.002919783,0.002440353,0.0006388909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001634976,"about_ca_system_score_gemma":0.000676634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00237467,"about_ca_topic_score_gemma":0.002944492,"domain_scores_codex":[0.9973661,0.0007183994,0.0001876475,0.0006790659,0.0005703163,0.0004784378],"domain_scores_gemma":[0.9916855,0.003390115,0.0009723848,0.002533291,0.0006540313,0.0007648209],"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.000531366,0.00007888151,0.002174872,0.0001990421,0.00004348866,0.0002281111,0.001509746,0.06871396,0.01103618,0.8572167,0.004606127,0.05366164],"study_design_scores_gemma":[0.00003082847,0.00009187641,0.0008468504,0.00004387069,0.00003291649,0.0001921441,0.0002806135,0.08108331,0.004372713,0.9035863,0.009391618,0.0000469896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4737597,0.00108269,0.4901664,0.001249355,0.000122763,0.0001522444,0.001556769,0.001206335,0.03070385],"genre_scores_gemma":[0.8351345,0.0006032467,0.1515081,0.000400652,0.0001328233,0.0001820516,0.001629209,0.0003530909,0.01005634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003882491,"threshold_uncertainty_score":0.01298827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0107111344842803,"score_gpt":0.1939844687147212,"score_spread":0.1832733342304409,"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."}}