{"id":"W2923426534","doi":"10.1109/tit.2020.3011556","title":"On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"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; Discrete mathematics; Lambda; Low-density parity-check code; Dense graph; Multiplicity (mathematics); Triangle-free graph; Graph; 1-planar graph; Line 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.001206011,0.001156888,0.0009269075,0.004563325,0.0008415442,0.001679135,0.001634403,0.001302736,0.00349114],"category_scores_gemma":[0.01468368,0.000572974,0.0007671874,0.002918957,0.00205815,0.004758882,0.001628559,0.001101573,0.001154264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009929021,"about_ca_system_score_gemma":0.001076397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003325458,"about_ca_topic_score_gemma":0.00465325,"domain_scores_codex":[0.9989667,0.000272405,0.00006403478,0.0002775238,0.000291505,0.0001278058],"domain_scores_gemma":[0.9917303,0.005522905,0.0008867935,0.0008015386,0.000601527,0.0004569548],"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.001115595,0.0004816794,0.02350141,0.0004484463,0.0002154824,0.0004363675,0.0006193158,0.4367298,0.02480958,0.2636706,0.008874979,0.2390968],"study_design_scores_gemma":[0.00002889165,0.00005742433,0.001313728,0.00002863899,0.00001139377,0.0001168745,0.00006247719,0.8330448,0.003847781,0.1606011,0.000852722,0.00003410105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2976628,0.0004408321,0.6920065,0.0004921624,0.00007578713,0.0001057886,0.0009583696,0.001629756,0.006628048],"genre_scores_gemma":[0.6807912,0.0004801448,0.3119901,0.000216388,0.0001357893,0.0002383568,0.002266364,0.000319034,0.003562654],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004563325,"threshold_uncertainty_score":0.01167899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02174218594961368,"score_gpt":0.2936117421233498,"score_spread":0.2718695561737361,"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."}}