{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734514,0.0001138129,0.0002702177,0.0001798626,0.0000457573,0.000009993114,0.0003358909,0.00005659137,0.000001922922],"category_scores_gemma":[0.00005542368,0.00008416657,0.00005737516,0.0007951007,0.0003740175,0.0001493936,0.0001498446,0.0001413086,1.187529e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006314041,"about_ca_system_score_gemma":0.00001626952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008923049,"about_ca_topic_score_gemma":0.00002896269,"domain_scores_codex":[0.998893,0.0001196819,0.0003131659,0.0002021032,0.0002813283,0.0001907492],"domain_scores_gemma":[0.9988849,0.0003852564,0.0002185005,0.0003458193,0.000122225,0.00004331669],"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.00005698235,0.0001660985,0.3193952,0.00008451418,0.00002141535,0.000002309382,0.0007191687,0.00003995329,0.002952218,0.6744504,0.000004827352,0.002106942],"study_design_scores_gemma":[0.00158545,0.0005761699,0.3131702,0.0002844026,0.00001912903,0.00001223864,0.0004569704,0.009950006,0.01543055,0.6582645,0.00004271507,0.00020771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9974789,0.000738719,0.001285136,0.00008102373,0.00004340617,0.0001625596,0.00001033257,0.000008243927,0.0001916976],"genre_scores_gemma":[0.999207,0.0005342318,0.0002330998,0.000007339274,0.000001445539,0.000006445644,8.439492e-7,0.000005274118,0.000004377284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01618594,"threshold_uncertainty_score":0.3432213,"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."}}