{"id":"W2041388961","doi":"10.1016/j.laa.2013.05.016","title":"Solving sparse linear systems of equations over finite fields using bit-flipping algorithm","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Algorithm; Coefficient matrix; Finite field; Decoding methods; System of linear equations; Bounded function; Linear system; Matrix (chemical analysis); Discrete mathematics; Linear equation; Parity-check matrix; Sparse matrix; Combinatorics; Low-density parity-check code; Mathematical analysis","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.0007088627,0.0006869985,0.0007416041,0.00054669,0.0005238688,0.0007558179,0.0007571187,0.0008030778,0.005007787],"category_scores_gemma":[0.005089368,0.0003723399,0.0004932423,0.001077965,0.0008048644,0.001471552,0.001384321,0.001560185,0.0008810734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003051982,"about_ca_system_score_gemma":0.001125269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00147735,"about_ca_topic_score_gemma":0.00264213,"domain_scores_codex":[0.9993752,0.0002213049,0.00004071574,0.00007407922,0.0002229007,0.00006586901],"domain_scores_gemma":[0.998214,0.001038348,0.0001275391,0.0002999656,0.0002769296,0.00004324767],"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.0003477893,0.0001660859,0.001491292,0.000546583,0.0001357059,0.0004010221,0.0003899004,0.2948954,0.01834971,0.2622114,0.01050369,0.4105614],"study_design_scores_gemma":[0.00009038136,0.00006583428,0.0001680362,0.0000401335,0.0000289462,0.000129856,0.00006096445,0.8581835,0.01251576,0.125157,0.003532008,0.00002758467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02893374,0.0001660126,0.9656116,0.0003787223,0.00009813659,0.00005581542,0.00009582413,0.0005809587,0.004079264],"genre_scores_gemma":[0.3550684,0.00036579,0.6376466,0.0002343522,0.0001063204,0.0001608283,0.0002902683,0.000143232,0.005984322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005007787,"threshold_uncertainty_score":0.01675266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03267507473192976,"score_gpt":0.2803232690555417,"score_spread":0.2476481943236119,"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."}}