{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000285077,0.0001885205,0.0001710814,0.0001212485,0.0002214509,0.000373682,0.001228377,0.00004224042,0.00003162447],"category_scores_gemma":[0.00001019753,0.0001621501,0.00003880324,0.0006549794,0.0001208619,0.001247763,0.0003571461,0.0001306611,0.0001652382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002541923,"about_ca_system_score_gemma":0.00003735048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003440071,"about_ca_topic_score_gemma":0.00001482921,"domain_scores_codex":[0.998472,0.00003107147,0.0001678875,0.0005068065,0.0003777059,0.0004444756],"domain_scores_gemma":[0.998854,0.00002625094,0.00005245602,0.000839881,0.0001072127,0.000120147],"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.000008861191,0.0001305963,0.009270282,0.00001034168,0.00005317192,0.00007625135,0.0002838434,0.000005612057,0.00005719633,0.9596866,0.01129151,0.01912572],"study_design_scores_gemma":[0.006776094,0.006935612,0.1087532,0.0004188438,0.0002018956,0.0000986259,0.0006227263,0.07446705,0.01018691,0.5990628,0.1885251,0.003951149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8820018,0.0001669001,0.04013717,0.0008730598,0.005778892,0.0006284983,0.00001179126,0.001043497,0.06935844],"genre_scores_gemma":[0.984423,0.000007471496,0.01454273,0.0001195403,0.00003003237,0.0000155608,0.00001207581,0.0000179057,0.000831673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3606238,"threshold_uncertainty_score":0.6612288,"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."}}