{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000865591,0.0004702317,0.0006123971,0.0005054222,0.000131625,0.0004932148,0.002292351,0.0003748789,0.0004579664],"category_scores_gemma":[0.00002305444,0.0004210099,0.0004525149,0.0004721685,0.0003129815,0.0002684269,0.002052545,0.000904658,0.0004623921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002659742,"about_ca_system_score_gemma":0.0002249802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007613442,"about_ca_topic_score_gemma":0.000002895992,"domain_scores_codex":[0.9969478,0.0002591265,0.0004227024,0.001149731,0.0005554606,0.0006652392],"domain_scores_gemma":[0.9974799,0.0003042438,0.0001629536,0.001676667,0.0001750694,0.0002011607],"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.00003516594,0.0003404366,0.00347494,0.0003138943,0.0006751491,0.0003455649,0.001995016,0.001997123,0.00252435,0.9187258,0.002846491,0.06672609],"study_design_scores_gemma":[0.002959542,0.0004861446,0.008905669,0.0007159399,0.0001131939,0.0001927683,0.0003305183,0.479874,0.005473438,0.4957942,0.001370869,0.003783749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.498108,0.0003442042,0.4212708,0.0004593703,0.002841915,0.001549371,0.0001260278,0.001563076,0.07373718],"genre_scores_gemma":[0.9737648,0.00003048156,0.01932349,0.0003333406,0.00007959367,0.00002249063,0.00004264705,0.0000332587,0.006369915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4778768,"threshold_uncertainty_score":0.9998242,"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."}}