{"id":"W1860119121","doi":"10.1007/978-3-540-85654-2_12","title":"On the Evaluation of Large and Sparse Graph Reachability Queries","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Reachability; Bounded function; Search engine indexing; Theoretical computer science; Graph; Graph database; Treewidth; Mathematics; Information retrieval; Pathwidth","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.009203785,0.002217945,0.003139226,0.00272814,0.001997884,0.005101427,0.005034427,0.003454399,0.0118295],"category_scores_gemma":[0.06090453,0.001047739,0.001529758,0.004658374,0.003980103,0.01394565,0.006454334,0.002622859,0.001786156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004467992,"about_ca_system_score_gemma":0.004599447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01360076,"about_ca_topic_score_gemma":0.02143293,"domain_scores_codex":[0.9756796,0.007366719,0.001338374,0.002209983,0.01090184,0.002503468],"domain_scores_gemma":[0.8983542,0.08596526,0.0016611,0.008473454,0.004171532,0.001374403],"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.01021393,0.00124009,0.01341119,0.001529594,0.0004500138,0.0008169285,0.001470356,0.2273459,0.03035927,0.1129677,0.08536121,0.5148338],"study_design_scores_gemma":[0.0003847749,0.0003626977,0.001606038,0.0000704474,0.0001237694,0.000261017,0.0006207477,0.8733992,0.009465449,0.1090847,0.004569821,0.00005132793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5010095,0.004943972,0.3994349,0.007877753,0.001002312,0.001001351,0.003750736,0.03162106,0.0493585],"genre_scores_gemma":[0.8267784,0.0007221408,0.156326,0.0009441964,0.0003911621,0.0002774845,0.004722869,0.00228361,0.007554094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01360076,"threshold_uncertainty_score":0.04867488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04033380389971841,"score_gpt":0.2734266014825541,"score_spread":0.2330927975828357,"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."}}