{"id":"W4411089206","doi":"10.1016/j.ic.2025.105313","title":"The longest subsequence-duplicated subsequence and related problems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Longest increasing subsequence; Subsequence; Longest common subsequence problem; Combinatorics; Computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0002671714,0.00008283719,0.00006832989,0.00008496347,0.0004333371,0.0005880017,0.0002215507,0.00004935215,8.498632e-7],"category_scores_gemma":[0.00003030501,0.00005888576,0.00001158332,0.0003719697,0.00007781485,0.001878919,0.0001557047,0.00009479062,0.00001378934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002040903,"about_ca_system_score_gemma":0.00004819237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000422082,"about_ca_topic_score_gemma":0.000004255974,"domain_scores_codex":[0.9992994,0.00003423633,0.0002873445,0.0001265819,0.0001319255,0.0001205282],"domain_scores_gemma":[0.999441,0.00009771778,0.000123915,0.0001683571,0.0001278571,0.00004114903],"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.000004186257,0.000008050503,0.0003804143,0.00002952577,0.00001030807,5.727883e-7,0.0008106557,0.001654215,0.00007259993,0.190844,0.0007298111,0.8054556],"study_design_scores_gemma":[0.0003260852,0.00002948165,0.02488789,0.00005012063,0.000003538218,0.00002464783,0.00007044735,0.9326237,0.00008857296,0.03215058,0.009644996,0.00009988468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03489769,0.0005742729,0.9567411,0.004049541,0.0002911683,0.0003349402,0.000002869085,0.000211441,0.002896998],"genre_scores_gemma":[0.9946054,0.0003476818,0.004476411,0.0003983164,0.00000617392,0.00002362524,0.00004125107,0.000001869466,0.00009930031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9597077,"threshold_uncertainty_score":0.5670114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007996093520544739,"score_gpt":0.2384342259044898,"score_spread":0.2304381323839451,"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."}}