{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9840ca48d5b0","filters":{"venue":"IPNPR"}},"results":[{"id":"W35544945","doi":"10.1139/apnm-2021-0770","title":"Performance and Decoder Complexity Estimates for Families of Low-Density Parity-Check Codes","year":2007,"lang":"en","type":"article","venue":"IPNPR","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Heart and Stroke Foundation of Canada","keywords":"Low-density parity-check code; Algorithm; Soft-decision decoder; Decoding methods; Code rate; Decibel; Computer science; Computational complexity theory; Code (set theory); Statistics; Mathematics; Arithmetic; Theoretical computer science; Telecommunications","authors":[{"name":"S. Dolinar","is_ca":false},{"name":"K. Andrews","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0356302717071306,"gpt":0.2992724871150417,"spread":0.2636422154079111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561298,0.000130327,0.0002293826,0.00008723911,0.0001425149,0.00003922572,0.0003974798,0.00006661902,0.000001372986],"category_scores_gemma":[0.0001599227,0.0001251979,0.00004322859,0.0001581605,0.0001913428,0.0002663268,0.0002280724,0.00009972106,0.000002019342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002479316,"about_ca_system_score_gemma":0.00002642805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001142261,"about_ca_topic_score_gemma":0.000270349,"domain_scores_codex":[0.9990406,0.00001537163,0.0002444873,0.000279068,0.0001547031,0.0002657791],"domain_scores_gemma":[0.9989033,0.0003826352,0.0001162973,0.0003702781,0.0001690583,0.00005845937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000141845,0.0003016823,0.7888538,0.0009800422,0.00006390658,0.00000986655,0.004586807,0.00005490171,0.02085515,0.03351806,0.002131195,0.1485028],"study_design_scores_gemma":[0.0003414331,0.0002475652,0.46003,0.0001409638,0.00001472138,0.0000298768,0.00010833,0.1687564,0.3548608,0.0148567,0.0002722809,0.0003409136],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.618239,0.00005135814,0.3806316,0.00005770268,0.00009839064,0.0001435393,0.00000244581,0.0002327602,0.0005431179],"genre_scores_gemma":[0.7106131,0.00001298464,0.2892609,0.00006409459,0.00001505949,0.000005210257,0.000001317703,0.000006198034,0.00002114703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3340057,"threshold_uncertainty_score":0.5105422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}