{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001878836,0.00005116568,0.00008438102,0.00002656035,0.00005193669,0.00001962419,0.0003208775,0.00002795166,0.00008445769],"category_scores_gemma":[0.00004964699,0.00003419145,0.00002703179,0.000118025,0.00002404708,0.0000486953,0.00009373012,0.00004579319,0.00001874718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005669189,"about_ca_system_score_gemma":0.00001858833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001632574,"about_ca_topic_score_gemma":5.080163e-7,"domain_scores_codex":[0.9993619,0.00003185516,0.0001524865,0.0001717991,0.0001473718,0.0001345559],"domain_scores_gemma":[0.9995402,0.00004790523,0.00005141523,0.0002924148,0.00002408657,0.00004395731],"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":[8.639601e-7,0.0000689198,0.000455903,0.000002726286,0.000002256939,0.000006229037,0.00008195025,0.0003689336,0.0009030344,0.9905621,0.0005884035,0.006958674],"study_design_scores_gemma":[0.00092668,0.0003799908,0.006676116,0.00004961976,0.000007261405,0.00009210704,0.0003428575,0.8716508,0.04291597,0.04886665,0.027503,0.0005889833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03396276,0.00005241773,0.9392231,0.00008868447,0.0001421526,0.00003858274,7.592977e-7,0.00005466993,0.02643695],"genre_scores_gemma":[0.7493176,0.000001479764,0.2504075,0.0001043281,0.000009386399,0.000001049626,5.75996e-7,0.000001378408,0.0001565959],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9416955,"threshold_uncertainty_score":0.1394287,"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."}}