{"id":"W4253860495","doi":"10.1109/isit.1993.748587","title":"Bidirectional Sequential Decoding","year":2005,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Computer science; Block (permutation group theory); Tree (set theory); Computational complexity theory; Stack (abstract data type); Algorithm; Code (set theory); Parallel computing; Exponent; Theoretical computer science; Mathematics; Set (abstract data type)","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.000650735,0.0008266502,0.0006416811,0.0008090009,0.0005403141,0.000977709,0.0007925652,0.0005832135,0.004037403],"category_scores_gemma":[0.002490642,0.000256844,0.0004370348,0.0009975448,0.0005072979,0.001276159,0.001307227,0.000619482,0.002168174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00043529,"about_ca_system_score_gemma":0.001394791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001465792,"about_ca_topic_score_gemma":0.00302583,"domain_scores_codex":[0.9992037,0.0001637609,0.00005458406,0.0001020822,0.0003818409,0.00009398947],"domain_scores_gemma":[0.9987765,0.0003965677,0.00009547493,0.0003645506,0.0003264662,0.00004041949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000457443,0.0001251713,0.001304872,0.0002909793,0.00008437067,0.0002056316,0.0001695945,0.0927301,0.0489937,0.1448243,0.005281192,0.7055326],"study_design_scores_gemma":[0.00006209805,0.0002190728,0.0003521259,0.00006725025,0.00006071894,0.001067314,0.00007059888,0.8171219,0.07505312,0.06835726,0.03751661,0.00005190184],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01138274,0.0005091829,0.9788768,0.00009837711,0.00006929276,0.00005694434,0.0001084384,0.0006002148,0.008298041],"genre_scores_gemma":[0.272393,0.001110325,0.7137264,0.000210641,0.0000996444,0.0001646796,0.0004887753,0.0002929757,0.01151343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004037403,"threshold_uncertainty_score":0.01350647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02329015020521972,"score_gpt":0.2698416952788272,"score_spread":0.2465515450736075,"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."}}