{"id":"W2977350080","doi":"10.4230/lipics.approx-random.2019.56","title":"String Matching: Communication, Circuits, and Learning","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"String searching algorithm; Upper and lower bounds; VC dimension; Communication complexity; Matching (statistics); String (physics); Sample complexity; Mathematics; Computational complexity theory; Circuit complexity; Pattern matching; Dimension (graph theory); Classifier (UML); Discrete mathematics; Theoretical computer science; Computer science; Electronic circuit; Algorithm; Combinatorics; Artificial intelligence","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.00302425,0.001449997,0.001628033,0.001617669,0.001546228,0.005941142,0.00285959,0.003951639,0.008731903],"category_scores_gemma":[0.02635587,0.0007657026,0.001133268,0.004358197,0.005366049,0.0148977,0.003260267,0.005001312,0.001329639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005895035,"about_ca_system_score_gemma":0.002539647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002533664,"about_ca_topic_score_gemma":0.001777958,"domain_scores_codex":[0.9950873,0.001532058,0.0002548212,0.0012014,0.001300226,0.0006241398],"domain_scores_gemma":[0.9697667,0.02456714,0.001484422,0.002887587,0.000778472,0.0005156911],"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.0006028592,0.0002414701,0.00176703,0.0005229793,0.0000899212,0.0001437197,0.0002231488,0.1867001,0.003895807,0.6134411,0.01540749,0.1769645],"study_design_scores_gemma":[0.00005117033,0.00006493363,0.0003907915,0.00006317107,0.00002289699,0.0001044706,0.00005944648,0.2768163,0.003722764,0.7135212,0.0051543,0.00002858215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1041956,0.01048211,0.8266842,0.01688923,0.000612965,0.0002840525,0.001257816,0.001577079,0.03801709],"genre_scores_gemma":[0.7592721,0.007292592,0.2080162,0.002118865,0.001760448,0.0006831997,0.001874149,0.0004910869,0.01849135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008731903,"threshold_uncertainty_score":0.04277164,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009260590006367071,"score_gpt":0.2318656614130458,"score_spread":0.2226050714066787,"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."}}