{"id":"W4396214824","doi":"10.61091/jcmcc119-30","title":"Harmonious Labelings of Families of Disjoint Unions of an Odd Cycle and Certain Trees","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Injective function; Disjoint sets; Neighbourhood (mathematics); Path (computing); Graph; Tree (set theory); Function (biology); Discrete mathematics; Computer science","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.0008060925,0.0002290168,0.0003630475,0.001227805,0.001774804,0.001184545,0.0007578933,0.0004734895,0.003339539],"category_scores_gemma":[0.002922277,0.000596706,0.0007217843,0.0009073396,0.001716725,0.002361085,0.00199006,0.0007634683,0.0003272937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001034814,"about_ca_system_score_gemma":0.0004248239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001440983,"about_ca_topic_score_gemma":0.001716115,"domain_scores_codex":[0.9989119,0.0002196337,0.00006353272,0.00036017,0.0002264823,0.0002182652],"domain_scores_gemma":[0.9978624,0.0008091156,0.0003581626,0.0004441447,0.000264761,0.0002614089],"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.0001733091,0.00004205355,0.003378349,0.000054286,0.00002983289,0.0004949016,0.001946691,0.004831359,0.008043567,0.9600174,0.0009043025,0.02008415],"study_design_scores_gemma":[0.00005212084,0.000117818,0.004273524,0.00006120626,0.00008893101,0.0009600006,0.001939884,0.04474844,0.01398579,0.9105299,0.02318747,0.00005499579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7913759,0.000233694,0.1777182,0.0002669993,0.00003756721,0.00006130143,0.0002618859,0.000304679,0.02973981],"genre_scores_gemma":[0.9447466,0.0001481144,0.04712746,0.0001194105,0.00003235509,0.0001249235,0.0004255383,0.0001121303,0.007163561],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003339539,"threshold_uncertainty_score":0.01117182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01209442711301743,"score_gpt":0.2471661196414416,"score_spread":0.2350716925284242,"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."}}