{"id":"W4379390584","doi":"10.1145/3555041.3589408","title":"An Overview of Reachability Indexes on Graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reachability; Computer science; Transitive closure; Transitive reduction; Theoretical computer science; Vertex (graph theory); Graph; Search engine indexing; Modular decomposition; Pathwidth; Mathematics; Discrete mathematics; Information retrieval; Voltage graph; Line graph","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.002055191,0.001391092,0.001776798,0.008366695,0.001388137,0.007144179,0.002800193,0.001359508,0.008208008],"category_scores_gemma":[0.008648727,0.001185534,0.001867929,0.01696601,0.001683885,0.01743289,0.003470077,0.002572844,0.004677618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003807683,"about_ca_system_score_gemma":0.003069573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007122676,"about_ca_topic_score_gemma":0.004584817,"domain_scores_codex":[0.9962883,0.0005552439,0.0005836476,0.0005999291,0.001642424,0.0003304671],"domain_scores_gemma":[0.9971317,0.001332048,0.0002264872,0.0007421661,0.0004563026,0.0001113134],"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.0001372192,0.0001054662,0.0007994389,0.002189713,0.00007579742,0.0001501274,0.0004983844,0.02025232,0.004294382,0.4844748,0.04235276,0.4446696],"study_design_scores_gemma":[0.00003346432,0.00009059723,0.0008098709,0.0008783368,0.00008194736,0.0007398881,0.0002303612,0.06616227,0.007262572,0.4979631,0.4256345,0.0001131515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.01051421,0.0565874,0.8617756,0.002115121,0.0007596476,0.0006639724,0.008142996,0.01548801,0.04395307],"genre_scores_gemma":[0.0810168,0.06701814,0.8209897,0.0013743,0.001609612,0.0008168963,0.01286368,0.003120944,0.01119001],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.008366695,"threshold_uncertainty_score":0.02762675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09244482801013996,"score_gpt":0.3401269591744718,"score_spread":0.2476821311643318,"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."}}