{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00244826,0.0007327997,0.000676871,0.001146026,0.00132252,0.001586786,0.001809778,0.0015701,0.002662018],"category_scores_gemma":[0.01170006,0.0008088632,0.001060499,0.001243714,0.00335729,0.003722366,0.004984215,0.004225574,0.001331727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622329,"about_ca_system_score_gemma":0.001732417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009590961,"about_ca_topic_score_gemma":0.001080953,"domain_scores_codex":[0.9969164,0.0008354528,0.0001236962,0.0004115807,0.001377934,0.0003349028],"domain_scores_gemma":[0.9898997,0.005273224,0.000745244,0.002620853,0.001168926,0.0002920725],"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.00005880633,0.00003536207,0.0003681454,0.0001573765,0.00001882247,0.000100144,0.0002836315,0.02753241,0.007653637,0.9378319,0.001878325,0.02408143],"study_design_scores_gemma":[0.00003818251,0.00007856374,0.0001854617,0.00008244756,0.00002625757,0.0003301861,0.00005143578,0.2092677,0.01799031,0.7556311,0.01625347,0.00006499704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0115422,0.000356261,0.982451,0.0003068398,0.00006636453,0.00005610978,0.00008339479,0.0003646525,0.00477304],"genre_scores_gemma":[0.289592,0.001038187,0.7005997,0.0004492055,0.0001477431,0.0005657228,0.0003167539,0.0004224798,0.006868123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002662018,"threshold_uncertainty_score":0.0129478,"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."}}