{"id":"W2806758424","doi":"10.1109/tit.2019.2895356","title":"On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Mathematics; Adjacency matrix; Multiplicity (mathematics); Low-density parity-check code; Discrete mathematics; Tanner graph; Degree (music); Graph; Algorithm; Decoding methods; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.0011264,0.0008127689,0.000769069,0.00422265,0.0007559666,0.001110095,0.0009493727,0.0008632499,0.001241073],"category_scores_gemma":[0.01669113,0.0004371827,0.0004499736,0.002638787,0.001846545,0.002974957,0.001237098,0.0007159451,0.000303825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008642927,"about_ca_system_score_gemma":0.0007748381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002965255,"about_ca_topic_score_gemma":0.003664584,"domain_scores_codex":[0.9991835,0.0002380219,0.00004498049,0.0002139317,0.0002099795,0.0001094851],"domain_scores_gemma":[0.9907611,0.006529317,0.00102294,0.0008560191,0.0004705329,0.0003601176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008829296,0.0002423665,0.03136526,0.0001831855,0.0001499331,0.0004233124,0.0005047616,0.6199418,0.01872977,0.1648566,0.002982203,0.159738],"study_design_scores_gemma":[0.00001747347,0.00004375656,0.002061277,0.0000161333,0.000009422344,0.0001533341,0.0000410618,0.899226,0.002966929,0.09498166,0.0004598145,0.0000231401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5252756,0.0004043278,0.4691086,0.0003437226,0.00004336845,0.00006339145,0.0004531024,0.0007570852,0.00355075],"genre_scores_gemma":[0.8763927,0.0003180591,0.1208826,0.00006762477,0.00006417679,0.00008733413,0.0006421171,0.0001140653,0.001431521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00422265,"threshold_uncertainty_score":0.006270945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02405202218869541,"score_gpt":0.2548872477094054,"score_spread":0.23083522552071,"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."}}