{"id":"W94203535","doi":"","title":"The kth Lower Multiexponent of Tournament Matrices.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics","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.0004801957,0.0001078857,0.0001297439,0.00003067395,0.0001948846,0.00008967282,0.001019662,0.00003641157,0.0001332373],"category_scores_gemma":[0.00001563692,0.00007345145,0.00008366989,0.000258811,0.00005564698,0.0001850906,0.0001188051,0.0001112846,0.00009741808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002955213,"about_ca_system_score_gemma":0.00003242857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001660237,"about_ca_topic_score_gemma":5.076637e-7,"domain_scores_codex":[0.998922,0.00009151911,0.0002563915,0.0001918823,0.0002983718,0.0002397823],"domain_scores_gemma":[0.9989995,0.0001709973,0.00009340308,0.000611483,0.00005102518,0.00007360649],"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.00001992385,0.0001813687,0.00007756222,0.000006481122,0.00002414181,0.00001366754,0.0003134887,0.000053989,0.00008289975,0.904747,0.002073444,0.09240604],"study_design_scores_gemma":[0.00182344,0.000400765,0.001090084,0.00005975363,0.00001909608,0.000022977,0.00005522317,0.0238218,0.005604678,0.8259912,0.1407026,0.0004083413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9710292,0.001897289,0.002196695,0.002353858,0.005605828,0.0004412572,0.000003397751,0.0001867684,0.01628573],"genre_scores_gemma":[0.9962364,0.000233762,0.0015698,0.0001033392,0.00001106839,0.00001124037,3.783849e-7,0.000007175684,0.001826855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1386292,"threshold_uncertainty_score":0.2995263,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006452618473527845,"score_gpt":0.2196477663908502,"score_spread":0.2131951479173224,"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."}}