{"id":"W1969741579","doi":"10.1007/s003730170022","title":"Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Conjecture; Graph; Discrete mathematics; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002371604,0.001079301,0.002013059,0.001460238,0.003121814,0.004552484,0.003047284,0.004428132,0.01468081],"category_scores_gemma":[0.02615755,0.001282296,0.002197598,0.002014878,0.00491796,0.01037818,0.003721969,0.006394752,0.001338415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002371765,"about_ca_system_score_gemma":0.001763212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002118292,"about_ca_topic_score_gemma":0.001926065,"domain_scores_codex":[0.9980702,0.0006685406,0.0001059199,0.0006242812,0.0002303953,0.000300776],"domain_scores_gemma":[0.9752398,0.01952475,0.001009689,0.00195474,0.001141282,0.00112972],"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.0004191042,0.000157823,0.001353681,0.0004776649,0.00009273079,0.0001952854,0.0007525072,0.02653708,0.0009948245,0.9326962,0.02341989,0.01290328],"study_design_scores_gemma":[0.00005722262,0.00002286475,0.000225358,0.00002987477,0.00001840029,0.00005272706,0.0001660447,0.02217224,0.000295566,0.9748668,0.002072902,0.00001996722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5816825,0.002686118,0.2419994,0.06419182,0.002948965,0.000197457,0.00379138,0.001008607,0.1014937],"genre_scores_gemma":[0.8975267,0.001286,0.0725867,0.003567208,0.002265614,0.0002830693,0.002781535,0.0004290693,0.01927406],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01468081,"threshold_uncertainty_score":0.0491122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02388873271898021,"score_gpt":0.277291752450136,"score_spread":0.2534030197311558,"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."}}