{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500309,0.0001326284,0.0002025143,0.00006890651,0.0001775187,0.00009280333,0.0005018364,0.00006138625,0.00002579795],"category_scores_gemma":[0.00008925011,0.00009661874,0.000106107,0.0002537031,0.00005812959,0.0006923561,0.000245648,0.00006909296,0.000002975436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001903351,"about_ca_system_score_gemma":0.00002809801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009009344,"about_ca_topic_score_gemma":0.00002722145,"domain_scores_codex":[0.9987745,0.00004789412,0.0003175085,0.0003627194,0.0002129611,0.0002844502],"domain_scores_gemma":[0.9991958,0.000182257,0.0001287601,0.00037189,0.0000504196,0.00007088129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002404013,0.0009884958,0.01514125,0.00005703167,0.0001090949,0.00001885761,0.0003524772,0.00004065858,0.00790459,0.5807897,0.004127449,0.3904463],"study_design_scores_gemma":[0.004704749,0.001209605,0.02733515,0.0001681436,0.00005725182,0.00009006464,0.000537784,0.664812,0.1899218,0.09557099,0.01405421,0.001538344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02524497,0.00009671309,0.971489,0.00006592966,0.0002989452,0.0002256284,0.00001282792,0.0001519484,0.002414011],"genre_scores_gemma":[0.430989,0.00001708306,0.5686697,0.00009387676,0.00002464981,0.00002460812,0.00001377964,0.000006251851,0.000161124],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6647713,"threshold_uncertainty_score":0.3939998,"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."}}