{"id":"W2949438557","doi":"10.48550/arxiv.0801.3511","title":"Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Erasure; Parity (physics); Erasure code; Binary number; Low-density parity-check code; Binary erasure channel; Computer science; Mathematics; Arithmetic; Statistics; Algorithm; Physics; Decoding methods; Coding (social sciences); Programming language; Channel capacity; Atomic physics","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.001017535,0.0005404368,0.0009002987,0.000270101,0.0002334019,0.00007941125,0.002397266,0.0005840398,0.000002900901],"category_scores_gemma":[0.0007187244,0.0005725719,0.0003368193,0.0002848316,0.0001961767,0.0001972193,0.001994395,0.0008103034,0.00002087817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001319359,"about_ca_system_score_gemma":0.0004533813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001080041,"about_ca_topic_score_gemma":0.00001076345,"domain_scores_codex":[0.996809,0.0002934653,0.0007160674,0.001205449,0.0004136831,0.0005623316],"domain_scores_gemma":[0.9958545,0.0007856815,0.0006966865,0.001971147,0.000548922,0.0001430627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001317765,0.005686549,0.6659369,0.01565532,0.001883056,0.002583225,0.03020453,0.04412536,0.1364762,0.003695988,0.05507452,0.03736052],"study_design_scores_gemma":[0.001387538,0.002255926,0.09449598,0.003797111,0.0002781605,0.0003498339,0.00007741349,0.4665495,0.3973046,0.02905039,0.0005208189,0.003932673],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4057984,0.0001409305,0.590966,0.0001342614,0.001251846,0.0009305415,0.00001358318,0.0007070557,0.00005737113],"genre_scores_gemma":[0.8723475,0.0001490339,0.1267232,0.0001511149,0.0001858406,0.000224378,0.00001474594,0.00005310286,0.0001510184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5714409,"threshold_uncertainty_score":0.9996726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09757864263697298,"score_gpt":0.3057547996144752,"score_spread":0.2081761569775022,"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."}}