{"id":"W1964296470","doi":"10.1016/s0012-365x(00)00055-8","title":"Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Bipartite graph; Path (computing); Discrete mathematics; Graph; Computer science; Quantum","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.0004455119,0.0004112675,0.0005391259,0.00116163,0.001561305,0.001693486,0.0008004408,0.0008317045,0.00446617],"category_scores_gemma":[0.003188937,0.0009096148,0.0005611371,0.001498489,0.0009482712,0.002287365,0.001480485,0.001120187,0.0003949405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006759041,"about_ca_system_score_gemma":0.0004743474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008252945,"about_ca_topic_score_gemma":0.001937913,"domain_scores_codex":[0.9996071,0.00009581804,0.00002928306,0.0001013168,0.0000768652,0.00008959701],"domain_scores_gemma":[0.9959455,0.002250057,0.0005897923,0.0002436805,0.0003776736,0.0005932811],"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.0004275746,0.000152306,0.005701987,0.0004741249,0.0001151213,0.0008930148,0.001395374,0.02670769,0.017062,0.917976,0.003597251,0.02549748],"study_design_scores_gemma":[0.00005577798,0.00006632345,0.002850687,0.00005177358,0.00006418439,0.000400217,0.0005032716,0.05963918,0.003652576,0.9293943,0.003301531,0.00002020996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8836168,0.000223794,0.1011085,0.0005263141,0.0000365061,0.00007676248,0.0007713869,0.0001872723,0.01345253],"genre_scores_gemma":[0.9619635,0.0002928055,0.0303968,0.0001750013,0.00003670871,0.0001350748,0.001067029,0.00007503604,0.005858053],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00446617,"threshold_uncertainty_score":0.01494086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02621749155710442,"score_gpt":0.2968206170002112,"score_spread":0.2706031254431068,"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."}}