{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002883948,0.0004355467,0.0004160237,0.0003405928,0.000309484,0.0003863119,0.001726511,0.0001507332,0.000138341],"category_scores_gemma":[0.000007127146,0.0004013398,0.0003651541,0.0006933651,0.000136546,0.000804148,0.0005173578,0.0004042529,0.001290146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000889564,"about_ca_system_score_gemma":0.00004686716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003379375,"about_ca_topic_score_gemma":0.0000056227,"domain_scores_codex":[0.9969233,0.0001304613,0.0004646634,0.001053768,0.0006847592,0.0007430689],"domain_scores_gemma":[0.9976774,0.0002152749,0.00009230297,0.001626229,0.0001000561,0.0002887703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000187574,0.002920263,0.007832928,0.0003666968,0.001075987,0.0004860713,0.003752387,0.008641928,0.09931277,0.347217,0.008313064,0.5198933],"study_design_scores_gemma":[0.002390606,0.001970044,0.02482442,0.0004884729,0.00009128029,0.0003234076,0.0001309589,0.8389057,0.05718585,0.05445515,0.01561108,0.003623054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06060642,0.0001910207,0.89524,0.004101301,0.004064037,0.00110824,0.00008783695,0.00110205,0.03349911],"genre_scores_gemma":[0.8753535,0.0000722703,0.1213349,0.001524153,0.0003993798,0.0001008568,0.00006472339,0.00006753979,0.00108267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8302637,"threshold_uncertainty_score":0.9998438,"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."}}