{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720838,0.0004471428,0.0006805939,0.001639619,0.0005426854,0.001828771,0.0009289016,0.000690767,0.005378894],"category_scores_gemma":[0.005915537,0.0003331098,0.0006181994,0.002873681,0.0008284438,0.004483806,0.001858237,0.001292169,0.001540786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007390163,"about_ca_system_score_gemma":0.0006847558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009066323,"about_ca_topic_score_gemma":0.001236931,"domain_scores_codex":[0.9989135,0.0002714005,0.0001160624,0.0001405932,0.0004466397,0.0001116824],"domain_scores_gemma":[0.9979033,0.0007623777,0.000233216,0.0006459876,0.0003670029,0.00008815269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005772926,0.0001032528,0.001361683,0.0003940515,0.00003335969,0.0003852985,0.0008800855,0.07463483,0.01876434,0.5133047,0.01179558,0.3777656],"study_design_scores_gemma":[0.00008659563,0.0002465656,0.0008187705,0.0002505005,0.00005738942,0.000786528,0.0003766938,0.4260217,0.02440578,0.486762,0.06007905,0.0001083387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03620886,0.0005501157,0.9540681,0.000328994,0.0001195133,0.00009840548,0.001363606,0.001402305,0.005860284],"genre_scores_gemma":[0.388459,0.001030379,0.5974242,0.0003354409,0.0001221719,0.0003386604,0.003917128,0.0004638223,0.007909136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005378894,"threshold_uncertainty_score":0.01799423,"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."}}