{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006733981,0.0001714202,0.0002412592,0.0002090738,0.0004164845,0.0001710069,0.001591462,0.00008808299,0.000001327716],"category_scores_gemma":[0.00113413,0.0001664352,0.000138785,0.0008029533,0.0001203891,0.0002413059,0.0007963917,0.0001708988,0.000001782627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002929046,"about_ca_system_score_gemma":0.0000711151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000765244,"about_ca_topic_score_gemma":0.00001927134,"domain_scores_codex":[0.9979815,0.0006690206,0.0003130821,0.0005159195,0.000126988,0.00039353],"domain_scores_gemma":[0.9968364,0.001724071,0.00009731149,0.001119465,0.0001728629,0.00004984521],"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.000005224584,0.00007507902,0.01687597,0.00008304504,0.00003885738,0.000002043572,0.0004797325,0.00003391846,0.0003311045,0.3597578,0.0005057015,0.6218115],"study_design_scores_gemma":[0.0002987464,0.0001130781,0.04598604,0.0001536909,0.000008404688,0.00000430515,0.00005570243,0.01297269,0.01354733,0.9227872,0.003683026,0.0003897458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02765836,0.00008276865,0.9687124,0.0006108803,0.0006165713,0.0002985242,0.000003989031,0.0007959508,0.001220554],"genre_scores_gemma":[0.7454641,0.000002116959,0.2540419,0.0002615626,0.00004941595,0.00001780698,0.000005367786,0.000007186205,0.0001504546],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7178058,"threshold_uncertainty_score":0.6787032,"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."}}