{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001884959,0.001085002,0.001368098,0.002571341,0.001439778,0.003832356,0.002496678,0.00127204,0.005082448],"category_scores_gemma":[0.007821171,0.001162558,0.002058251,0.003239781,0.001421422,0.009464325,0.003302019,0.002468907,0.002281859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00156176,"about_ca_system_score_gemma":0.002307835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003861646,"about_ca_topic_score_gemma":0.004182715,"domain_scores_codex":[0.9967513,0.0005047299,0.0004257624,0.0008620524,0.001197033,0.0002591319],"domain_scores_gemma":[0.9965204,0.001538342,0.0001987139,0.0008888404,0.0007316451,0.0001220721],"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.0002439709,0.0002074651,0.001177082,0.0004789979,0.0001289762,0.0002551741,0.0009324281,0.01831787,0.01543492,0.2185298,0.02070541,0.7235879],"study_design_scores_gemma":[0.0002399731,0.000329444,0.0007517955,0.0002113073,0.0002147096,0.001060649,0.0004470386,0.4312004,0.02636771,0.4155701,0.1234267,0.0001802864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002510508,0.0002661384,0.9927633,0.0001104579,0.00006411441,0.0001097031,0.0001961031,0.002540802,0.001438922],"genre_scores_gemma":[0.02371496,0.0002414862,0.9731939,0.00008873545,0.0000638208,0.0001962425,0.000646631,0.0003990961,0.001455141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005082448,"threshold_uncertainty_score":0.01700252,"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."}}