{"id":"W2394599118","doi":"","title":"A Parameterized Formulation for the Maximum Number of Runs Problem.","year":2011,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Parameterized complexity; Combinatorics; Mathematics; String (physics); Bounded function; Alphabet; Upper and lower bounds; Diagonal; Table (database); Function (biology); Discrete mathematics; Constant (computer programming); Computer science; Mathematical analysis; Geometry","routes":{"ca_aff":true,"ca_fund":false,"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.0001493466,0.00005166978,0.00007061582,0.00001306089,0.0000643975,0.00002524847,0.0004325896,0.00002380374,0.00007037554],"category_scores_gemma":[0.000009179205,0.00002768835,0.00004359408,0.00008183426,0.00001043663,0.0003412155,0.0001494049,0.00002393476,0.00001106617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003606795,"about_ca_system_score_gemma":0.00001446237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001243528,"about_ca_topic_score_gemma":0.000003745169,"domain_scores_codex":[0.9995295,0.0000103481,0.0001388172,0.0001240699,0.00009279987,0.0001044579],"domain_scores_gemma":[0.9994033,0.00008661653,0.00006831058,0.0003670623,0.00005420982,0.00002052673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006767077,0.0001608492,0.0009541966,0.00003459282,0.00003633857,6.00149e-7,0.001690672,0.00001289619,0.001665582,0.7776831,0.002599761,0.2150937],"study_design_scores_gemma":[0.001060242,0.0001582689,0.006271394,0.00002484693,0.0000165244,0.00001155266,0.00004682019,0.6822977,0.0121688,0.2855759,0.01216827,0.0001996575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002551859,0.000007802476,0.9927462,0.00008951037,0.00008688138,0.0002852411,0.000003567958,0.00004103785,0.004187921],"genre_scores_gemma":[0.3276937,0.000003090833,0.6720174,0.00006279338,0.00001250318,0.00003711076,0.000002481454,0.000002912241,0.0001679769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6822848,"threshold_uncertainty_score":0.1129098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04923647735752655,"score_gpt":0.2761872924681522,"score_spread":0.2269508151106256,"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."}}