{"id":"W6891614947","doi":"10.4230/lipics.wabi.2025.3","title":"Approximability of Longest Run Subsequence and Complementary Minimization Problems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Substring; Longest increasing subsequence; Longest common subsequence problem; String (physics); Symbol (formal)","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.0004805698,0.0002411498,0.0003529473,0.0001940009,0.0002388926,0.0002057425,0.0009359987,0.0001062136,0.00000984625],"category_scores_gemma":[0.00005318853,0.0002101676,0.00008268636,0.0003761805,0.0001741389,0.00170031,0.0008540798,0.0001744023,0.000004022233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006402258,"about_ca_system_score_gemma":0.00008492245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005813863,"about_ca_topic_score_gemma":0.00001650996,"domain_scores_codex":[0.9980394,0.000038321,0.0009348743,0.0003013831,0.0003143481,0.0003717009],"domain_scores_gemma":[0.998351,0.0001340959,0.0003526573,0.0008022512,0.0002619436,0.0000980894],"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.0004102945,0.003069167,0.1930661,0.0133198,0.0006486025,0.000008437158,0.02881994,0.002037143,0.001187619,0.357998,0.02073904,0.3786959],"study_design_scores_gemma":[0.004637752,0.0004272969,0.01729448,0.0007058079,0.00005700975,0.00002849817,0.0008756571,0.912863,0.003639568,0.01206411,0.04670354,0.0007033584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08137037,0.0001316306,0.9141344,0.0004900018,0.0004661355,0.001303789,0.0004781287,0.0001189589,0.001506617],"genre_scores_gemma":[0.7519723,0.00009602569,0.2461034,0.0007008699,0.00004293462,0.0001268316,0.000822479,0.00001669991,0.0001184395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9108258,"threshold_uncertainty_score":0.8570384,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01447779321223019,"score_gpt":0.2575422535346263,"score_spread":0.2430644603223961,"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."}}