{"id":"W4289550979","doi":"10.14778/3551793.3551862","title":"Optimizing differentially-maintained recursive queries on dynamic graphs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Dataflow; Computation; Overhead (engineering); Graph; Probabilistic logic; Parallel computing; Differential (mechanical device); Theoretical computer science; Algorithm; Programming language","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.0003942887,0.0001809755,0.0001959761,0.000165465,0.0005631439,0.00008260253,0.001668837,0.00002248875,0.00003129908],"category_scores_gemma":[0.00003604859,0.000134483,0.0001954766,0.0005631099,0.00009786789,0.0002027025,0.001164272,0.0002625007,0.000002213302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001093376,"about_ca_system_score_gemma":0.00002318783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007841678,"about_ca_topic_score_gemma":6.541462e-7,"domain_scores_codex":[0.998518,0.00003147744,0.0002454755,0.0003698614,0.0005266669,0.0003084652],"domain_scores_gemma":[0.9993058,0.00005301824,0.00026221,0.0002386286,0.00008299636,0.00005736512],"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.00006068415,0.00019509,0.0001081102,0.00002504269,0.00006058945,0.00000159859,0.003151232,0.0003384273,0.01318239,0.9791031,0.000239137,0.003534534],"study_design_scores_gemma":[0.001295479,0.001176443,0.001103514,0.0001201766,0.00005192617,0.00004525929,0.003376738,0.008446545,0.1002805,0.8819236,0.001631013,0.0005488851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9658409,0.0003421474,0.01184952,0.006961285,0.002825807,0.001564766,0.00003721983,0.0004106548,0.01016774],"genre_scores_gemma":[0.9928987,0.00001973183,0.006351932,0.0002899293,0.0000137607,0.000138259,0.000001177093,0.00001247769,0.0002740563],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0971796,"threshold_uncertainty_score":0.5484059,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006113840765845322,"score_gpt":0.2026087788064624,"score_spread":0.196494938040617,"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."}}