{"id":"W4245009066","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":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Topological sorting; Cover (algebra); Sorting; Directed acyclic graph; Algorithm; Node (physics); Bounded function; Mathematics; Computational complexity theory; Computer science; 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.0002858006,0.0001293114,0.000154926,0.0001433787,0.0002877286,0.0003229006,0.0003831016,0.00005238901,0.000003059127],"category_scores_gemma":[0.0001015347,0.0001072908,0.00006463045,0.0003173325,0.00006312603,0.005528548,0.00009636244,0.00008661859,0.000003206252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003568714,"about_ca_system_score_gemma":0.00004344723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001541278,"about_ca_topic_score_gemma":0.000001265464,"domain_scores_codex":[0.9988146,0.00002680675,0.0004840519,0.0001586865,0.0002722151,0.0002436004],"domain_scores_gemma":[0.9992096,0.00006966491,0.0003860398,0.0002012852,0.00008600406,0.00004736933],"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.00002035662,0.000136645,0.00275568,0.0002951076,0.00003708905,0.000002587698,0.002799224,0.0004910904,0.004642935,0.01356827,0.002620644,0.9726304],"study_design_scores_gemma":[0.003391246,0.000245664,0.00808904,0.0004796211,0.00003982571,0.00007395594,0.0007529021,0.9068133,0.05453396,0.006420574,0.01804353,0.001116335],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03458985,0.00003925526,0.9640784,0.0003627127,0.0002153924,0.0001965525,0.00001024833,0.0001527185,0.0003548489],"genre_scores_gemma":[0.5862526,0.000004759672,0.4122548,0.001356761,0.00002325686,0.00004075222,0.000055383,0.000005409996,0.000006205449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.971514,"threshold_uncertainty_score":0.4375192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01465455923753785,"score_gpt":0.2469811749659108,"score_spread":0.232326615728373,"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."}}