{"id":"W4415312698","doi":"10.48550/arxiv.2506.14734","title":"Compressing Suffix Trees by Path Decompositions","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Suffix tree; Suffix; Compressed suffix array; Generalized suffix tree; Path (computing); String (physics); Bounded function; Time complexity","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971657,0.0007860299,0.0007476185,0.001190734,0.0005411338,0.001541531,0.00102392,0.0007437986,0.004833821],"category_scores_gemma":[0.005898063,0.0004560507,0.0009109284,0.002201053,0.0008163918,0.003608231,0.001742425,0.001436087,0.002851479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006925905,"about_ca_system_score_gemma":0.001213298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009868963,"about_ca_topic_score_gemma":0.002019543,"domain_scores_codex":[0.9990259,0.0001425304,0.00008264398,0.00022352,0.0003896444,0.0001356941],"domain_scores_gemma":[0.9976717,0.0009781551,0.0002011082,0.0007149705,0.0003370929,0.00009707369],"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.0006639406,0.0002539048,0.003438179,0.0006426228,0.00008616552,0.0005773391,0.0008678863,0.1508502,0.05927786,0.2194156,0.0165229,0.5474033],"study_design_scores_gemma":[0.00007190923,0.0002000035,0.0005194585,0.00008338037,0.00004542648,0.0004090192,0.0001598335,0.6996348,0.01963164,0.2612017,0.01801028,0.00003254571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0576679,0.0008474279,0.9315866,0.0002861066,0.0001177169,0.0001596136,0.0007573062,0.003092779,0.005484589],"genre_scores_gemma":[0.3333376,0.001231935,0.6542239,0.0003562573,0.0002151632,0.0003699158,0.003194873,0.0009105309,0.00615987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004833821,"threshold_uncertainty_score":0.01617074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02930179587211001,"score_gpt":0.2869185457823156,"score_spread":0.2576167499102056,"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."}}