{"id":"W2056117079","doi":"10.1016/j.tcs.2008.11.003","title":"Compressed depth sequences","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Redundancy (engineering); Set (abstract data type); Construct (python library); Probability distribution; Binary logarithm; Algorithm; Code (set theory); Discrete mathematics; Computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000377567,0.0007507027,0.0005788239,0.001445894,0.0005675323,0.001118945,0.0007936671,0.001126892,0.01525741],"category_scores_gemma":[0.003795339,0.0003648114,0.0003206111,0.001562561,0.0006498692,0.002353188,0.001756944,0.001528393,0.002789726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009482599,"about_ca_system_score_gemma":0.00120444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009632664,"about_ca_topic_score_gemma":0.001528433,"domain_scores_codex":[0.9991853,0.00008901958,0.00004189668,0.0001385584,0.0004492932,0.00009589021],"domain_scores_gemma":[0.9988048,0.0003221277,0.00008123648,0.0004150331,0.0002929908,0.00008384438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001195568,0.0001502524,0.0007332492,0.0002951569,0.00004046113,0.000422988,0.0002404876,0.04137991,0.05795444,0.326091,0.02615416,0.5453423],"study_design_scores_gemma":[0.0002232951,0.0004038332,0.001447646,0.0002564853,0.00006110037,0.001561945,0.0002561127,0.3955402,0.1107298,0.3744622,0.1149589,0.0000984222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1119837,0.00320964,0.8079473,0.002344572,0.001324085,0.0004731585,0.004357617,0.003539006,0.06482098],"genre_scores_gemma":[0.5414649,0.001856421,0.3996283,0.0009768774,0.0005717276,0.0004173341,0.005876915,0.0006523913,0.04855518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01525741,"threshold_uncertainty_score":0.05104113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01978348719631589,"score_gpt":0.2557039305618803,"score_spread":0.2359204433655644,"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."}}