{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371274,0.001097978,0.000679921,0.001423866,0.0008232531,0.001016826,0.003028082,0.0009241654,0.002978521],"category_scores_gemma":[0.006438981,0.0005192987,0.0005312807,0.002034347,0.00056848,0.002631406,0.001573303,0.001057444,0.001038421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001072621,"about_ca_system_score_gemma":0.001125448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00376448,"about_ca_topic_score_gemma":0.005777189,"domain_scores_codex":[0.9984333,0.0003652654,0.0001091207,0.0004353862,0.0005320847,0.0001248561],"domain_scores_gemma":[0.996874,0.0009565736,0.0002695132,0.001196415,0.0005269249,0.0001765519],"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.001379004,0.0008223874,0.005787711,0.0005236795,0.0001701902,0.000383713,0.0007602753,0.1355367,0.146719,0.0117863,0.03251888,0.6636122],"study_design_scores_gemma":[0.0001096703,0.0001820565,0.001351413,0.00001127148,0.000028052,0.0001809575,0.0001626675,0.9443358,0.03825372,0.007893997,0.007464036,0.0000264501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07289135,0.0003723949,0.8732775,0.0004980551,0.0001023523,0.0003798805,0.0007487378,0.0493444,0.002385389],"genre_scores_gemma":[0.309564,0.000172963,0.6838745,0.0002792224,0.00003374873,0.0002552891,0.002028742,0.001537204,0.002254344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00376448,"threshold_uncertainty_score":0.009964168,"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."}}