{"id":"W2401215171","doi":"","title":"A note on bounds for the maximum traceable number of a graph.","year":2014,"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; Graph; Combinatorics; Discrete mathematics","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.0007036098,0.0001186089,0.000166486,0.00005342071,0.0002049275,0.00007223401,0.0006625247,0.00006114745,0.000005403072],"category_scores_gemma":[0.00009917856,0.00008227102,0.0001226318,0.0003464041,0.00007334036,0.0001078325,0.0000781183,0.0001058955,0.00003404459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009392362,"about_ca_system_score_gemma":0.00003174177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004602011,"about_ca_topic_score_gemma":0.000002432938,"domain_scores_codex":[0.9989666,0.00005282602,0.0002135987,0.0002663759,0.0002499488,0.0002506113],"domain_scores_gemma":[0.9984195,0.0005566236,0.0001101259,0.0007232687,0.0001302477,0.00006025669],"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.00001128047,0.00009664487,0.0002030715,0.00001151159,0.00001376981,2.803146e-7,0.0001837552,0.0000587966,0.0003268809,0.9915648,0.003889647,0.003639629],"study_design_scores_gemma":[0.0008620915,0.0001921354,0.0002092796,0.00002397546,0.00001097144,0.000002702425,0.00000615273,0.0137009,0.002399551,0.9756109,0.006873173,0.0001082343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8951338,0.0003739486,0.07396856,0.007437053,0.01030999,0.001093321,0.000008061778,0.0004690693,0.0112062],"genre_scores_gemma":[0.9938892,0.000006932498,0.005377959,0.000507004,0.000002244833,0.00003715832,8.513686e-7,0.00001080949,0.0001678711],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09875537,"threshold_uncertainty_score":0.3354915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0122166561191287,"score_gpt":0.2496591459658105,"score_spread":0.2374424898466818,"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."}}