{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790706,0.0007705079,0.0005440185,0.002135213,0.0007965523,0.001410598,0.001540901,0.000657149,0.008235252],"category_scores_gemma":[0.003215847,0.0004169808,0.000797211,0.002599507,0.0006312396,0.002589837,0.001818952,0.0008550255,0.0020231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009538366,"about_ca_system_score_gemma":0.001578648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326991,"about_ca_topic_score_gemma":0.00336359,"domain_scores_codex":[0.9994255,0.00008271726,0.0000668786,0.0001180613,0.0002333856,0.00007343735],"domain_scores_gemma":[0.998565,0.0004424542,0.0001398003,0.0004136011,0.0003503897,0.00008870178],"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.0004166184,0.0001547256,0.001750826,0.0005189176,0.00009052207,0.0001513051,0.0002681671,0.07660922,0.02379002,0.06422704,0.02572456,0.8062981],"study_design_scores_gemma":[0.0003131663,0.0005266816,0.001358187,0.0001283334,0.0001196492,0.0007661316,0.0003590537,0.6629214,0.05508417,0.1761535,0.1021603,0.0001094161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0175224,0.0002211465,0.9660055,0.0002256793,0.00008270534,0.000164009,0.0008773198,0.009614041,0.005287281],"genre_scores_gemma":[0.1056029,0.0002204593,0.8861035,0.0001262128,0.00004668577,0.0002519132,0.002523874,0.0006260928,0.004498352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008235252,"threshold_uncertainty_score":0.02754962,"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."}}