{"id":"W1993117718","doi":"10.1007/s00453-014-9952-y","title":"Randomized Fixed-Parameter Algorithms for the Closest String Problem","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomized algorithm; Theory of computation; Algorithm; Hamming distance; Integer (computer science); Mathematics; String (physics); Context (archaeology); Set (abstract data type); Hamming code; Combinatorics; Discrete mathematics; Computer science","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.002096726,0.0003105832,0.0005479646,0.00009545073,0.000533258,0.0004633566,0.001937716,0.0001176515,0.00001889911],"category_scores_gemma":[0.0004421714,0.000189272,0.000316262,0.0003030053,0.0001678334,0.0005982795,0.000602454,0.0002563159,0.00006072874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003814643,"about_ca_system_score_gemma":0.0000646249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009525238,"about_ca_topic_score_gemma":0.000002878661,"domain_scores_codex":[0.9974059,0.0002362332,0.0005241829,0.0007006355,0.0004347724,0.0006982585],"domain_scores_gemma":[0.9942802,0.003890178,0.0002296621,0.001257464,0.0001674886,0.0001750655],"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.000573552,0.00007751929,0.000004383462,0.00002207432,0.0001061032,0.000002411685,0.0002086875,0.000186553,0.00006448857,0.06961878,0.00599591,0.9231395],"study_design_scores_gemma":[0.03031517,0.00008781445,0.00002381628,0.00003311776,0.00004610558,0.00001909947,0.00001135561,0.8506009,0.001125073,0.02695638,0.09047233,0.0003088361],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001522729,0.0003152027,0.9941586,0.002159361,0.0009442748,0.001310349,0.00002159543,0.0002733045,0.0006649862],"genre_scores_gemma":[0.03158239,0.00006590143,0.9647849,0.0009986102,0.0009866573,0.0007340085,0.00003508412,0.00004529284,0.0007671503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9228307,"threshold_uncertainty_score":0.7718288,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02268408634545443,"score_gpt":0.2687700531542797,"score_spread":0.2460859668088253,"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."}}