{"id":"W2996401364","doi":"10.1145/3434391","title":"Scalable Pattern Matching in Metadata Graphs via Constraint Checking","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Parallel Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Computer science; Scalability; Theoretical computer science; Vertex (graph theory); Iterated function; Graph; Database; Mathematics","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.003207885,0.001365657,0.001329822,0.002733972,0.001758104,0.004251257,0.004190778,0.001313102,0.00625209],"category_scores_gemma":[0.02563999,0.001073674,0.00254038,0.00405268,0.00202488,0.008414513,0.00426001,0.002190815,0.001955022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826755,"about_ca_system_score_gemma":0.004773722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01128613,"about_ca_topic_score_gemma":0.01665485,"domain_scores_codex":[0.993026,0.001568689,0.0006098966,0.001696162,0.00251958,0.0005796941],"domain_scores_gemma":[0.9827244,0.009591994,0.001383567,0.003900419,0.002048985,0.0003507463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005593203,0.0003778165,0.007645614,0.001233345,0.0002796292,0.0009176658,0.000644568,0.3237474,0.02333977,0.1958505,0.02057707,0.4248273],"study_design_scores_gemma":[0.00006532369,0.00005416877,0.0003962893,0.00005548826,0.00005898391,0.0001701038,0.0002023441,0.7712855,0.01675721,0.2027813,0.008131511,0.00004166141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01344086,0.000133406,0.9756994,0.0004564816,0.00004389047,0.0002700824,0.001097088,0.006526628,0.00233206],"genre_scores_gemma":[0.1690311,0.0002354906,0.822345,0.0003405425,0.00004939744,0.000379941,0.003935695,0.001218515,0.002464329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01128613,"threshold_uncertainty_score":0.02244091,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02814714752405869,"score_gpt":0.2669009362328258,"score_spread":0.2387537887087671,"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."}}