{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002969282,0.00008094632,0.0002212706,0.000159377,0.0001150468,0.0003241693,0.0003200285,0.00001267915,9.285943e-7],"category_scores_gemma":[0.00004142703,0.0000564064,0.00002286546,0.0002446289,0.0002657463,0.001435996,0.0001500573,0.00007264857,3.383484e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000151343,"about_ca_system_score_gemma":0.00006092676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003041675,"about_ca_topic_score_gemma":0.00001508742,"domain_scores_codex":[0.9988902,0.0002055949,0.0003113885,0.00021229,0.0002397613,0.0001407161],"domain_scores_gemma":[0.9993616,0.0002152067,0.0001686641,0.0001369173,0.00004762067,0.00007001448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000004774176,0.00007757384,0.07604133,0.0001367119,0.00001669692,0.00009976779,0.0008438704,0.00005781257,0.00003598019,0.8354468,0.000252926,0.08698569],"study_design_scores_gemma":[0.005911314,0.003578749,0.4676258,0.00244444,0.00006344166,0.009694968,0.0126991,0.4406237,0.001095691,0.02373954,0.03066084,0.001862367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3965335,0.0005692627,0.6002541,0.0002933651,0.0005933911,0.00008764683,0.000002482912,0.00001496602,0.001651234],"genre_scores_gemma":[0.9345132,0.00002774406,0.06537969,0.00003791377,0.00003478919,5.062759e-7,8.175657e-8,9.04397e-7,0.000005193949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8117073,"threshold_uncertainty_score":0.3125972,"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."}}