{"id":"W2407485278","doi":"","title":"On traceable and upper traceable numbers of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","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.002040416,0.00100866,0.001043574,0.00394077,0.002395828,0.005190087,0.002093086,0.001578861,0.01403691],"category_scores_gemma":[0.01922148,0.0006647206,0.00108101,0.003298145,0.006753342,0.01537822,0.004084645,0.006089427,0.001757149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002824706,"about_ca_system_score_gemma":0.001098685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002147038,"about_ca_topic_score_gemma":0.002303252,"domain_scores_codex":[0.9975414,0.000565382,0.000153197,0.000525643,0.0007246191,0.0004897848],"domain_scores_gemma":[0.981459,0.01270178,0.001334987,0.001879222,0.001096191,0.001528866],"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.00004672166,0.00002554207,0.0002699823,0.00003652928,0.000004864475,0.0000444186,0.0002113428,0.001200623,0.0003322996,0.9895865,0.001080837,0.007160289],"study_design_scores_gemma":[0.000005978876,0.000008938643,0.0001274346,0.00001580069,0.000003927345,0.0000410904,0.00004704581,0.002711189,0.0002062022,0.994891,0.001934979,0.000006455355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2834521,0.004438926,0.3805738,0.006839687,0.001137821,0.0001389132,0.001222327,0.00104445,0.3211519],"genre_scores_gemma":[0.8968104,0.002433901,0.04916383,0.001011257,0.001246596,0.0002042736,0.0007828785,0.0003850372,0.04796183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01403691,"threshold_uncertainty_score":0.04695809,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02202488961978434,"score_gpt":0.2776144362891288,"score_spread":0.2555895466693445,"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."}}