{"id":"W1982231222","doi":"10.1145/777412.777427","title":"I/O-efficient topological sorting of planar DAGs","year":2003,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Topological sorting; Digraph; Directed acyclic graph; Planar; Directed graph; Planar graph; Combinatorics; Sorting; sort; Path (computing); Computer science; Strongly connected component; Mathematics; Graph; Topology (electrical circuits); Algorithm; Arithmetic","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.0002818499,0.0007714182,0.0004911398,0.001388317,0.0005858221,0.001240815,0.001257268,0.0005893402,0.004422626],"category_scores_gemma":[0.002163799,0.0002788901,0.0004890498,0.002332069,0.0005323411,0.002412906,0.001297982,0.0006626551,0.000997445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007951141,"about_ca_system_score_gemma":0.001293782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001853567,"about_ca_topic_score_gemma":0.003488244,"domain_scores_codex":[0.9996732,0.00004909807,0.00002515735,0.00006509576,0.00008692585,0.0001005985],"domain_scores_gemma":[0.9993211,0.0002537629,0.0001105999,0.0001661048,0.00009601562,0.00005242005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005132929,0.0002789739,0.00212069,0.0007061635,0.00006270134,0.0001548972,0.0002500534,0.2074527,0.02670237,0.08172173,0.02146503,0.6585714],"study_design_scores_gemma":[0.0002633071,0.0003787792,0.000960493,0.00007757726,0.00008893463,0.0003527971,0.0004761429,0.6868471,0.05423459,0.221527,0.03473585,0.00005742599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1413386,0.001014198,0.8285902,0.001031715,0.0001349597,0.0002169611,0.0013837,0.007183861,0.01910583],"genre_scores_gemma":[0.4531641,0.0009655302,0.5355846,0.000224863,0.00006071931,0.0001600417,0.003716417,0.0003650111,0.005758806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004422626,"threshold_uncertainty_score":0.01479518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02349519524259763,"score_gpt":0.2595327190832564,"score_spread":0.2360375238406587,"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."}}