{"id":"W2141938776","doi":"10.1109/icde.2008.4497498","title":"An Efficient Algorithm for Answering Graph Reachability Queries","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Reachability; Transitive reduction; Computer science; Directed acyclic graph; Directed graph; Transitive closure; Disjoint sets; Graph; Path (computing); Recursion (computer science); Node (physics); Combinatorics; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Line graph; Programming language; Voltage graph","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.0002288717,0.000122856,0.0001590287,0.00005388093,0.0003121265,0.00002394923,0.0002853406,0.00003135986,0.000005244252],"category_scores_gemma":[0.00001769321,0.0001001957,0.00006387848,0.0001872215,0.0001069337,0.000609929,0.00008983575,0.00004655745,0.000004830232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002142458,"about_ca_system_score_gemma":0.0000398376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001802113,"about_ca_topic_score_gemma":0.00003262501,"domain_scores_codex":[0.9989264,0.00002989547,0.0002042167,0.0004234219,0.0001579856,0.0002580732],"domain_scores_gemma":[0.9989442,0.00005631567,0.00004768568,0.0007524379,0.00009592214,0.0001034978],"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.0000142774,0.0003400366,0.0006897224,0.00006695298,0.00002116866,0.00002829272,0.003366255,0.002145654,0.003016061,0.6660551,0.0005942601,0.3236622],"study_design_scores_gemma":[0.000829839,0.0006125823,0.002874725,0.00003176793,0.000004833019,0.0001842914,0.0006432174,0.8605856,0.02626554,0.002194898,0.1049352,0.0008374905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02315592,0.00006604093,0.9754087,0.000052732,0.0002890065,0.0002565906,0.00002900887,0.0003488255,0.0003931647],"genre_scores_gemma":[0.06998093,0.000007589083,0.9296016,0.00007051233,0.00006693303,0.00006299976,0.00001078633,0.000007708283,0.000190978],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8584399,"threshold_uncertainty_score":0.4085861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01958224782664616,"score_gpt":0.2629155023223645,"score_spread":0.2433332544957183,"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."}}