{"id":"W4400571454","doi":"10.1016/j.tcs.2024.114728","title":"On suffix tree detection","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Generalized suffix tree; Suffix tree; Compressed suffix array; Suffix; String (physics); Time complexity; Mathematics; K-ary tree; Combinatorics; Tree (set theory); Data structure; Algorithm; Discrete mathematics; Binary tree; Tree structure; Computer science","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008632769,0.0001553675,0.0001181564,0.0002568466,0.0003528243,0.001131416,0.001863846,0.0000446844,0.00004086874],"category_scores_gemma":[0.00004565813,0.0001108811,0.00005974756,0.0013171,0.0008826753,0.0009565447,0.0008833967,0.0002417943,0.0004795721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006564339,"about_ca_system_score_gemma":0.00008364434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002607981,"about_ca_topic_score_gemma":4.479671e-7,"domain_scores_codex":[0.9978176,0.00005832662,0.0001725752,0.0008267611,0.0007027969,0.0004219698],"domain_scores_gemma":[0.9985979,0.0003020469,0.00001894595,0.0008046491,0.00006612815,0.0002103645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002345852,0.00001771669,3.191588e-7,0.000003260614,0.000001130061,0.00001948817,0.0000693192,0.00004557519,0.0006527606,0.6572398,0.0001245712,0.3418237],"study_design_scores_gemma":[0.00005640373,0.0002393155,0.0001143197,0.00004764039,0.000001583423,0.00003696069,7.970749e-7,0.7587305,0.007588968,0.2320822,0.0009690577,0.0001321863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006954866,0.00007058166,0.9844244,0.0006066166,0.002128306,0.00008907776,0.000001505611,0.0006149065,0.005109721],"genre_scores_gemma":[0.9425136,0.000004604447,0.0568686,0.000366886,0.0002128126,0.00000497487,5.865163e-7,0.000007040328,0.00002084369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9355588,"threshold_uncertainty_score":0.9999055,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007287958903204772,"score_gpt":0.2471090558013316,"score_spread":0.2398210968981268,"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."}}