{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02106176,0.001739836,0.002882244,0.006006263,0.002121232,0.00540761,0.005783259,0.002728336,0.006920237],"category_scores_gemma":[0.0933056,0.001270005,0.002949477,0.005085347,0.009700039,0.01178587,0.004644255,0.006052853,0.00200183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003637592,"about_ca_system_score_gemma":0.00449162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002283398,"about_ca_topic_score_gemma":0.001501276,"domain_scores_codex":[0.992017,0.002762353,0.0004442135,0.001842645,0.002119652,0.0008141344],"domain_scores_gemma":[0.9209691,0.06004979,0.004245207,0.00492013,0.007767723,0.002048145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001577376,0.00006658011,0.001353043,0.0002984773,0.0001312665,0.000295694,0.0005009891,0.01674102,0.001983249,0.9604725,0.001815794,0.01618372],"study_design_scores_gemma":[0.0001012316,0.0001600349,0.0009320368,0.0001631867,0.00007979035,0.0004392503,0.0001261693,0.2088711,0.002170878,0.7825305,0.004313574,0.0001121296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02592052,0.003275884,0.961987,0.001144621,0.0003135028,0.00012617,0.0003501675,0.0004823889,0.006399798],"genre_scores_gemma":[0.6568456,0.008653063,0.3055421,0.002411855,0.002945197,0.003233754,0.001511283,0.001129709,0.01772755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02106176,"threshold_uncertainty_score":0.1113866,"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."}}