{"id":"W2018416407","doi":"10.1145/2133803.2330083","title":"A topological sorting algorithm for large graphs","year":2012,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Topological sorting; Reachability; Computer science; Sorting; Algorithm; Sorting algorithm; Vertex (graph theory); sort; Directed acyclic graph; Graph; Theoretical computer science; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127711,0.0002337324,0.0003473543,0.0002024561,0.0002246038,0.0001898526,0.001946336,0.00008356573,0.00002946078],"category_scores_gemma":[0.0001139817,0.0001924393,0.000298367,0.0002970816,0.00004699361,0.002292636,0.0009227074,0.0002195806,0.00001358711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007856018,"about_ca_system_score_gemma":0.00003169371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003001282,"about_ca_topic_score_gemma":1.20687e-7,"domain_scores_codex":[0.997872,0.00005703456,0.0006507873,0.0002338217,0.0004561327,0.0007302086],"domain_scores_gemma":[0.9984439,0.000145533,0.0004877026,0.0005085196,0.0001354379,0.0002789093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004460654,0.003212969,0.001779008,0.0000212364,0.0004310486,0.0001293354,0.002543331,0.000004103222,0.006359081,0.256371,0.01196912,0.7171352],"study_design_scores_gemma":[0.02291043,0.008528268,0.004100084,0.0003039262,0.0003979637,0.003646771,0.01449161,0.3109314,0.2835861,0.1146193,0.2317144,0.004769762],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01087821,0.003062951,0.9823629,0.0003906314,0.00263949,0.000240236,0.00002067625,0.00006275476,0.0003421321],"genre_scores_gemma":[0.1460983,0.00007614627,0.8521805,0.0005480892,0.0009631755,0.00001597551,0.00001009255,0.00001932893,0.00008842866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7123654,"threshold_uncertainty_score":0.7847447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03450389665994346,"score_gpt":0.314868580395484,"score_spread":0.2803646837355405,"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."}}