{"id":"W4386512674","doi":"10.2139/ssrn.4564689","title":"On Suffix Tree Detection","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Tree (set theory); Suffix tree; Computer science; Mathematics; Linguistics; Combinatorics; Philosophy","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.001882642,0.001491684,0.002219278,0.00442055,0.001615854,0.003275356,0.002298357,0.002836604,0.01081341],"category_scores_gemma":[0.01495763,0.0009842085,0.0009684114,0.006635626,0.001570209,0.005764022,0.004146445,0.002166518,0.006136088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007718774,"about_ca_system_score_gemma":0.001363506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001785958,"about_ca_topic_score_gemma":0.001951035,"domain_scores_codex":[0.9964439,0.0007814575,0.0002948347,0.0007102719,0.001517516,0.0002520951],"domain_scores_gemma":[0.991025,0.004734084,0.0002889488,0.002328431,0.001423351,0.0002002131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005183059,0.0001359089,0.001363463,0.0002296663,0.00009624762,0.0002301362,0.0001390536,0.01825787,0.01659839,0.03496007,0.01927047,0.9082004],"study_design_scores_gemma":[0.00006635257,0.0002326922,0.001609303,0.0001288318,0.0001238546,0.001333304,0.0001675471,0.7088711,0.03428059,0.2190716,0.03404258,0.00007228011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02410852,0.003235591,0.9564677,0.001432726,0.0008650491,0.0001297721,0.000571596,0.003350937,0.00983816],"genre_scores_gemma":[0.2236293,0.003410389,0.7349882,0.001274607,0.001826103,0.0002647415,0.003554692,0.001053373,0.02999855],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01081341,"threshold_uncertainty_score":0.03617448,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01701852658795877,"score_gpt":0.2568507696630004,"score_spread":0.2398322430750416,"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."}}