{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009268551,0.004952667,0.003733222,0.008585055,0.004460471,0.009579846,0.01113272,0.005572181,0.02889251],"category_scores_gemma":[0.05792065,0.00204919,0.004779369,0.00873463,0.00972381,0.03198756,0.01087147,0.0281494,0.008218756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006964495,"about_ca_system_score_gemma":0.00230056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004654474,"about_ca_topic_score_gemma":0.006869088,"domain_scores_codex":[0.9922236,0.002205906,0.0004335383,0.001932467,0.002216163,0.0009882995],"domain_scores_gemma":[0.9179047,0.06823103,0.001321486,0.007355789,0.002704482,0.002482511],"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.000493729,0.0002022644,0.0009500898,0.0008319201,0.0001370291,0.000407628,0.00037969,0.0105206,0.003193812,0.8572112,0.0762734,0.04939865],"study_design_scores_gemma":[0.00002464295,0.00005626391,0.0004740526,0.000211316,0.00007315348,0.0001961389,0.00009472606,0.01513858,0.001342627,0.9503464,0.03198174,0.00006039161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0161531,0.03531978,0.5933222,0.04034122,0.01391691,0.0002487943,0.002930378,0.003636083,0.2941316],"genre_scores_gemma":[0.3849467,0.03927355,0.4444014,0.01823796,0.02389496,0.001782424,0.003606437,0.005160626,0.07869592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02889251,"threshold_uncertainty_score":0.09665507,"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."}}