{"id":"W2970828623","doi":"10.14778/3342263.3342645","title":"Efficient algorithms for densest subgraph discovery","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Induced subgraph isomorphism problem; Intuition; Computer science; Subgraph isomorphism problem; Graph; Algorithm; Color-coding; Efficient algorithm; Theoretical computer science; Artificial intelligence; Line graph","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.002762877,0.002450887,0.002683559,0.005454037,0.001825824,0.002922295,0.004275587,0.002704507,0.006323712],"category_scores_gemma":[0.015302,0.001469997,0.002781273,0.007930484,0.001277073,0.006116601,0.004554974,0.002406863,0.003039423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002329322,"about_ca_system_score_gemma":0.004490763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006597212,"about_ca_topic_score_gemma":0.01349676,"domain_scores_codex":[0.9961489,0.0007727728,0.0002957236,0.001166436,0.001172072,0.0004441442],"domain_scores_gemma":[0.990545,0.004801808,0.0007362175,0.002406641,0.001161817,0.000348474],"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.0003835076,0.0006338007,0.004093499,0.0009383431,0.0002894562,0.0002669595,0.0005675493,0.2048263,0.006386471,0.04434923,0.03735498,0.6999099],"study_design_scores_gemma":[0.0001494718,0.00008014928,0.0006908114,0.00004501609,0.00007703641,0.0003581885,0.0001911556,0.870224,0.002918431,0.1166183,0.008617361,0.00003011276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01313038,0.0009566081,0.9772779,0.0006265506,0.00007726126,0.0003665573,0.001011948,0.003949999,0.002602762],"genre_scores_gemma":[0.07665639,0.0005479236,0.914748,0.0002441538,0.00008888763,0.000437499,0.004659056,0.0004448317,0.002173252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006597212,"threshold_uncertainty_score":0.02115494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01307049411882908,"score_gpt":0.2375503892464292,"score_spread":0.2244798951276001,"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."}}