{"id":"W2153294698","doi":"10.1145/2344422.2344432","title":"Succinct ordinal trees based on tree covering","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Tree traversal; Unary operation; Tree (set theory); Mathematics; Combinatorics; Sequence (biology); Set (abstract data type); Parenthesis; Representation (politics); Discrete mathematics; Computer science; Theoretical computer science; Algorithm","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.0002797802,0.0002818338,0.0002253406,0.0002616071,0.0004166827,0.0001481427,0.001171123,0.0001076291,0.0002159696],"category_scores_gemma":[0.00002438303,0.0002409999,0.0001578773,0.0004977433,0.00003995947,0.001044033,0.00003404646,0.0003467371,0.0002872224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001023193,"about_ca_system_score_gemma":0.00005412325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009499177,"about_ca_topic_score_gemma":0.0000146841,"domain_scores_codex":[0.9980994,0.00008396158,0.0002538959,0.0004684331,0.0005344643,0.0005597893],"domain_scores_gemma":[0.9977894,0.0002905658,0.00007189954,0.001519249,0.00004685459,0.0002820249],"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.00003894349,0.0006834074,0.0001333657,0.000007505318,0.00002509857,0.00001267652,0.0001396793,0.005466309,0.0002424572,0.0005062113,0.0005848329,0.9921595],"study_design_scores_gemma":[0.002501627,0.001038771,0.02380911,0.0001586656,0.0000538799,0.00006312293,0.00007151723,0.9041783,0.01569655,0.00066792,0.05070281,0.001057717],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001303836,0.00005662837,0.9943241,0.0009601559,0.001284984,0.0001598954,0.00004000821,0.0003409041,0.001529504],"genre_scores_gemma":[0.7082556,0.0000217388,0.2902845,0.0006900793,0.0002593528,0.00005223608,0.00001274163,0.00002984609,0.0003938616],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9911018,"threshold_uncertainty_score":0.9827691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0244141420401886,"score_gpt":0.2632715715759525,"score_spread":0.2388574295357639,"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."}}