{"id":"W2593299067","doi":"","title":"On the Bounds for Sizes of Least Common Multiples of Several pairs of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiple; Combinatorics; Arithmetic","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.0005601018,0.0001079128,0.0002676223,0.00006666971,0.0002470883,0.00004059989,0.001140115,0.00005304981,0.000001965919],"category_scores_gemma":[0.0002225247,0.00007593045,0.000150532,0.0001033086,0.0002998569,0.0001313527,0.000188538,0.00007625809,9.532133e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005028589,"about_ca_system_score_gemma":0.00004264281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001569285,"about_ca_topic_score_gemma":0.0000106888,"domain_scores_codex":[0.9990376,0.0000576758,0.0003123023,0.0001844645,0.0002499902,0.0001579654],"domain_scores_gemma":[0.9976848,0.0005292423,0.0004648138,0.001075997,0.0002077572,0.00003735369],"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.0000272966,0.0001635068,0.005095265,0.00003834035,0.00003198751,2.994307e-7,0.0003320013,0.00005315226,0.001973378,0.990835,0.0009270502,0.0005227662],"study_design_scores_gemma":[0.0009979664,0.000361075,0.007408338,0.00009965189,0.00001034456,5.874705e-7,0.00003172577,0.005390205,0.02856485,0.9569918,0.00005550809,0.0000879801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9975473,0.00009815434,0.0001374574,0.0005322103,0.0008804951,0.0002035407,0.00001001414,0.00002345537,0.0005673715],"genre_scores_gemma":[0.9986358,0.000008435176,0.001263142,0.00004227865,5.474736e-7,0.00001083827,0.000001109369,0.000006942129,0.00003095516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03384319,"threshold_uncertainty_score":0.3096354,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02349092314072028,"score_gpt":0.2534424320612935,"score_spread":0.2299515089205733,"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."}}