{"id":"W2714643361","doi":"10.1016/s0022-0000(02)00034-x","title":"Reachability and connectivity queries in constraint databases","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Reachability; Computer science; Theoretical computer science; Path (computing); Context (archaeology); Set (abstract data type); Time complexity; Constraint (computer-aided design); Query language; Reachability problem; Datalog; Mathematics; Database; Algorithm; Programming language","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.005793002,0.0008511498,0.002181383,0.003291607,0.002400078,0.006854495,0.003641289,0.003428491,0.006403293],"category_scores_gemma":[0.04425651,0.001105365,0.001864747,0.007565947,0.003239695,0.02316616,0.004646532,0.003246235,0.0006093628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002665228,"about_ca_system_score_gemma":0.002684102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01319781,"about_ca_topic_score_gemma":0.01157417,"domain_scores_codex":[0.9920557,0.002264315,0.001146875,0.00134964,0.002522821,0.0006605934],"domain_scores_gemma":[0.9490275,0.04291762,0.001904733,0.003558184,0.001673214,0.0009187422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002668594,0.0005518561,0.009666749,0.001088875,0.0003196364,0.001269736,0.00226806,0.1890329,0.004495222,0.6310869,0.01790442,0.139647],"study_design_scores_gemma":[0.0002687457,0.0001242381,0.0008384606,0.0000858085,0.0001605014,0.000589333,0.0008253187,0.4595786,0.003822645,0.5270758,0.006557343,0.00007326702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2514659,0.002737552,0.7133073,0.005921204,0.000177484,0.000502674,0.006134624,0.004030349,0.015723],"genre_scores_gemma":[0.7947304,0.00116555,0.1926085,0.0006299408,0.0002143354,0.0002696382,0.006063653,0.0004386662,0.003879289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01319781,"threshold_uncertainty_score":0.03063673,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03198698096184049,"score_gpt":0.2640258118051083,"score_spread":0.2320388308432678,"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."}}