{"id":"W2078778545","doi":"10.1007/s00453-014-9894-4","title":"A Framework for Succinct Labeled Ordinal Trees over Large Alphabets","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Theory of computation; Computer science; Combinatorics; Ordinal optimization; Mathematics; Discrete mathematics; Ordinal data; Theoretical computer science; Algorithm; Statistics","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.0004810161,0.0002438049,0.0003071006,0.00009992904,0.0003119111,0.0002218112,0.00119708,0.0001585193,0.00009633906],"category_scores_gemma":[0.0001870343,0.0002043083,0.0001349876,0.0003119298,0.00003102842,0.0005525973,0.000505962,0.0002105179,0.00008242335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004604213,"about_ca_system_score_gemma":0.00004695937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004869412,"about_ca_topic_score_gemma":0.0000161935,"domain_scores_codex":[0.9980209,0.00007895869,0.0002798311,0.0006454837,0.0003540312,0.0006207469],"domain_scores_gemma":[0.9980705,0.000534984,0.000124548,0.0009754798,0.0001055135,0.0001889507],"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.00002596474,0.0002376495,0.0003232043,0.00001842267,0.00004736234,0.000008777636,0.0001448672,0.000007008182,0.0003253693,0.4368566,0.01795216,0.5440526],"study_design_scores_gemma":[0.001876902,0.000412898,0.004142373,0.00009937202,0.00002473314,0.0000170763,0.00002035786,0.6563802,0.00194713,0.07687513,0.2576237,0.0005801531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003886181,0.0001340969,0.9934101,0.0007735493,0.0007670857,0.0002667226,0.00005777236,0.000266312,0.0004381979],"genre_scores_gemma":[0.2129025,0.00001010506,0.7846211,0.001158857,0.0008367043,0.00007985251,0.00004907391,0.00003185424,0.0003099405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6563731,"threshold_uncertainty_score":0.8331451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01274002575439995,"score_gpt":0.2812125145245694,"score_spread":0.2684724887701694,"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."}}