{"id":"W2897123632","doi":"10.5555/3310435.3310596","title":"Short cycles via low-diameter decompositions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Graph; Running time; Undirected graph; Time complexity; Disjoint sets; Discrete mathematics; Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336866,0.001257972,0.0009892079,0.001737611,0.0008064919,0.001648377,0.001644373,0.0008489419,0.007611313],"category_scores_gemma":[0.006526329,0.0008825483,0.001077391,0.00163651,0.000980905,0.004150952,0.003387822,0.001971271,0.002637351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009197163,"about_ca_system_score_gemma":0.000692063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00120257,"about_ca_topic_score_gemma":0.001771127,"domain_scores_codex":[0.9986995,0.0002637541,0.00008898097,0.0003305603,0.000432556,0.0001845993],"domain_scores_gemma":[0.9961462,0.001330872,0.0003443467,0.001406883,0.0004674476,0.0003043185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008710199,0.0002629542,0.002144306,0.0005494635,0.0001236592,0.0003220981,0.0008697017,0.1913763,0.04005616,0.2585558,0.02043753,0.484431],"study_design_scores_gemma":[0.0001071382,0.0001737874,0.0004225445,0.00010215,0.0000490136,0.0003189929,0.0001781399,0.5795663,0.01821882,0.3803138,0.02049882,0.00005050353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03694797,0.000393255,0.9537771,0.0003276457,0.00006450414,0.0001692355,0.0004431405,0.001871769,0.006005443],"genre_scores_gemma":[0.3029931,0.0006058382,0.6826014,0.0003095976,0.0001083635,0.0004496373,0.002062266,0.000999502,0.009870203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007611313,"threshold_uncertainty_score":0.02546233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01086081664411602,"score_gpt":0.2537178479733224,"score_spread":0.2428570313292064,"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."}}