{"id":"W2465968014","doi":"10.4230/lipics.ccc.2016.10","title":"Learning Algorithms from Natural Proofs","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Algorithm; Mathematics; Constant (computer programming); Class (philosophy); Natural number; Discrete mathematics; Prime (order theory); Upper and lower bounds; Combinatorics; Concept class; Computer science; Artificial intelligence","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"],"consensus_categories":[],"category_scores_codex":[0.0005072934,0.000460062,0.000469071,0.0002789764,0.0005614501,0.0005715269,0.002079182,0.0002016819,0.00006077023],"category_scores_gemma":[0.0001779431,0.0003274273,0.0003505609,0.0004291332,0.0001949368,0.002849846,0.0009048503,0.0005515441,0.0003367439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001310147,"about_ca_system_score_gemma":0.00008376033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002989845,"about_ca_topic_score_gemma":0.00001476196,"domain_scores_codex":[0.9968635,0.00006380792,0.0009671875,0.0004697702,0.0006744647,0.0009612708],"domain_scores_gemma":[0.9976504,0.0004143759,0.0004195322,0.0009687967,0.00029405,0.0002527985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008038716,0.0003084121,0.004300504,0.0001491243,0.000304065,0.00001850775,0.009280618,0.00003390141,0.0004508252,0.03600101,0.004496244,0.9445764],"study_design_scores_gemma":[0.01035723,0.001037558,0.005559648,0.0008255141,0.00006994302,0.0001548512,0.001119388,0.4413778,0.009256361,0.04408989,0.4835239,0.002627968],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07160636,0.0001448793,0.9185911,0.00148217,0.00332983,0.0009900447,0.0003632367,0.0009019947,0.002590412],"genre_scores_gemma":[0.7539997,0.00006970901,0.2419025,0.001165595,0.0006271158,0.0001694102,0.0002372545,0.00006438616,0.001764398],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9419484,"threshold_uncertainty_score":0.9999178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01391521125942484,"score_gpt":0.2417513759784208,"score_spread":0.227836164718996,"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."}}