{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130499,0.0002569611,0.0002994336,0.0002616605,0.0002808789,0.0001036417,0.001723294,0.0001618432,0.00001359732],"category_scores_gemma":[0.00005145694,0.0001535759,0.0003001226,0.001031944,0.0002103969,0.0003616453,0.00006650815,0.001172511,0.000007756971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001122443,"about_ca_system_score_gemma":0.0001493162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001431695,"about_ca_topic_score_gemma":0.00003297154,"domain_scores_codex":[0.997664,0.0005683475,0.0008526985,0.000215346,0.0004878881,0.0002116558],"domain_scores_gemma":[0.997267,0.0008525044,0.0005881697,0.001143411,0.00011982,0.00002910071],"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.0002943844,0.0003504656,0.000705877,0.0006026453,0.0003324198,0.000001661071,0.06131623,0.6735161,0.00184165,0.2129423,0.0002179517,0.04787832],"study_design_scores_gemma":[0.0002585489,0.00006354952,0.002023665,0.001176438,0.00009187892,0.00002846793,0.0009684356,0.6826234,0.1933078,0.1189655,0.00004036418,0.0004519587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1506926,0.00001187356,0.8455031,0.0005146499,0.001186642,0.0006679281,0.00002449172,0.0003018892,0.001096809],"genre_scores_gemma":[0.9964282,0.00001598593,0.003265163,0.0002239719,0.00001690344,0.00002790047,0.000001586653,0.00001399673,0.000006283487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8457355,"threshold_uncertainty_score":0.6262644,"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."}}