{"id":"W2952549134","doi":"10.48550/arxiv.1409.1842","title":"On Optimal Multiple Changepoint Algorithms for Large Data","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University and Génome Québec Innovation Centre","funders":"Engineering and Physical Sciences Research Council","keywords":"Pruning; Quadratic growth; Dynamic programming; Computer science; Algorithm; Segmentation; Market segmentation; Minimum description length; Binary number; Series (stratigraphy); Mathematical optimization; Mathematics; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006069169,0.0003301562,0.000437935,0.0002160939,0.0002827319,0.0001964488,0.003700795,0.0002257514,0.0000317539],"category_scores_gemma":[0.0001336869,0.0003501122,0.0002630594,0.00031537,0.00003897278,0.0003627037,0.005833828,0.0003719502,0.00006518965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009088652,"about_ca_system_score_gemma":0.00007462301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009288965,"about_ca_topic_score_gemma":0.00007674722,"domain_scores_codex":[0.9974132,0.00007340468,0.0002248487,0.001667802,0.0001070699,0.0005136503],"domain_scores_gemma":[0.9962078,0.0002414079,0.0003300118,0.002909617,0.0001456039,0.000165535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001268152,0.0004142507,0.0003518499,0.0002207732,0.0005318733,0.0002219997,0.0004033322,0.5792192,0.00001351418,0.3996519,0.006865092,0.01197939],"study_design_scores_gemma":[0.0005814871,0.0001075772,0.00006036654,0.00006042942,0.00007759101,0.000002102488,0.00003855158,0.98544,0.00002831021,0.004615698,0.008589788,0.0003981379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01378142,0.00003494988,0.9842265,0.0001200197,0.0005285934,0.0003283081,0.0002780019,0.000179248,0.0005229845],"genre_scores_gemma":[0.9676175,0.00003179129,0.03035334,0.0001486011,0.000257014,0.000002096262,0.0003639894,0.00002627778,0.001199349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9538732,"threshold_uncertainty_score":0.9998951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1540997626463188,"score_gpt":0.2183145493307442,"score_spread":0.0642147866844254,"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."}}