{"id":"W4231388260","doi":"10.22215/etd/2011-07043","title":"A method of lowering the complexity of the sum-product algorithm using graph transformations","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; Graph; Combinatorics; Product (mathematics); Mathematics; Algorithm","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.0009960458,0.001640016,0.001050969,0.001967884,0.001287393,0.002071778,0.00242807,0.0009175277,0.01005366],"category_scores_gemma":[0.006541452,0.0006185032,0.001614432,0.00202408,0.001999728,0.003654961,0.002565156,0.003282113,0.004516929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009707115,"about_ca_system_score_gemma":0.002385538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034724,"about_ca_topic_score_gemma":0.003154279,"domain_scores_codex":[0.9978372,0.000462568,0.0001297276,0.0004035917,0.0009663785,0.0002004369],"domain_scores_gemma":[0.9955174,0.001661837,0.0001721256,0.001873433,0.0006492907,0.0001259865],"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.0004145933,0.0003176621,0.0006894949,0.0003428466,0.0001356602,0.0001982105,0.0002665912,0.04394858,0.03311199,0.2094715,0.01869752,0.6924053],"study_design_scores_gemma":[0.0001920279,0.0003838332,0.0005667778,0.00006782333,0.0001807005,0.0008532501,0.0001389071,0.5564697,0.0718661,0.3331485,0.03603084,0.0001015002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00581583,0.0001377003,0.9848897,0.0001849414,0.0001556589,0.00006526045,0.00005251782,0.002673971,0.006024432],"genre_scores_gemma":[0.09776118,0.0002793983,0.888605,0.000214302,0.0001824036,0.0001847274,0.0002833984,0.001622451,0.01086709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01005366,"threshold_uncertainty_score":0.03363287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08456664445495168,"score_gpt":0.3380923853873098,"score_spread":0.2535257409323581,"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."}}