{"id":"W3129088492","doi":"10.1007/978-3-030-75242-2_10","title":"Fragile Complexity of Adaptive Algorithms","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Fonds De La Recherche Scientifique - FNRS; Natural Sciences and Engineering Research Council of Canada; National Foundation for Science and Technology Development; Danmarks Frie Forskningsfond; National Science Foundation","keywords":"Parameterized complexity; Binary logarithm; Sequence (biology); Element (criminal law); Mathematics; Log-log plot; Sorting; Time complexity; Combinatorics; Computational complexity theory; Rank (graph theory); Algorithm; Worst-case complexity; Algorithmic complexity; Discrete mathematics; Computer science; Theoretical computer science","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":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001001621,0.000481166,0.0007861927,0.0005371186,0.0002156558,0.0006365059,0.005861488,0.0003083399,0.00002014978],"category_scores_gemma":[0.0001387103,0.0004352494,0.0001852487,0.002000523,0.001209786,0.0008323783,0.01355405,0.001183613,0.000005017554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002022323,"about_ca_system_score_gemma":0.001152069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005598704,"about_ca_topic_score_gemma":0.00007243204,"domain_scores_codex":[0.9951112,0.0001897328,0.0006825025,0.002021526,0.001297269,0.000697715],"domain_scores_gemma":[0.9957457,0.0003441442,0.0004496509,0.002672527,0.0005873028,0.0002006491],"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.000007408052,0.000275863,0.0003201808,0.00009966557,0.00002090827,0.0001225163,0.002597393,0.1800652,0.0007154817,0.001625084,0.00002399616,0.8141263],"study_design_scores_gemma":[0.0002106583,0.0001005955,0.002792536,0.0004587072,0.000004661016,0.00002781554,0.000001757421,0.9329017,0.01444617,0.04858885,0.00002117441,0.0004453819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008193399,0.0007717559,0.9867845,0.0004278487,0.003284584,0.0003387353,0.00003292559,0.0001309526,0.00003533862],"genre_scores_gemma":[0.4418377,0.00002055595,0.5577267,0.000223173,0.0001581937,0.000009975327,0.00001454798,0.000008775933,3.313092e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8136809,"threshold_uncertainty_score":0.9998099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04316441161221374,"score_gpt":0.2848617245205761,"score_spread":0.2416973129083623,"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."}}