{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815643,0.0004723631,0.0005328755,0.002300802,0.001098191,0.001100648,0.0009716192,0.0007190747,0.006884772],"category_scores_gemma":[0.005618224,0.0002600786,0.0004489141,0.003409971,0.0008879894,0.002017447,0.0009848609,0.0007836195,0.001995693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005597632,"about_ca_system_score_gemma":0.0009085875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001835518,"about_ca_topic_score_gemma":0.002305224,"domain_scores_codex":[0.9994643,0.00008482309,0.00005076407,0.0001049958,0.0002126668,0.0000824766],"domain_scores_gemma":[0.9974172,0.001124329,0.0002431332,0.0004412133,0.0006132494,0.0001607892],"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.001420817,0.0001906235,0.004674622,0.0005199494,0.00006303488,0.001565584,0.0009524685,0.04000222,0.04852887,0.4796137,0.02701509,0.395453],"study_design_scores_gemma":[0.00008458283,0.0004259487,0.002817238,0.0001964791,0.00008038618,0.001469091,0.000460271,0.3663155,0.02211486,0.561465,0.04449064,0.00007997647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3044029,0.00196763,0.6529098,0.00124368,0.001057363,0.0001658762,0.001250903,0.001601364,0.03540051],"genre_scores_gemma":[0.6287199,0.001880261,0.3273833,0.0005994337,0.0007540497,0.0001776814,0.004143088,0.0006485956,0.03569375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006884772,"threshold_uncertainty_score":0.02303189,"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."}}