{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020408,0.0001357737,0.0002071955,0.0001702385,0.0001807735,0.0001136395,0.0005996138,0.00004077315,0.00001779901],"category_scores_gemma":[0.0001896492,0.0001332598,0.00008556974,0.0006016582,0.00006142744,0.000454196,0.00003910171,0.00009076017,0.000005651945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005802691,"about_ca_system_score_gemma":0.0001591413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001316686,"about_ca_topic_score_gemma":0.00005381612,"domain_scores_codex":[0.9980745,0.0002352748,0.0003884325,0.0004942946,0.0006048257,0.0002027081],"domain_scores_gemma":[0.9974092,0.0002692099,0.0001258492,0.001737981,0.0004003355,0.00005740086],"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.0001000797,0.002955456,0.0001141564,0.00200018,0.0006857818,0.00001973552,0.001820588,0.06124807,0.01467163,0.1490546,0.0009092907,0.7664204],"study_design_scores_gemma":[0.003114942,0.0001890191,0.0001752371,0.0004258941,0.0002522222,0.00002119481,0.001511416,0.9653699,0.02225854,0.001721802,0.004492366,0.0004674848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008771741,0.0001458807,0.9876969,0.0003031282,0.0009872316,0.0007476862,0.0009864005,0.00009535594,0.0002656474],"genre_scores_gemma":[0.9251003,0.00001788003,0.07392434,0.00003331338,0.00004246864,0.0003211238,0.0003813956,0.00001202029,0.0001671775],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9163285,"threshold_uncertainty_score":0.5434178,"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."}}