{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009222839,0.0003997659,0.0003718288,0.0004707896,0.0003827122,0.00089787,0.0009534591,0.0005029167,0.003159154],"category_scores_gemma":[0.002507234,0.0003121869,0.0009522221,0.0005092346,0.000957486,0.001297595,0.0009328119,0.0007384205,0.0004450054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006039635,"about_ca_system_score_gemma":0.0008498621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001576497,"about_ca_topic_score_gemma":0.002151206,"domain_scores_codex":[0.9990678,0.0002574319,0.00008598911,0.0001958648,0.0003289736,0.00006395539],"domain_scores_gemma":[0.9985912,0.0008775508,0.00009205394,0.0002414362,0.0001674096,0.00003035339],"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.000139789,0.00009291232,0.0006863419,0.0003766431,0.00007486112,0.0005345424,0.0004795123,0.2715389,0.07650362,0.4725266,0.001701693,0.1753446],"study_design_scores_gemma":[0.00004054775,0.00008837535,0.0001147338,0.00005124455,0.00006113117,0.0001302041,0.00005576991,0.8239384,0.05944621,0.09775118,0.01829408,0.00002801042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01359494,0.00009200289,0.9816017,0.00004931662,0.00002681241,0.00005502238,0.00006315154,0.001137104,0.003379954],"genre_scores_gemma":[0.2752703,0.0001969748,0.7205313,0.00006453025,0.00001912936,0.0001943153,0.0002621539,0.0003798169,0.003081426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003159154,"threshold_uncertainty_score":0.01056844,"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."}}