{"id":"W2912891501","doi":"10.14778/3291264.3291270","title":"PS-tree-based efficient boolean expression matching for high-dimensional and dense workloads","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Disjoint sets; Matching (statistics); Predicate (mathematical logic); Memory footprint; Tree (set theory); Theoretical computer science; Algorithm; Parallel computing; 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":[],"consensus_categories":[],"category_scores_codex":[0.0004094632,0.0001487528,0.0001475235,0.00007232679,0.0003614429,0.000143149,0.0004694834,0.00004968543,0.000002519609],"category_scores_gemma":[0.00004410829,0.0001016678,0.00005001475,0.0002398737,0.0001062754,0.0001658128,0.0003080567,0.00007584311,0.000001404191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003996317,"about_ca_system_score_gemma":0.00003702437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005632463,"about_ca_topic_score_gemma":8.853393e-7,"domain_scores_codex":[0.9988123,0.000008069666,0.0002321022,0.000359062,0.0003344691,0.0002539493],"domain_scores_gemma":[0.9992129,0.00005328469,0.000241921,0.0001505258,0.0002714113,0.00006990899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001244611,0.00152413,0.005080095,0.001249247,0.0001269869,0.000002019359,0.007968274,0.0647689,0.6060919,0.0846747,0.04021789,0.1870512],"study_design_scores_gemma":[0.001511022,0.000281036,0.0008332721,0.0008653288,0.00003361237,0.000006953555,0.0000510327,0.3705419,0.6110886,0.01417078,0.00032894,0.0002875057],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6591832,0.0002484464,0.3361087,0.002401297,0.0006627058,0.0006770421,0.000003351175,0.0001595646,0.0005556694],"genre_scores_gemma":[0.8704628,0.000002945771,0.1289369,0.0003167696,0.0001226655,0.00003360185,9.779619e-7,0.00001154424,0.0001117772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.305773,"threshold_uncertainty_score":0.4145892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008289532133585992,"score_gpt":0.2184565017200199,"score_spread":0.2101669695864339,"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."}}