{"id":"W2111607365","doi":"10.14778/1687627.1687727","title":"Distance-join","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reachability; Join (topology); Graph; Theoretical computer science; Query optimization; Shortest path problem; Data mining; Mathematics; Combinatorics","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.0002380526,0.00009968995,0.0001139967,0.00004226512,0.0001025072,0.00006288253,0.001150644,0.00002235302,0.000005090124],"category_scores_gemma":[0.00002376777,0.00006389889,0.00009797885,0.0003516093,0.00004410175,0.0002768878,0.0001550382,0.00008518712,0.000006999832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002200326,"about_ca_system_score_gemma":0.00000958292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001856344,"about_ca_topic_score_gemma":1.220936e-7,"domain_scores_codex":[0.9991654,0.000004138079,0.0001675892,0.0002033222,0.0002597719,0.0001998134],"domain_scores_gemma":[0.9995786,0.0000124418,0.0001231679,0.0001677677,0.00007104229,0.00004697769],"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.000005583996,0.00008432592,0.0002975663,0.000009975845,0.000007881727,3.385319e-7,0.0005244343,0.000004427763,0.01656543,0.9604617,0.001017672,0.02102064],"study_design_scores_gemma":[0.0004583646,0.0001904768,0.006579966,0.00008686649,0.00001124568,0.00001658393,0.0001006456,0.001393803,0.3070242,0.6775364,0.006393623,0.0002077344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5986049,0.001445427,0.1071811,0.03910148,0.002734032,0.002176824,0.00001096872,0.0009812367,0.247764],"genre_scores_gemma":[0.9914644,0.00001197622,0.007607733,0.0004128946,0.00003723623,0.00000730535,7.754238e-8,0.000002892321,0.000455514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3928594,"threshold_uncertainty_score":0.2605721,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006708040847259433,"score_gpt":0.2017328283834329,"score_spread":0.1950247875361735,"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."}}