{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000868773,0.0002038989,0.000319377,0.0001766214,0.0001987028,0.00002995635,0.001946041,0.00009615681,0.00001339368],"category_scores_gemma":[0.00004351802,0.0001220559,0.0002806573,0.0008278857,0.0001369023,0.0002461716,0.0001074595,0.0003457996,5.092308e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002426344,"about_ca_system_score_gemma":0.0001511023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002514014,"about_ca_topic_score_gemma":0.0009720165,"domain_scores_codex":[0.9984599,0.0001752744,0.0005350949,0.0002824325,0.0003691062,0.0001782142],"domain_scores_gemma":[0.9979087,0.0001047547,0.0005347917,0.001089945,0.0003401618,0.00002166754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003117074,0.0004102289,0.0001900692,0.001188967,0.0004151622,0.000001837723,0.07250542,0.0002610605,0.04991521,0.1862984,0.0004271459,0.6883554],"study_design_scores_gemma":[0.00009999086,0.00005030438,0.002100387,0.0004075826,0.0001158364,0.00003519065,0.0008227928,0.051128,0.8854084,0.05939193,0.00008793757,0.000351651],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005196646,0.00009869184,0.9864359,0.00006392843,0.0007232064,0.0005055503,0.000008604125,0.000168344,0.006799107],"genre_scores_gemma":[0.1131378,0.00001659387,0.8864838,0.000023731,0.00002275372,0.00001798502,0.000008691089,0.0000199449,0.0002687286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8354932,"threshold_uncertainty_score":0.4977294,"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."}}