{"id":"W1970733021","doi":"10.5539/jmr.v4n3p116","title":"The Upper Bound of Transitive Index of Reducible Tournaments","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Science Foundation of Guangdong Province","keywords":"Mathematics; Transitive relation; Upper and lower bounds; Index (typography); Combinatorics; Discrete mathematics; Mathematical analysis","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.01354847,0.00009783537,0.0003258384,0.0005274437,0.0002066114,0.0000802433,0.001871683,0.00006090191,0.00002619513],"category_scores_gemma":[0.001095346,0.00006010989,0.0001722993,0.0009063749,0.0005230014,0.0007005332,0.0003107853,0.0007523747,0.000008421601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008896666,"about_ca_system_score_gemma":0.0002893363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004260321,"about_ca_topic_score_gemma":0.000001142809,"domain_scores_codex":[0.9955719,0.0005300146,0.0008013525,0.0001002614,0.002398014,0.0005984563],"domain_scores_gemma":[0.9947557,0.002316453,0.0004906113,0.0006264612,0.001597802,0.000212998],"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.0004604695,0.004126935,0.006437685,0.0008432891,0.000814318,0.00005257748,0.04514467,0.000171198,0.1557229,0.724638,0.00335402,0.05823387],"study_design_scores_gemma":[0.0017361,0.001427036,0.006371129,0.0008899941,0.0000258594,0.0006259779,0.01121311,0.005925662,0.2196346,0.7496289,0.002253816,0.0002678251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7389266,0.002472176,0.2517924,0.001300715,0.0003165688,0.0004184584,0.000004254215,0.0000072242,0.004761537],"genre_scores_gemma":[0.9730951,0.0003315216,0.02607769,0.000005059675,0.00007423601,0.000003631177,5.852341e-8,0.00001305616,0.0003996473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2341684,"threshold_uncertainty_score":0.4695655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09975700056949226,"score_gpt":0.4208337795849819,"score_spread":0.3210767790154896,"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."}}