{"id":"W3172623769","doi":"10.1145/3451159","title":"Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Computer science; Vertex (graph theory); Search engine indexing; Transitive closure; Combinatorics; Graph; Theoretical computer science; Discrete mathematics; Mathematics; Information retrieval","routes":{"ca_aff":true,"ca_fund":true,"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.001428895,0.001276264,0.001663495,0.003192141,0.001104943,0.002818245,0.002965133,0.001131501,0.005496247],"category_scores_gemma":[0.01060308,0.0006474162,0.001119495,0.005570073,0.000885601,0.007714794,0.002332157,0.001497706,0.00165791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002178643,"about_ca_system_score_gemma":0.003218999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007362012,"about_ca_topic_score_gemma":0.01088459,"domain_scores_codex":[0.9969888,0.0004459215,0.0003402056,0.0005408675,0.001339283,0.0003449882],"domain_scores_gemma":[0.9934728,0.002859826,0.0004901552,0.002087177,0.0008483431,0.0002417273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002815051,0.0007358065,0.006244778,0.001391868,0.0002516806,0.0005981717,0.0008166725,0.08818924,0.08228969,0.06010265,0.05407065,0.7024937],"study_design_scores_gemma":[0.0002340279,0.000283384,0.001444494,0.00006239052,0.0000863442,0.0005046757,0.0003706815,0.864736,0.04248076,0.07646699,0.01324978,0.00008046638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08774786,0.001757005,0.8453371,0.0007236975,0.0001937649,0.0006517923,0.007715393,0.04781965,0.008053695],"genre_scores_gemma":[0.4025085,0.0005033346,0.5793366,0.0002921001,0.0001183913,0.0004517451,0.01292519,0.001662584,0.002201657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007362012,"threshold_uncertainty_score":0.01838672,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06869570056074788,"score_gpt":0.3123199311397553,"score_spread":0.2436242305790074,"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."}}