{"id":"W2041058635","doi":"","title":"Towards deterministic tree code constructions.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Computation; Code (set theory); Bounded function; Product (mathematics); Mathematics; K-ary tree; Interval tree; Discrete mathematics; Construct (python library); Theoretical computer science; Computer science; Operator (biology); Algorithm; Tree structure; Binary tree; Combinatorics","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.000489768,0.0003443513,0.000348727,0.0003176127,0.0004585258,0.0001212738,0.001398124,0.0001009014,0.0001426589],"category_scores_gemma":[0.0001234564,0.0003725837,0.0001712515,0.0007889284,0.0002914649,0.0003094996,0.0003120188,0.0005218009,0.0001416973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000516586,"about_ca_system_score_gemma":0.0009136642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001173128,"about_ca_topic_score_gemma":0.000320747,"domain_scores_codex":[0.9971111,0.0002253492,0.0004981615,0.0007873671,0.0006406539,0.0007372982],"domain_scores_gemma":[0.9982884,0.0002856128,0.00024386,0.0007061212,0.0003087131,0.0001673192],"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.00005983587,0.0002252966,0.000280669,0.000009237538,0.00004277296,0.00001935226,0.0004025766,0.0002432265,0.00005195901,0.9778945,0.001131658,0.01963893],"study_design_scores_gemma":[0.0006744458,0.001207047,0.02141731,0.00003165595,0.00001928745,0.0003439723,0.00002664488,0.1646006,0.001616686,0.8067749,0.002668779,0.000618667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03798021,0.00004625619,0.9089966,0.0004783595,0.0007145012,0.0004872274,0.00001934233,0.001723356,0.04955412],"genre_scores_gemma":[0.8381563,0.000002774985,0.1610062,0.000544849,0.00006535305,0.00006141701,0.00001440975,0.00002335552,0.0001253777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8001761,"threshold_uncertainty_score":0.9998726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07038306872289203,"score_gpt":0.2931564632101951,"score_spread":0.2227733944873031,"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."}}