{"id":"W1494010234","doi":"10.1007/978-3-642-02927-1_37","title":"Dynamic Succinct Ordered Trees","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Programming language","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.000579741,0.0006518419,0.0006229494,0.0008509996,0.0003455063,0.000760221,0.005164682,0.0003682225,0.00004101386],"category_scores_gemma":[0.00005336176,0.0005510968,0.000154225,0.0006496616,0.0004113425,0.0009826274,0.001873749,0.0008555817,0.00009112112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002920341,"about_ca_system_score_gemma":0.000519552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003373589,"about_ca_topic_score_gemma":0.0001768428,"domain_scores_codex":[0.9955353,0.00003333587,0.000552987,0.001930433,0.00115945,0.0007884807],"domain_scores_gemma":[0.9967368,0.0002754876,0.0002946661,0.002261536,0.0002013787,0.0002301744],"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.000003776607,0.00002745629,0.000007515434,0.000009273903,0.00000513191,0.000120049,0.0001366647,0.007445282,0.00007839647,0.005438141,0.00005652691,0.9866718],"study_design_scores_gemma":[0.0003051653,0.0002211956,0.0004890535,0.0003467924,0.000006210246,0.00009928109,5.342401e-8,0.8204366,0.0001750109,0.1697078,0.007448433,0.000764347],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003339685,0.0008984167,0.9919209,0.0009493895,0.001506785,0.0003132084,0.00001083284,0.0002811008,0.004085976],"genre_scores_gemma":[0.04504078,0.0001948093,0.9503138,0.002175821,0.0004019127,0.000006944681,0.00003327951,0.00005147938,0.001781167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9859074,"threshold_uncertainty_score":0.999694,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0100627812561948,"score_gpt":0.2406592469214585,"score_spread":0.2305964656652637,"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."}}