{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003768486,0.00005004194,0.00007468829,0.0001070934,0.00002485028,0.00004409845,0.0007031627,0.00001357886,0.00002660793],"category_scores_gemma":[0.00001050064,0.00003894127,0.00003071397,0.0006513744,0.00002005314,0.0004589339,0.0002083495,0.0000295985,0.0000911603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003405967,"about_ca_system_score_gemma":0.000005382921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006803039,"about_ca_topic_score_gemma":0.00001127663,"domain_scores_codex":[0.9993722,0.00002996089,0.0001014332,0.0002130903,0.0001765994,0.0001067283],"domain_scores_gemma":[0.9991934,0.00003101269,0.00002553116,0.0007034541,0.0000153911,0.00003123042],"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":[9.718009e-7,0.00007421388,0.002240757,0.00002507227,0.000005663055,0.000002432699,0.00007263762,0.00001044977,0.00006824075,0.7789921,0.004447437,0.2140601],"study_design_scores_gemma":[0.0006210099,0.0009011825,0.471675,0.00007261268,0.00001054317,7.696628e-7,0.000120683,0.1273629,0.00467695,0.3577172,0.03631306,0.0005280894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6895733,0.0003091414,0.1768144,0.007027305,0.002214283,0.00122334,0.00007006065,0.004568982,0.1181992],"genre_scores_gemma":[0.9807469,0.0001955026,0.01615489,0.0006142639,0.00002969314,0.00001121704,0.00003300354,0.000006976951,0.002207582],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4694342,"threshold_uncertainty_score":0.1587979,"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."}}