{"id":"W3164533693","doi":"","title":"Fragile Complexity of Adaptive Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"IT University Of Copenhagen (IT University of Copenhagen)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parameterized complexity; Binary logarithm; Time complexity; Computational complexity theory; Log-log plot; Sorting; Sequence (biology); Element (criminal law); Algorithm; Worst-case complexity; Computer science; Rank (graph theory); Combinatorics; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598854,0.0009435378,0.001026694,0.001520597,0.001119026,0.003956578,0.001600146,0.002024239,0.01136907],"category_scores_gemma":[0.02396057,0.0007139845,0.0009013622,0.001215368,0.003491699,0.006241543,0.003196932,0.005421089,0.001352867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002509352,"about_ca_system_score_gemma":0.001069432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000966089,"about_ca_topic_score_gemma":0.0006336657,"domain_scores_codex":[0.9975223,0.00062985,0.00009658676,0.0004692724,0.0009816248,0.0003004168],"domain_scores_gemma":[0.9832149,0.01267804,0.0007417693,0.0019114,0.0009176353,0.0005362805],"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.0001037663,0.00002453537,0.0003161969,0.00008347368,0.00002685368,0.00003597599,0.00009494225,0.03591304,0.0009548854,0.9418672,0.004921685,0.01565751],"study_design_scores_gemma":[0.00001521289,0.00001886299,0.0002742518,0.0000163943,0.00001091398,0.00004981063,0.00002048801,0.112936,0.0005634233,0.8835048,0.002573446,0.00001636894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1355127,0.004544838,0.6943594,0.006725826,0.0007831358,0.0001106143,0.0006330382,0.0009473288,0.1563831],"genre_scores_gemma":[0.9140435,0.001419239,0.0469807,0.0006045991,0.0007597339,0.0002336978,0.0005219312,0.0004171598,0.03501951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01136907,"threshold_uncertainty_score":0.03803337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05489166506460514,"score_gpt":0.2180314163477243,"score_spread":0.1631397512831192,"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."}}