{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001242835,0.0006051884,0.0007724563,0.0006332759,0.0004850532,0.001121471,0.003055501,0.0003437245,0.00004381627],"category_scores_gemma":[0.000022664,0.000672811,0.0004736125,0.0008163505,0.0001124657,0.0007299689,0.0005503821,0.002334896,0.00001717982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113367,"about_ca_system_score_gemma":0.0001794897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004791545,"about_ca_topic_score_gemma":0.0001395897,"domain_scores_codex":[0.995837,0.0004639968,0.0008925293,0.00152004,0.0005072257,0.0007791632],"domain_scores_gemma":[0.9966798,0.0004170334,0.0003283689,0.002296999,0.0001050867,0.0001726794],"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.000006849811,0.0003336099,0.0001488684,0.0001661889,0.0001709122,0.0002370508,0.002681863,0.5328857,0.0001706857,0.002012963,0.000003227553,0.4611821],"study_design_scores_gemma":[0.001445182,0.00008698383,0.002096549,0.002202785,0.0001052338,0.0002656695,0.001004471,0.8202501,0.001112072,0.1694683,0.00007133702,0.001891308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05298248,0.0002979836,0.9440471,0.0004548813,0.001298507,0.0003714474,0.00001626994,0.000356405,0.0001749074],"genre_scores_gemma":[0.7410623,0.00004480229,0.2583798,0.0003622949,0.00003789613,0.00002478152,0.00002952937,0.00003171256,0.00002683474],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6880799,"threshold_uncertainty_score":0.9999667,"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."}}