{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001781243,0.0006362173,0.001463487,0.001059585,0.001689919,0.00545812,0.002225004,0.00158993,0.01316725],"category_scores_gemma":[0.01277861,0.0005679068,0.001062764,0.002874021,0.001083854,0.007977822,0.001731754,0.001715825,0.00149372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003442881,"about_ca_system_score_gemma":0.002470936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006080905,"about_ca_topic_score_gemma":0.006696247,"domain_scores_codex":[0.9969896,0.0009848612,0.0001994086,0.0004759206,0.0006515469,0.0006985947],"domain_scores_gemma":[0.9782012,0.017395,0.001127756,0.00132181,0.001061235,0.00089301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002732088,0.0008784197,0.01643493,0.00293631,0.0003552391,0.001080197,0.001710283,0.4445038,0.01529781,0.21275,0.07678563,0.2245353],"study_design_scores_gemma":[0.0003060349,0.0002071441,0.002854683,0.00006923763,0.000149841,0.0006011166,0.0007378357,0.7403094,0.005168246,0.240748,0.008787178,0.00006127916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.822979,0.001673996,0.1246777,0.007984454,0.0001640647,0.0003941354,0.0083434,0.002945134,0.03083814],"genre_scores_gemma":[0.9368042,0.0005348077,0.04944587,0.0003567924,0.0001373506,0.0001525072,0.004844692,0.0003794151,0.007344219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01316725,"threshold_uncertainty_score":0.04404879,"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."}}