{"id":"W2176225957","doi":"10.1007/978-3-319-07566-2_25","title":"On Hardness of Several String Indexing Problems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Substring; String (physics); Combinatorics; Search engine indexing; Upper and lower bounds; Pattern matching; Linear space; Connection (principal bundle); Space (punctuation); Integer (computer science); String searching algorithm; Simple (philosophy); Mathematics; Discrete mathematics; Data structure; Computer science; Information retrieval; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000816351,0.0004445294,0.0005588817,0.0007036616,0.0001965849,0.0003182824,0.00351826,0.0002650759,0.00001381665],"category_scores_gemma":[0.00006849998,0.0003754022,0.000110423,0.000412603,0.0003589895,0.0004754837,0.001929268,0.0007457667,0.00001849491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001510135,"about_ca_system_score_gemma":0.0002955863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002808398,"about_ca_topic_score_gemma":0.00001191493,"domain_scores_codex":[0.9964445,0.00003390283,0.00053744,0.001305713,0.001154917,0.0005235685],"domain_scores_gemma":[0.9974045,0.0003204859,0.0004088385,0.001529224,0.0001962574,0.0001406876],"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.00000700272,0.00003107545,0.00002629201,0.00009690248,0.000009638137,0.00002616068,0.0004559266,0.1743441,0.000106472,0.1144255,0.0000544431,0.7104165],"study_design_scores_gemma":[0.0002957825,0.0002400753,0.0000941822,0.001414821,0.000003782873,0.00002396544,4.711104e-8,0.8445582,0.001024583,0.1501757,0.001648053,0.0005208665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009440193,0.0001093979,0.995378,0.0001272694,0.002154157,0.0002689719,0.00000711349,0.00009959121,0.001761164],"genre_scores_gemma":[0.4047048,0.0000313043,0.5926121,0.001078675,0.0006676456,0.00001069187,0.00001456002,0.00006042786,0.00081973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7098956,"threshold_uncertainty_score":0.9998698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01680298114204639,"score_gpt":0.2348335628054355,"score_spread":0.2180305816633892,"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."}}