{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00367894,0.0008903968,0.0008388662,0.001778612,0.001209997,0.003990665,0.003053548,0.00144781,0.01064613],"category_scores_gemma":[0.03631848,0.0008693753,0.001686133,0.002050509,0.003637842,0.01371781,0.005384964,0.004743666,0.001701112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003040008,"about_ca_system_score_gemma":0.002167453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001275819,"about_ca_topic_score_gemma":0.001683446,"domain_scores_codex":[0.9944898,0.001953111,0.0003699709,0.001429435,0.001420829,0.000336765],"domain_scores_gemma":[0.9681359,0.0252516,0.0009341626,0.003977551,0.001301156,0.0003997372],"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.0001675797,0.000104252,0.0006463905,0.0004734161,0.00005046898,0.00005992665,0.0003312162,0.02471915,0.001444433,0.841346,0.00898734,0.1216699],"study_design_scores_gemma":[0.00005347209,0.00002693576,0.00009995086,0.00004153563,0.00001330362,0.00006206854,0.00002622099,0.08034723,0.001169597,0.9099945,0.008152144,0.00001309294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01416486,0.001133068,0.9664042,0.002893298,0.0001636029,0.0001782638,0.0004310301,0.001776962,0.01285466],"genre_scores_gemma":[0.2882204,0.001704806,0.6938996,0.001980314,0.0007076013,0.0006852563,0.001912663,0.0006053309,0.01028408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064613,"threshold_uncertainty_score":0.03561485,"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."}}