{"id":"W2123041000","doi":"10.1109/iv.2003.1217981","title":"A new algorithm for transitive closures and computation of recursion in relational databases","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Transitive closure; Transitive reduction; Recursion (computer science); Transitive relation; Graph; Computation; Algorithm; Computer science; Directed graph; Relational database; Mathematics; Combinatorics; Computational complexity theory; Discrete mathematics; Theoretical computer science; Voltage graph; Line graph; Database","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.0001016484,0.00004996183,0.0000895222,0.00006056304,0.00002798605,0.000004095624,0.0000333925,0.000014224,0.000001096966],"category_scores_gemma":[0.00001568268,0.00004364533,0.00001428027,0.0001169018,0.00001866074,0.0005826352,0.00002363838,0.0000244006,3.878545e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001312888,"about_ca_system_score_gemma":0.00006341126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003826603,"about_ca_topic_score_gemma":0.0001638336,"domain_scores_codex":[0.9995232,0.00001281753,0.0001519093,0.0001573314,0.00008711252,0.00006760428],"domain_scores_gemma":[0.9997364,0.0000762516,0.00004507472,0.00007390376,0.00004071993,0.00002761183],"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.000010623,0.000022383,0.00008982165,0.00001983047,0.000003876287,0.000001657549,0.0006954222,0.001353325,0.0003035339,0.8148218,0.00007486844,0.1826029],"study_design_scores_gemma":[0.01884071,0.001598982,0.05635961,0.001905201,0.00002952746,0.0001617825,0.001746676,0.6432868,0.05373366,0.1815835,0.03936854,0.001385013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002071232,0.0001600529,0.9971243,0.0002742801,0.00005101513,0.000171155,0.00006007836,0.00001840708,0.00006947313],"genre_scores_gemma":[0.02890027,0.00001109555,0.9709651,0.00002924691,0.00001775226,0.00000474389,0.0000416851,0.000002250186,0.00002790167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6419335,"threshold_uncertainty_score":0.1779805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03053840782776788,"score_gpt":0.2948107845568169,"score_spread":0.264272376729049,"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."}}