{"id":"W4293833158","doi":"","title":"A Central Limit Theorem for the Length of the Longest Common Subsequence in Random Words","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Longest increasing subsequence; Limit (mathematics); Longest common subsequence problem; Subsequence; Central limit theorem; Mathematics; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis","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.001066884,0.0002379986,0.0003888751,0.00004785862,0.0001339096,0.0001729042,0.004528794,0.0001657784,0.00001116373],"category_scores_gemma":[0.0001152385,0.0001100774,0.0002215463,0.0001676912,0.0001736068,0.0001391831,0.003240082,0.0005256116,0.000001568844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004601487,"about_ca_system_score_gemma":0.0001862555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000791774,"about_ca_topic_score_gemma":0.0005446022,"domain_scores_codex":[0.9981285,0.0002457559,0.0004209563,0.0004919307,0.0003530492,0.0003598035],"domain_scores_gemma":[0.996227,0.00118586,0.0002966353,0.002166245,0.00007261011,0.00005170646],"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.0004361981,0.0004433574,0.008087398,0.0004031679,0.0001531606,0.000007941414,0.005000637,0.04214962,0.0001596151,0.5919832,0.005863016,0.3453127],"study_design_scores_gemma":[0.001526674,0.0000498414,0.01661298,0.0004315639,0.00002694187,0.000006357541,0.00005942908,0.9370852,0.001355214,0.03785353,0.004674552,0.0003177666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01331984,0.0005306985,0.9793588,0.002804857,0.001549949,0.001272467,0.00003923967,0.00005559908,0.00106857],"genre_scores_gemma":[0.9863576,0.000162634,0.01274813,0.0003008424,0.0001494455,0.0001090671,0.0000105499,0.00001217526,0.000149527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9730378,"threshold_uncertainty_score":0.8415703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02277497908642127,"score_gpt":0.2591781459211234,"score_spread":0.2364031668347022,"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."}}