{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002386493,0.001283068,0.002016978,0.003012727,0.001931449,0.003174458,0.004250894,0.001579977,0.02229116],"category_scores_gemma":[0.008770889,0.000670936,0.001654,0.005367994,0.0006916338,0.005055226,0.004442924,0.001840227,0.008290081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009400303,"about_ca_system_score_gemma":0.001435233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002195672,"about_ca_topic_score_gemma":0.003737273,"domain_scores_codex":[0.9952506,0.0006800601,0.0005134137,0.001286386,0.001969492,0.0003001595],"domain_scores_gemma":[0.9952947,0.001164407,0.0003038366,0.002207682,0.0007572607,0.0002720557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001196244,0.0006818881,0.0036315,0.0008906203,0.0003523468,0.0002803667,0.0004701106,0.04489188,0.01064876,0.08609165,0.08818434,0.7626804],"study_design_scores_gemma":[0.0003860822,0.0007611435,0.001998132,0.0001244409,0.0002042013,0.001628282,0.0007702838,0.4901126,0.03217194,0.2459951,0.2256812,0.0001665319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01479942,0.001453367,0.9535672,0.0006500403,0.0004368774,0.0006011936,0.004519517,0.008758062,0.01521421],"genre_scores_gemma":[0.1477823,0.0008740947,0.8205541,0.0004753306,0.0003240766,0.0005161673,0.01379753,0.00144472,0.01423155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02229116,"threshold_uncertainty_score":0.07457131,"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."}}