{"id":"W2792994061","doi":"","title":"Strongly Spanning Trailable Graphs with Short Longest Paths.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"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.0007944237,0.0004545834,0.0004330652,0.001149543,0.001241744,0.002209815,0.0009281602,0.0007567296,0.01172406],"category_scores_gemma":[0.006861581,0.0004665742,0.0005085481,0.002314519,0.0008545634,0.004752393,0.002155138,0.001176431,0.002373028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007892359,"about_ca_system_score_gemma":0.001267232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001173259,"about_ca_topic_score_gemma":0.001897532,"domain_scores_codex":[0.9992039,0.0001952994,0.00009303891,0.0001644382,0.000169144,0.0001742378],"domain_scores_gemma":[0.9939486,0.00267951,0.0009943736,0.0010789,0.0005839631,0.000714795],"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.00052674,0.0002757049,0.00338269,0.0005335289,0.00009098665,0.0009557634,0.0007371008,0.02079554,0.01092504,0.8060403,0.0301154,0.1256212],"study_design_scores_gemma":[0.00005875763,0.00009952179,0.0008239973,0.0000731526,0.00005137493,0.0006965677,0.0003418006,0.03297423,0.004063795,0.9306971,0.03009706,0.00002258494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2986905,0.001247198,0.6067216,0.002560814,0.0003760362,0.0004306961,0.006384899,0.002409374,0.08117887],"genre_scores_gemma":[0.7624068,0.001146539,0.1798739,0.0005472456,0.0002145144,0.0002854692,0.006088192,0.0003786418,0.04905875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01172406,"threshold_uncertainty_score":0.03922087,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01531611692223237,"score_gpt":0.2302556098121114,"score_spread":0.214939492889879,"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."}}