{"id":"W2187659169","doi":"","title":"Nearly-acyclically pushable tournaments","year":2001,"lang":"es","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Directed acyclic graph; Tournament; Mathematics; Vertex (graph theory); Feedback arc set; Multipartite; Directed graph; Discrete mathematics; Graph; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003351746,0.0003642387,0.0004914498,0.0004272887,0.0009258086,0.001635489,0.0005611053,0.0003699196,0.002959619],"category_scores_gemma":[0.001782107,0.0002805221,0.0005151807,0.0007260197,0.0008480953,0.001143636,0.0007871669,0.0005587406,0.0002728389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006700197,"about_ca_system_score_gemma":0.00060423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002278433,"about_ca_topic_score_gemma":0.003649652,"domain_scores_codex":[0.9993246,0.0001226896,0.00005786608,0.0001541378,0.0001501533,0.0001906485],"domain_scores_gemma":[0.9984901,0.0006684434,0.000251999,0.0001879575,0.0001221804,0.0002793327],"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.001500144,0.0004187965,0.01348008,0.0006216895,0.000225465,0.001831826,0.001365651,0.1376512,0.06343115,0.5731987,0.008697993,0.1975774],"study_design_scores_gemma":[0.0003077087,0.0007070646,0.00765871,0.00008539118,0.0002121492,0.001654318,0.0006481611,0.2863391,0.0219316,0.6311141,0.0492273,0.00011435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7760326,0.0004761113,0.1928672,0.000396817,0.00007209973,0.0002296974,0.001470587,0.0007574641,0.02769747],"genre_scores_gemma":[0.9563708,0.0002960892,0.03609186,0.000096071,0.00002957194,0.000138426,0.001278388,0.00003050658,0.005668238],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002959619,"threshold_uncertainty_score":0.009900868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02860673977116502,"score_gpt":0.3241749765396323,"score_spread":0.2955682367684673,"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."}}