{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006698004,0.0003003507,0.0004892266,0.0004143376,0.0001066926,0.00008198072,0.001165975,0.00008488905,0.00009601004],"category_scores_gemma":[0.0001080067,0.0002745688,0.0001741577,0.001380953,0.000247109,0.0006187041,0.000250794,0.0003537811,0.0000361465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004278461,"about_ca_system_score_gemma":0.00003892667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003107942,"about_ca_topic_score_gemma":0.00004352011,"domain_scores_codex":[0.9972036,0.0001428762,0.0007544922,0.0005156142,0.0006435699,0.0007398287],"domain_scores_gemma":[0.9980271,0.0003365742,0.0002222443,0.001147798,0.0000998372,0.0001664246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008252914,0.0006091679,0.02757881,0.0004695511,0.0001120706,0.0001099342,0.01289367,0.006765078,0.005645333,0.9231817,0.00005569223,0.02249645],"study_design_scores_gemma":[0.00376596,0.000599243,0.01226705,0.00159153,0.00005015952,0.00006049129,0.003423513,0.8126001,0.01194128,0.1507824,0.001154898,0.001763338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6887193,0.0002643542,0.3059033,0.00006494969,0.00006839048,0.0005295646,0.00003645205,0.0001594689,0.004254231],"genre_scores_gemma":[0.9177896,0.00005792254,0.08185089,0.00001369173,0.00001664735,0.00003659041,0.0000125553,0.00003383018,0.0001882724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8058351,"threshold_uncertainty_score":0.9999707,"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."}}