{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825101,0.0002249645,0.0008332852,0.0003983024,0.000111762,0.0001340836,0.0005037742,0.0001203793,0.00000111433],"category_scores_gemma":[0.0002625911,0.0001859477,0.0001643694,0.0005464909,0.0002081143,0.0003316388,0.0003227065,0.0002960079,1.782209e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001846975,"about_ca_system_score_gemma":0.0001578488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000586078,"about_ca_topic_score_gemma":8.413253e-7,"domain_scores_codex":[0.9973864,0.0001268845,0.001425105,0.0002327811,0.0006076004,0.0002212111],"domain_scores_gemma":[0.9971897,0.0007529281,0.0009706448,0.0003144396,0.000612375,0.0001599167],"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.00002741852,0.000488748,0.0001004787,0.0005819103,0.0001151464,0.000011871,0.003765575,0.0001659625,0.01177256,0.9788207,0.00002959486,0.004119986],"study_design_scores_gemma":[0.001827559,0.001469904,0.0001195084,0.001239342,0.0001013705,0.00007335567,0.0005008004,0.07969337,0.01337144,0.9013575,0.00004817929,0.0001977051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9871841,0.001754022,0.005993267,0.0001385994,0.004641362,0.000134826,0.000004377795,0.00003657524,0.000112891],"genre_scores_gemma":[0.9825097,0.0001429746,0.01724255,0.000006373796,0.00007651995,5.725762e-7,6.19657e-7,0.00001870073,0.000002006229],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07952741,"threshold_uncertainty_score":0.7582726,"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."}}