{"id":"W2016099553","doi":"10.1109/dcc.2012.34","title":"Prospicient Real-Time Coding of Markov Sources over Burst Erasure Channels: Lossless Case","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Algorithm; Markov process; Encoder; Source code; Markov chain; Lossy compression; Lossless compression; Rate–distortion theory; Data compression; Mathematics; 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.0003590282,0.0001472223,0.0002094263,0.0001055373,0.0000583206,0.00002719967,0.0002283614,0.0001006196,0.0002864493],"category_scores_gemma":[0.00001713593,0.0001417486,0.00005534193,0.0001798824,0.00005546748,0.0002276587,0.0001109118,0.000139737,0.00002146976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005884798,"about_ca_system_score_gemma":0.000005927044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001524109,"about_ca_topic_score_gemma":0.00001066476,"domain_scores_codex":[0.9991439,0.00003824543,0.0002712963,0.00009733164,0.0001722813,0.0002769283],"domain_scores_gemma":[0.9991882,0.00007573401,0.00005608571,0.0005282809,0.00006022785,0.00009148994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001095928,0.002336755,0.08375062,0.004382738,0.0009862947,0.0002519424,0.07550786,0.008137257,0.646864,0.07912859,0.06814837,0.03039598],"study_design_scores_gemma":[0.001061714,0.0001325152,0.007321234,0.0006456252,0.0001158525,0.000754202,0.002064942,0.1592827,0.8062701,0.0003319937,0.02019987,0.001819188],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806193,0.000467009,0.002352639,0.00003758237,0.0001024979,0.0002532139,0.00001348473,0.0008337505,0.0153206],"genre_scores_gemma":[0.9957433,0.0001782012,0.00365568,0.00001435836,0.00006773003,0.00003601031,0.000007407961,0.00003769276,0.000259633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1594061,"threshold_uncertainty_score":0.578034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01512948184916092,"score_gpt":0.2481720589761879,"score_spread":0.233042577127027,"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."}}