{"id":"W2042983118","doi":"10.1016/j.ipl.2006.08.003","title":"On the longest increasing subsequence of a circular list","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest common subsequence problem; Longest increasing subsequence; Subsequence; Monte Carlo method; Combinatorics; Algorithm; Mathematics; Computer science; Discrete mathematics; Statistics","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":[],"consensus_categories":[],"category_scores_codex":[0.0003624086,0.00008559517,0.00007547998,0.00009110587,0.0002066282,0.0003408154,0.0005485254,0.00002664549,0.000004437626],"category_scores_gemma":[0.00006079348,0.00005855003,0.00002699345,0.0003077631,0.00006791278,0.002619188,0.00008238473,0.00009792444,0.00001764241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003141819,"about_ca_system_score_gemma":0.00004238044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001920492,"about_ca_topic_score_gemma":8.011084e-7,"domain_scores_codex":[0.9991213,0.0000368805,0.0002752607,0.00009376144,0.0003351611,0.0001376375],"domain_scores_gemma":[0.9992527,0.00008624861,0.0002520836,0.0003059933,0.00008272299,0.00002030015],"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.00009450674,0.0002788175,0.00475075,0.0009852302,0.00003728921,0.00003785476,0.00915525,0.0320405,0.09135597,0.3484968,0.03687039,0.4758967],"study_design_scores_gemma":[0.001102291,0.0001062672,0.03628549,0.001373148,0.00001988279,0.0001788368,0.0002140156,0.8879683,0.03947518,0.01368888,0.01863484,0.0009528772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2792058,0.0000335919,0.7157043,0.003632881,0.00007875704,0.00008555425,0.000003081951,0.00007934974,0.001176624],"genre_scores_gemma":[0.9867995,8.490015e-7,0.009826786,0.00331647,0.00003040754,0.000006535002,0.00001399046,0.000002703783,0.000002695045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8559278,"threshold_uncertainty_score":0.3286491,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008014596510657073,"score_gpt":0.199122138349867,"score_spread":0.1911075418392099,"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."}}