{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003180914,0.0002715632,0.0002790757,0.0003781878,0.0002355209,0.0001908003,0.001875362,0.000102007,0.00001676739],"category_scores_gemma":[0.000217647,0.0001876575,0.00006532385,0.0004026918,0.0008693115,0.0005002423,0.001172658,0.0003384921,0.000006389573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007314931,"about_ca_system_score_gemma":0.0001785818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002018616,"about_ca_topic_score_gemma":0.00006018137,"domain_scores_codex":[0.9970309,0.00008534194,0.000313526,0.0009032519,0.001365669,0.000301361],"domain_scores_gemma":[0.9975877,0.000497848,0.0002208171,0.001398307,0.0002431014,0.00005224219],"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.000004606249,0.00004873563,0.00005989626,0.00002835747,0.00001334464,0.000009092995,0.001042289,0.002005702,0.00001325771,0.1932994,0.0001895061,0.8032858],"study_design_scores_gemma":[0.0003241045,0.0001970076,0.001261168,0.0002224416,0.00001794104,0.00001301996,5.250766e-7,0.5133452,0.0004450366,0.4819528,0.001831271,0.0003895285],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001155148,0.0003635837,0.9927686,0.0009855042,0.0005983866,0.00051189,0.00001170867,0.00004469824,0.003560512],"genre_scores_gemma":[0.8316693,0.00042336,0.1648277,0.002362481,0.0002993913,0.0000338426,0.00001999132,0.00003369313,0.0003301711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8305142,"threshold_uncertainty_score":0.7652449,"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."}}