{"id":"W2134890818","doi":"10.1016/j/ipl.2003.07.005","title":"Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Cover (algebra); Topological sorting; Sorting; Algorithm; Directed acyclic graph; Node (physics); Bounded function; Computer science; Mathematics; Computational complexity theory; Combinatorics; Discrete 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.002147296,0.0009107123,0.001396373,0.002934968,0.001385786,0.001462837,0.002780981,0.001341294,0.002170586],"category_scores_gemma":[0.009521685,0.0007548224,0.001065828,0.004288072,0.001217298,0.00497637,0.00186524,0.00135329,0.0006167176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001659309,"about_ca_system_score_gemma":0.003097552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004694788,"about_ca_topic_score_gemma":0.006732093,"domain_scores_codex":[0.9986959,0.0003024576,0.000116813,0.0002730133,0.0004093385,0.0002024898],"domain_scores_gemma":[0.9929135,0.004627481,0.0007173214,0.001001926,0.0004775309,0.0002622678],"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.0007052289,0.0004508471,0.004760691,0.0008256654,0.0001486006,0.0002648495,0.0007659259,0.3265214,0.009701005,0.0570716,0.01106835,0.5877159],"study_design_scores_gemma":[0.0001740016,0.0002695149,0.000565415,0.00003578624,0.00007276455,0.0003479179,0.0001690804,0.9097887,0.00815656,0.07314647,0.007229447,0.00004436873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09206726,0.001204164,0.8996555,0.0007021827,0.00007253532,0.0003556099,0.0007480116,0.00265396,0.002540845],"genre_scores_gemma":[0.1879156,0.0004518941,0.8076521,0.0001221509,0.00004577503,0.0002322222,0.001769105,0.0001570332,0.001654115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004694788,"threshold_uncertainty_score":0.01203912,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02265148300003988,"score_gpt":0.2680708592812365,"score_spread":0.2454193762811966,"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."}}