{"id":"W3116457585","doi":"10.14778/3184470.3184473","title":"Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dataflow; Computer science; Computation; Memory footprint; Joins; Massively parallel; Graph; Parallel computing; Theoretical computer science; Distributed computing; Algorithm","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.001575045,0.0001603577,0.0001999588,0.0001211363,0.0002202373,0.00006832754,0.0009290031,0.00004562025,0.00002090053],"category_scores_gemma":[0.0001480197,0.0001177155,0.0001183665,0.0007308742,0.0003340814,0.0006242341,0.0005400721,0.00009278167,0.000002155264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005499443,"about_ca_system_score_gemma":0.00006536766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004552956,"about_ca_topic_score_gemma":0.000002771641,"domain_scores_codex":[0.9983817,0.00003534837,0.0003655687,0.0003188536,0.0006482508,0.000250301],"domain_scores_gemma":[0.998414,0.00003438453,0.0003844012,0.0003204366,0.0007854073,0.00006138466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004689822,0.002076812,0.006718559,0.0008952398,0.0007970812,0.00002647083,0.02174058,0.004421323,0.6214676,0.2684966,0.001857233,0.07103355],"study_design_scores_gemma":[0.001040342,0.0002148137,0.0007748189,0.0002316734,0.0001559275,0.0002184437,0.0010273,0.2044587,0.7731073,0.01842613,0.00007391285,0.0002706313],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9861336,0.00008773525,0.01235624,0.0001112528,0.0003963686,0.0004527783,0.00003512334,0.00004283714,0.0003839976],"genre_scores_gemma":[0.9856083,0.000003871512,0.01424851,0.00002686985,0.00007127653,0.00001962475,0.000002456596,0.000007867031,0.00001118666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2500705,"threshold_uncertainty_score":0.4800299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03065908720145722,"score_gpt":0.2718627820000141,"score_spread":0.2412036947985569,"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."}}