{"id":"W1685302609","doi":"","title":"Generating balanced parentheses and binary trees by prefix shifts","year":2008,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Prefix; Parenthesis; Multiset; Binary tree; Combinatorics; Mathematics; Pointer (user interface); Binary number; Algorithm; Tree (set theory); Discrete mathematics; Computer science; Arithmetic","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":[],"consensus_categories":[],"category_scores_codex":[0.00004834355,0.00008419684,0.00008977457,0.00002316126,0.0002106027,0.00007355559,0.0002818922,0.00002624641,0.00001896754],"category_scores_gemma":[0.00001127559,0.000060528,0.00001410482,0.0000810623,0.00003154024,0.0004961358,0.0003056505,0.00004568753,0.000008398901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000510283,"about_ca_system_score_gemma":0.00001450019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005163058,"about_ca_topic_score_gemma":0.000003548681,"domain_scores_codex":[0.9993289,0.00002470378,0.0001038887,0.0002622605,0.0001339884,0.0001462808],"domain_scores_gemma":[0.999576,0.00004588415,0.00003039701,0.0002650373,0.00001532645,0.00006729655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002248041,0.0004786573,0.03227904,0.00003823789,0.00004796331,0.0001560627,0.002958636,0.0006465262,0.1338302,0.00852031,0.3978456,0.4231763],"study_design_scores_gemma":[0.0005016905,0.0001800454,0.02330707,0.00004127384,0.00000269974,0.00005421299,0.00003974107,0.9492083,0.008821675,0.0003646331,0.01709372,0.0003849957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5244099,0.001606362,0.4714711,0.00043887,0.0001664526,0.00009294305,0.00001063559,0.000250968,0.001552684],"genre_scores_gemma":[0.8644698,0.0002346592,0.1342814,0.0002939905,0.00005742666,0.000008074609,0.00001039717,0.000005041985,0.0006392273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9485617,"threshold_uncertainty_score":0.246826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02152215730994049,"score_gpt":0.2359888717945597,"score_spread":0.2144667144846192,"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."}}