{"id":"W4400995520","doi":"10.1007/978-3-031-65633-0_3","title":"Relational Synthesis of Recursive Programs via Constraint Annotated Tree Automata","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Automaton; Theoretical computer science; Tree (set theory); Programming language; Constraint (computer-aided design); Algorithm; 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"],"consensus_categories":[],"category_scores_codex":[0.001147365,0.0005065937,0.0006530471,0.0007446086,0.0001443248,0.0003904528,0.002416952,0.0004006712,0.0000154246],"category_scores_gemma":[0.0001261021,0.0004199849,0.0002197452,0.0008603479,0.001289128,0.0003894176,0.000869037,0.0006532319,0.00008933104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002374705,"about_ca_system_score_gemma":0.0006102629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004275427,"about_ca_topic_score_gemma":0.00006111419,"domain_scores_codex":[0.9959874,0.00005010687,0.0007677117,0.001470142,0.00114405,0.0005806232],"domain_scores_gemma":[0.9972934,0.0004747253,0.0004565685,0.00122418,0.0003904776,0.0001606754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003210645,0.00003344449,0.00003099494,0.000085877,0.00002550248,0.00009707032,0.0004851861,0.0005850474,0.00002898841,0.3595039,0.00001341261,0.6391073],"study_design_scores_gemma":[0.0001911058,0.0003384352,0.0000715077,0.0004560906,0.00003197076,0.0002709628,7.078884e-7,0.2486735,0.0009047243,0.7434549,0.004922792,0.0006832272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00001740234,0.0005924904,0.9806776,0.000433214,0.002108443,0.0006318663,0.000006343646,0.0003345827,0.01519804],"genre_scores_gemma":[0.7309583,0.00002625823,0.2674142,0.00016852,0.000423692,0.00004701233,0.00002202276,0.00005342472,0.0008864711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7309409,"threshold_uncertainty_score":0.9998252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02602210189523775,"score_gpt":0.241249150253616,"score_spread":0.2152270483583782,"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."}}