{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003405969,0.00101428,0.001202264,0.00191778,0.001180353,0.003914952,0.001847131,0.002322214,0.008117096],"category_scores_gemma":[0.05069022,0.0007378841,0.0008729666,0.00123178,0.003912636,0.007345117,0.003742283,0.005296547,0.00083709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002211644,"about_ca_system_score_gemma":0.001465934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008629469,"about_ca_topic_score_gemma":0.000602907,"domain_scores_codex":[0.9965684,0.001108454,0.0001456687,0.0005608934,0.001238242,0.0003783228],"domain_scores_gemma":[0.9458343,0.04522979,0.002071339,0.003898858,0.002041364,0.0009243633],"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.0002991744,0.0000496067,0.000891802,0.0001212856,0.00004416531,0.00008951451,0.0001322905,0.1014173,0.002433822,0.871134,0.002948336,0.0204388],"study_design_scores_gemma":[0.00003425895,0.00004897484,0.0004418632,0.00002136153,0.0000134119,0.00007925919,0.00002611125,0.3692459,0.001104906,0.6281015,0.0008581629,0.00002431509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1343933,0.001476064,0.8289927,0.004173011,0.0003329498,0.0000867352,0.0003331232,0.0004947269,0.02971739],"genre_scores_gemma":[0.9363388,0.0007812267,0.05068359,0.0004483534,0.00049741,0.0002311082,0.0002963466,0.0002315826,0.01049161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008117096,"threshold_uncertainty_score":0.02715445,"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."}}