{"id":"W4416672590","doi":"10.1145/3776737","title":"Indexing Techniques for Graph Reachability Queries","year":2025,"lang":"en","type":"article","venue":"ACM Computing Surveys","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reachability; Search engine indexing; Graph database; Graph; Modular decomposition","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.003657044,0.002066989,0.002518728,0.01089465,0.002286827,0.006708313,0.005036878,0.001858032,0.008760945],"category_scores_gemma":[0.01929349,0.001066184,0.003339826,0.01918392,0.002095943,0.0207768,0.005584173,0.003494951,0.005317587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003520635,"about_ca_system_score_gemma":0.003947849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00850652,"about_ca_topic_score_gemma":0.008707478,"domain_scores_codex":[0.9931291,0.000967867,0.001005261,0.001186562,0.0031548,0.0005564612],"domain_scores_gemma":[0.9843662,0.006583979,0.001118143,0.005517071,0.002107728,0.0003068407],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003298415,0.0004467611,0.002719437,0.002041416,0.000203416,0.0002346494,0.00107587,0.02141046,0.009362255,0.2580442,0.06947429,0.6346575],"study_design_scores_gemma":[0.0001516848,0.0002884204,0.001547458,0.0006334008,0.0002821577,0.001512364,0.001175062,0.254663,0.02045008,0.548395,0.1706471,0.0002542874],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.00844447,0.007445665,0.9443241,0.002136695,0.0003576712,0.0007559942,0.005714591,0.01768017,0.01314055],"genre_scores_gemma":[0.1241433,0.01040446,0.8307652,0.001528334,0.0007893521,0.000857975,0.02192381,0.003218929,0.006368637],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01089465,"threshold_uncertainty_score":0.02930832,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01820877050216365,"score_gpt":0.291340528146569,"score_spread":0.2731317576444053,"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."}}