{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001902782,0.0008605481,0.0007044211,0.0009089711,0.0003836433,0.001093575,0.0009677887,0.0008333856,0.001208077],"category_scores_gemma":[0.008195437,0.0003761492,0.0003606449,0.0007656698,0.002087938,0.002248475,0.001413331,0.001609462,0.0002147179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001349549,"about_ca_system_score_gemma":0.001021802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001607996,"about_ca_topic_score_gemma":0.0009747935,"domain_scores_codex":[0.9992821,0.0002091288,0.00003046068,0.00006951034,0.0002853076,0.000123547],"domain_scores_gemma":[0.9938912,0.004635553,0.0005980381,0.0003201574,0.000437784,0.0001171637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001035915,0.00003092614,0.0003248472,0.0001093363,0.0000167292,0.0002521788,0.0001456952,0.5241454,0.004770466,0.4577755,0.0005962164,0.01172909],"study_design_scores_gemma":[0.000008337397,0.00003443048,0.00007616032,0.0000204256,0.000004933737,0.00008170982,0.00001850653,0.9276401,0.001659133,0.07009624,0.000348802,0.00001125361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05700666,0.001096494,0.9355484,0.0004298362,0.00003414665,0.00003471946,0.0001125889,0.0001069512,0.005630194],"genre_scores_gemma":[0.9357229,0.001808936,0.05859662,0.0001194257,0.00008096422,0.0001257276,0.0001118501,0.00003701361,0.003396641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001902782,"threshold_uncertainty_score":0.01006305,"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."}}