{"id":"W2102278828","doi":"10.1109/isit.2006.261980","title":"On Optimal Index Assignment for MAP Decoding of Markov Sequences","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Computer science; Maximum a posteriori estimation; Markov chain; Assignment problem; Algorithm; Markov process; Mathematical optimization; Quadratic assignment problem; Index (typography); Metric (unit); Gaussian; Optimization problem; Mathematics; Statistics; Machine learning","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.0001708373,0.00009571968,0.00012348,0.00008666338,0.00005519525,0.00003893005,0.0006834672,0.00003762698,0.00003082706],"category_scores_gemma":[0.00001937348,0.00007556457,0.00004266795,0.00009652026,0.00003189173,0.0003595607,0.0002152706,0.00004753892,0.000003593905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003767981,"about_ca_system_score_gemma":0.00002363697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002581881,"about_ca_topic_score_gemma":0.000002742232,"domain_scores_codex":[0.9990862,0.00001935933,0.0002212771,0.0002758569,0.0002218708,0.0001754545],"domain_scores_gemma":[0.9991922,0.0002134742,0.0001106451,0.0004076808,0.00004553801,0.00003046429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003620239,0.0001680913,0.0004235218,0.00003873697,0.000009127383,0.000006774848,0.0000253115,0.004669177,0.01691627,0.8397326,0.05067312,0.08730103],"study_design_scores_gemma":[0.0004073305,0.000345031,0.0003813884,0.00009559721,0.000002764504,0.000004161128,0.000014058,0.1959873,0.6363888,0.1573792,0.008705249,0.0002890686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001401243,0.0000211053,0.9948716,0.0002410204,0.00009197651,0.0002143726,0.000008394896,0.000202206,0.002948065],"genre_scores_gemma":[0.3890908,0.000001470709,0.6104023,0.00008439501,0.00001608214,0.00003481529,0.000003298429,0.000003818922,0.0003629353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6823534,"threshold_uncertainty_score":0.3081434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01432894987952845,"score_gpt":0.2827932319919237,"score_spread":0.2684642821123953,"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."}}