{"id":"W2998529453","doi":"10.1109/csci46756.2018.00240","title":"On Evaluation of Graph Pattern Matching in Large Databases","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Reachability; Graph database; Factor-critical graph; Graph; Matching (statistics); Theoretical computer science; Graph factorization; Pattern matching; Data mining; Line graph; Artificial intelligence; Mathematics; Voltage graph","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.001330152,0.00004616884,0.00005774664,0.0001258918,0.00003307041,0.00001349303,0.0002478299,0.00001061633,0.0001181876],"category_scores_gemma":[0.00002498604,0.00003732001,0.00001961394,0.0002438781,0.00001983937,0.0002454005,0.00007815649,0.00003784143,0.0000313663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005661269,"about_ca_system_score_gemma":0.00001340273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004913857,"about_ca_topic_score_gemma":0.0001229231,"domain_scores_codex":[0.999256,0.0001208964,0.0001085863,0.0001535049,0.0002537226,0.000107306],"domain_scores_gemma":[0.9995356,0.00006079737,0.00003433604,0.0002924933,0.00005977463,0.0000169614],"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.000005246185,0.0002341763,0.004249892,0.000008484718,0.000007685,0.000002278447,0.001553039,0.00009200096,0.0007880846,0.8610172,0.0001392765,0.1319027],"study_design_scores_gemma":[0.001205786,0.0002081077,0.04727645,0.0001109152,0.000007758858,0.000002971091,0.0001790775,0.2454973,0.02405194,0.6811863,0.0000628566,0.0002105305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4878768,0.000006220813,0.5101674,0.00003910337,0.0001139968,0.00004782592,0.000002656134,0.00001728575,0.001728734],"genre_scores_gemma":[0.9962793,7.217002e-7,0.003447671,0.0002344247,0.00001705037,0.000003324862,0.00000249549,0.000001814525,0.00001317877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5084025,"threshold_uncertainty_score":0.1521866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04013647443571729,"score_gpt":0.314112528511913,"score_spread":0.2739760540761957,"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."}}