{"id":"W2995841598","doi":"10.1109/access.2019.2960868","title":"Query-Sensitive Graph Partitioner for Pattern Matching Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Partition (number theory); Workload; Scalability; Theoretical computer science; Tree traversal; Graph; Space partitioning; Graph traversal; Matching (statistics); Cluster analysis; Parallel computing; Algorithm; Artificial intelligence; Mathematics; Database","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001775732,0.00009292438,0.0001059952,0.00008048859,0.0001404412,0.0002288624,0.0006767334,0.00003673448,0.00001062108],"category_scores_gemma":[0.000002207626,0.00008543202,0.0000795619,0.0002540908,0.0000238281,0.0008081369,0.00007856978,0.00007156892,0.000129142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008696426,"about_ca_system_score_gemma":0.00001461142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001825574,"about_ca_topic_score_gemma":0.000006914125,"domain_scores_codex":[0.9992206,0.00003369209,0.0001315518,0.000305377,0.0001084447,0.0002003976],"domain_scores_gemma":[0.9992688,0.0001293931,0.00006906003,0.0004004217,0.000079978,0.00005236786],"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.00002246631,0.0003444332,0.004131052,0.0001860085,0.0001463555,0.00001224029,0.002493653,0.00481901,0.009265787,0.7547523,0.002109039,0.2217176],"study_design_scores_gemma":[0.0008494718,0.00007708514,0.004792246,0.00006161573,0.00002089566,0.00001897474,0.0001144042,0.02014774,0.04104334,0.9269092,0.005340836,0.000624207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08657557,0.00001040522,0.9116162,0.0002725153,0.0004495994,0.000436373,0.00001594939,0.0001128913,0.0005105132],"genre_scores_gemma":[0.9954894,0.000003030079,0.003020722,0.0009842608,0.0001133439,0.0002306218,0.000007692848,0.000008694526,0.0001422654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9089138,"threshold_uncertainty_score":0.3483817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01702631225476916,"score_gpt":0.2826221072212299,"score_spread":0.2655957949664607,"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."}}