{"id":"W6891678007","doi":"10.4230/lipics.cpm.2023.2","title":"Approximation Algorithms for the Longest Run Subsequence Problem","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"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":"Substring; Subsequence; Longest increasing subsequence; Longest common subsequence problem; String (physics); Symbol (formal); Sequence (biology); Bounded function","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001238572,0.0003716774,0.0003373098,0.0002301029,0.0009212797,0.0008752641,0.002320436,0.0001833019,0.000008134223],"category_scores_gemma":[0.0001093815,0.000257875,0.0002306618,0.0007826544,0.0001227991,0.002824798,0.0008190623,0.0003045233,0.0002107299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009406295,"about_ca_system_score_gemma":0.0001058986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002431607,"about_ca_topic_score_gemma":0.000008849373,"domain_scores_codex":[0.9971327,0.00003146909,0.0009238931,0.0003972519,0.0006327824,0.0008818778],"domain_scores_gemma":[0.9972912,0.0004806364,0.0004418394,0.001246593,0.0003712984,0.0001683995],"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.0001691521,0.0005351896,0.001172648,0.002084794,0.0003878519,0.00001501127,0.02136428,0.004703751,0.0003443426,0.1726294,0.1036304,0.6929632],"study_design_scores_gemma":[0.001350612,0.0001741981,0.0005880959,0.0001091122,0.00002250209,0.00003269599,0.0004674098,0.8827728,0.0006139384,0.005399009,0.1080751,0.0003944827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002804762,0.00006915176,0.9898595,0.001599252,0.001226238,0.002584314,0.0006346102,0.0006185407,0.0006036817],"genre_scores_gemma":[0.1169112,0.0004169182,0.8684203,0.002654537,0.00120748,0.004049737,0.004249345,0.0001709342,0.001919527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.878069,"threshold_uncertainty_score":0.9999874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03699491195130999,"score_gpt":0.2847968448206783,"score_spread":0.2478019328693683,"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."}}