{"id":"W2963904000","doi":"10.1109/icde.2019.00100","title":"Time Constrained Continuous Subgraph Search Over Streaming Graphs","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Subgraph isomorphism problem; Induced subgraph isomorphism problem; Popularity; Streaming data; Graph; Concurrency; Theoretical computer science; Distributed computing; Data mining","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.001091906,0.0006430629,0.0009437096,0.001028233,0.0005583136,0.0009339151,0.001227575,0.000859744,0.002093161],"category_scores_gemma":[0.007793874,0.0004184824,0.0006741918,0.002058594,0.0008402894,0.002583186,0.001145252,0.0008227998,0.0002209834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001060413,"about_ca_system_score_gemma":0.001545529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009177228,"about_ca_topic_score_gemma":0.01055371,"domain_scores_codex":[0.999022,0.0003563571,0.00004557236,0.0002737925,0.0001679763,0.0001343031],"domain_scores_gemma":[0.9951389,0.003629703,0.0003384948,0.000426986,0.000255807,0.000210194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000315053,0.000161011,0.003072514,0.0002214934,0.00007559405,0.000331019,0.0002426373,0.8885345,0.005197696,0.03713609,0.003527809,0.06118464],"study_design_scores_gemma":[0.00002500521,0.0000207373,0.0002359974,0.000002884103,0.000007318848,0.00002860097,0.00004975284,0.9615571,0.0007824805,0.0369231,0.0003627558,0.000004169442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2227432,0.0003505498,0.7712385,0.0008984917,0.00004145532,0.000154445,0.0008409153,0.001275306,0.002457124],"genre_scores_gemma":[0.7983884,0.0002508067,0.1966763,0.0001339724,0.00006220072,0.0001300788,0.001776916,0.0002090865,0.002372181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009177228,"threshold_uncertainty_score":0.01824766,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01140150432744632,"score_gpt":0.2401157780501023,"score_spread":0.2287142737226559,"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."}}