{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005522739,0.0007662887,0.002040903,0.0005808239,0.0005678866,0.00005001652,0.004968018,0.0006873583,0.09654764],"category_scores_gemma":[0.00002896262,0.001119083,0.001158319,0.0005650299,0.002281407,0.001016112,0.002982594,0.0008267161,0.002643272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002559352,"about_ca_system_score_gemma":0.001131156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298921,"about_ca_topic_score_gemma":0.0009402199,"domain_scores_codex":[0.9957979,0.0002478953,0.0007183031,0.001338238,0.001303898,0.0005937345],"domain_scores_gemma":[0.9939686,0.000388534,0.001732016,0.001973779,0.001541224,0.0003958437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004905144,0.0006416151,0.000002231123,0.0006209202,0.002107934,0.001860825,0.006545634,0.0002588858,0.0003846792,0.3048387,0.6619651,0.02028303],"study_design_scores_gemma":[0.002303153,0.0007226533,0.0002705088,0.001138569,0.00055743,0.00003891287,0.003225152,0.003476804,0.001365393,0.002650151,0.9829387,0.001312547],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002461427,0.001810484,0.1915102,0.0006552011,0.0004290243,0.0007264997,0.000860025,0.0001173269,0.8036451],"genre_scores_gemma":[0.0190425,0.0008685305,0.09034099,0.0001316971,0.00005538154,8.139741e-8,0.0001718486,0.00005314474,0.8893358],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3209736,"threshold_uncertainty_score":0.9991259,"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."}}