{"id":"W2981971274","doi":"10.1109/iswcs.2019.8877353","title":"Optimization of Protograph LDPC Codes based on High-Level Energy Models","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Energy consumption; Computer science; Decoding methods; Energy (signal processing); Optimization problem; Low-density parity-check code; Soft-decision decoder; Mathematical optimization; Algorithm; Mathematics; Engineering","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004320224,0.000364689,0.0004848557,0.0006328112,0.00004287246,0.0001184539,0.001964732,0.0003874994,0.00002073988],"category_scores_gemma":[0.00004327163,0.0003370032,0.0001976831,0.000399461,0.00004467804,0.0002155937,0.001093683,0.000358221,0.000002550332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007879345,"about_ca_system_score_gemma":0.0003037379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001313502,"about_ca_topic_score_gemma":0.00003667459,"domain_scores_codex":[0.9975917,0.0001650585,0.0004827729,0.0009038982,0.000594119,0.0002624302],"domain_scores_gemma":[0.9968001,0.0001778897,0.0004851747,0.002069476,0.0004051535,0.00006221107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001179453,0.0001054856,0.00004885728,0.00009609473,0.00001450166,9.681381e-7,0.00005232588,0.9453286,0.00006240609,0.05088419,0.0004698392,0.002924946],"study_design_scores_gemma":[0.0001427726,0.000159302,0.00002859451,0.0003222658,0.000008777769,7.002831e-7,0.000002364105,0.9555014,0.02299925,0.02047215,0.00002004283,0.0003423334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001609209,0.00001321771,0.9855899,0.0001972456,0.0005470156,0.001039707,0.00001769687,0.001193637,0.01124064],"genre_scores_gemma":[0.4647405,0.00001044125,0.534488,0.0002077201,0.00001774367,0.0002400018,0.00002507967,0.00002368809,0.0002468344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4645796,"threshold_uncertainty_score":0.9999082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04163851049418526,"score_gpt":0.259853654459908,"score_spread":0.2182151439657228,"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."}}