{"id":"W2282111065","doi":"10.4230/dagrep.4.10.51","title":"Optimal algorithms and proofs (Dagstuhl Seminar 14421)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Council for Research in the Social Sciences, Columbia University; Universität Wien; Julius-Maximilians-Universität Würzburg; Université de Fribourg; Kungliga Tekniska Högskolan; University of Toronto; Universität Ulm; University of Leeds; Middlesex University; State University of New York; National Institute of Informatics; Univerzita Karlova v Praze; Technische Universität Chemnitz","keywords":"Mathematical proof; Computer science; Theoretical computer science; Algorithm; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008963508,0.002298017,0.002109384,0.002698174,0.001896267,0.007636368,0.002056629,0.003586694,0.06127673],"category_scores_gemma":[0.01191963,0.001000111,0.001941529,0.003190905,0.002298896,0.004324706,0.00469037,0.007097813,0.02766083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007561699,"about_ca_system_score_gemma":0.00389363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002247175,"about_ca_topic_score_gemma":0.002119124,"domain_scores_codex":[0.9931075,0.00251702,0.0003523159,0.0009278348,0.002304531,0.0007908675],"domain_scores_gemma":[0.9970363,0.001089578,0.0001480076,0.0004218447,0.000582014,0.000722296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003994869,0.0002059295,0.0001748051,0.0004571735,0.00006450264,0.0001823954,0.0002795021,0.002824961,0.001585617,0.2848742,0.6008456,0.1081057],"study_design_scores_gemma":[0.0002461879,0.0001402866,0.001303875,0.0003930153,0.00005007954,0.000210402,0.0000746284,0.003762373,0.001993965,0.3151133,0.6766516,0.0000602551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0168786,0.169406,0.1365489,0.171013,0.07505097,0.0005001734,0.01099431,0.004684233,0.4149238],"genre_scores_gemma":[0.2767875,0.04819218,0.1123264,0.02076581,0.04107093,0.001407147,0.01292836,0.006042907,0.4804789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06127673,"threshold_uncertainty_score":0.2049911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02797773942102074,"score_gpt":0.2809186440718057,"score_spread":0.2529409046507849,"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."}}