{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002744194,0.002234193,0.00236447,0.001124968,0.0008067475,0.00222063,0.003121692,0.001978311,0.004590579],"category_scores_gemma":[0.02091342,0.0007720463,0.002599314,0.001590822,0.001966539,0.004963364,0.002384761,0.00345183,0.0007091971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001857066,"about_ca_system_score_gemma":0.002282409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003151824,"about_ca_topic_score_gemma":0.002419391,"domain_scores_codex":[0.9964079,0.0009561551,0.0002039157,0.001236547,0.0007014306,0.0004940077],"domain_scores_gemma":[0.9871234,0.01027529,0.0008633625,0.0007507396,0.0005968451,0.0003904237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001002081,0.0005794253,0.002994038,0.001383792,0.0003718012,0.0004223211,0.0004612626,0.7755355,0.004430923,0.1282067,0.008813028,0.07579909],"study_design_scores_gemma":[0.00007622171,0.0001245639,0.0002350873,0.00003611153,0.00005044524,0.00014447,0.00005789569,0.8524827,0.001184549,0.1442959,0.001295296,0.0000167343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1372034,0.002298654,0.8472252,0.001797573,0.0002536649,0.0001491107,0.0008722727,0.001679373,0.008520677],"genre_scores_gemma":[0.6805069,0.001419481,0.3047794,0.0006701217,0.0005730542,0.0003964912,0.003133249,0.0008659597,0.007655257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004590579,"threshold_uncertainty_score":0.01535702,"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."}}