{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001777722,0.0004041216,0.0004486011,0.0001587313,0.0004466662,0.0004506063,0.002476366,0.0002860241,0.00003626119],"category_scores_gemma":[0.00003236804,0.0003803911,0.0001891361,0.0002573581,0.00007760669,0.0004541531,0.005180586,0.0007751523,0.00008491801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008620727,"about_ca_system_score_gemma":0.0002116123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002894177,"about_ca_topic_score_gemma":0.00001409537,"domain_scores_codex":[0.9975517,0.0001488109,0.0004579002,0.001065502,0.0003463575,0.0004297041],"domain_scores_gemma":[0.9973581,0.000228486,0.0002516986,0.001867043,0.0001266647,0.0001679566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006233098,0.003179613,0.1892931,0.0009202671,0.0007843763,0.0003672098,0.00334698,0.009845505,0.01954739,0.01733381,0.5637161,0.1916034],"study_design_scores_gemma":[0.001982957,0.0002071033,0.1441049,0.00462762,0.0002188415,0.00003277004,0.00009530614,0.6068185,0.01321915,0.009955443,0.2152425,0.003494944],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08757383,0.002337384,0.9021867,0.001194566,0.002187774,0.0003362783,0.000444632,0.0006150704,0.00312379],"genre_scores_gemma":[0.867324,0.000466121,0.1262697,0.001376108,0.0004946658,0.0001407878,0.001216835,0.00004130342,0.002670443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7797502,"threshold_uncertainty_score":0.9998648,"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."}}