{"id":"W5848928","doi":"10.2466/pms.1965.21.2.535","title":"The Complexity of List Ranking of Trees","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Bounded function; Ranking (information retrieval); Graph; Path (computing); Discrete mathematics; Computer science; Artificial intelligence","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.0005150542,0.00008237936,0.0001809361,0.00006499587,0.000275326,0.00001461054,0.001375916,0.00002843636,0.000004642318],"category_scores_gemma":[0.0001530555,0.00006154423,0.00008014681,0.000557829,0.001168749,0.0001913474,0.000336348,0.0001310831,0.000004122667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001769731,"about_ca_system_score_gemma":0.0000574787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003300371,"about_ca_topic_score_gemma":0.00001549141,"domain_scores_codex":[0.9987701,0.0001580658,0.0002501374,0.0001732726,0.0004195645,0.0002288923],"domain_scores_gemma":[0.9983949,0.0004803971,0.0001403912,0.0007463827,0.0001902214,0.00004771709],"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.00001636634,0.00005643848,0.003734372,0.000006356381,0.0000131886,0.000004429955,0.0003716907,0.000008683258,0.001552176,0.9928128,0.0001560871,0.00126738],"study_design_scores_gemma":[0.0004197274,0.00009191568,0.01337821,0.00001284863,0.000001398487,0.000008172758,0.00002326973,0.001127678,0.01839701,0.9660779,0.0003957778,0.00006613477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9888887,0.0004741012,0.005571176,0.0004210735,0.0006836083,0.0001897487,0.000002528941,0.00006220737,0.003706828],"genre_scores_gemma":[0.997618,0.00004994692,0.002205731,0.00001094127,0.000002528944,0.000004819335,4.277686e-7,0.000005861331,0.0001017807],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02673498,"threshold_uncertainty_score":0.4306303,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05138417851192042,"score_gpt":0.2940320038129887,"score_spread":0.2426478253010682,"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."}}