{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027621,0.0002230294,0.0002659393,0.0002018458,0.0004267953,0.0001104446,0.001320863,0.0001454619,0.000002337864],"category_scores_gemma":[0.00007045042,0.0001071439,0.0002545688,0.0006161898,0.0005347941,0.000334803,0.0000699942,0.001012625,0.000001779413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008231604,"about_ca_system_score_gemma":0.00008177735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003636658,"about_ca_topic_score_gemma":0.00009277721,"domain_scores_codex":[0.9977734,0.000764644,0.0006855958,0.0001843063,0.0004042286,0.0001877931],"domain_scores_gemma":[0.9960973,0.001728313,0.0008408299,0.001203578,0.0001126959,0.00001725211],"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.0003886824,0.0001448151,0.0004370157,0.0002665384,0.0001483032,1.588898e-7,0.0281526,0.6608447,0.000202485,0.2646937,0.0000343656,0.04468662],"study_design_scores_gemma":[0.000776328,0.00006540166,0.005447867,0.0008047782,0.00007579127,0.00001441067,0.001105945,0.7872905,0.05075773,0.1533813,0.00001088211,0.0002690271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2481802,0.00002329992,0.7496051,0.000440103,0.0006492604,0.0008568629,0.00003961538,0.000069184,0.0001364011],"genre_scores_gemma":[0.9991582,0.00003944387,0.0005829141,0.0001696498,0.000008183786,0.00002994716,0.000002309173,0.000007156782,0.000002167255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.750978,"threshold_uncertainty_score":0.439941,"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."}}