{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006659167,0.0002424233,0.0002918446,0.0001545973,0.000527196,0.0006878875,0.001291236,0.0001251134,0.00002014021],"category_scores_gemma":[0.00004606965,0.0002189823,0.0000809322,0.0001973024,0.00004865875,0.002723784,0.001231306,0.0005512558,0.0001321952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004965766,"about_ca_system_score_gemma":0.00004161803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003002456,"about_ca_topic_score_gemma":0.000002964621,"domain_scores_codex":[0.9982916,0.00005670921,0.0006173642,0.0002478784,0.0003404154,0.0004460556],"domain_scores_gemma":[0.9981498,0.0002099687,0.0003279969,0.001013714,0.0001495595,0.0001490306],"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.00007194582,0.0005592306,0.05667001,0.002047554,0.0003710368,0.000007780313,0.07400715,0.003246212,0.0008880559,0.3978469,0.007112067,0.457172],"study_design_scores_gemma":[0.005245824,0.0004142032,0.00910229,0.0007417398,0.00003260974,0.0001604332,0.00435998,0.6235982,0.0006767676,0.008056708,0.346253,0.001358156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3956515,0.000240742,0.5977827,0.000295948,0.0005213167,0.000829438,0.00006926216,0.0003531017,0.004255957],"genre_scores_gemma":[0.9349178,0.0001260575,0.06362992,0.0004733736,0.00004851634,0.00003157617,0.0002603265,0.00002663393,0.0004857793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.620352,"threshold_uncertainty_score":0.892984,"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."}}