{"id":"W2913738884","doi":"10.1109/istc.2018.8625355","title":"On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Tanner graph; Low-density parity-check code; Adjacency matrix; Mathematics; Combinatorics; Discrete mathematics; Graph; Algorithm; Decoding methods; Error floor","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.0006012759,0.0001195764,0.0001354822,0.0001142342,0.0002022814,0.00008392127,0.0009109123,0.00004370487,0.00001787579],"category_scores_gemma":[0.00005729295,0.0000782172,0.00006355188,0.0004454411,0.0001767294,0.0001980134,0.0002401173,0.0001221604,0.000007213232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002916287,"about_ca_system_score_gemma":0.0000309495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003221484,"about_ca_topic_score_gemma":0.0001715127,"domain_scores_codex":[0.9989266,0.00005543907,0.0002095085,0.0002734731,0.0002958701,0.0002390753],"domain_scores_gemma":[0.9989287,0.0001940314,0.00008503929,0.00066352,0.0001024265,0.00002632987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002774668,0.0002107929,0.01921866,0.00002826035,0.00008322623,0.00001080596,0.003056619,0.0006801798,0.1180425,0.8369461,0.007264398,0.01443074],"study_design_scores_gemma":[0.00007559648,0.0003133939,0.004504226,0.0001371785,0.00001390576,0.00004049777,0.0002149063,0.1763268,0.7325541,0.0852453,0.0002374614,0.0003366476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4302529,0.00001106631,0.5598973,0.0003813001,0.0002527897,0.0000888572,3.93541e-7,0.0003544117,0.008760999],"genre_scores_gemma":[0.9424461,0.000001690024,0.05699684,0.0003746974,0.0001087415,0.000002211143,1.243525e-7,0.00001008415,0.00005949877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7517008,"threshold_uncertainty_score":0.3189605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03132140871814146,"score_gpt":0.2989684878826149,"score_spread":0.2676470791644735,"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."}}