{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002558508,0.0001201804,0.0001464833,0.00005796587,0.0001106982,0.0001638606,0.001266123,0.00002853155,0.000002470348],"category_scores_gemma":[0.00002714729,0.00008098593,0.0001265006,0.0003459824,0.00004304125,0.0001957762,0.0004372188,0.00006559136,0.00001470716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003672066,"about_ca_system_score_gemma":0.00002880273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002165705,"about_ca_topic_score_gemma":4.30241e-7,"domain_scores_codex":[0.9988986,0.00000206414,0.0002182576,0.0003518796,0.0002872511,0.0002418988],"domain_scores_gemma":[0.9992806,0.00005470656,0.0001805778,0.0003013,0.0001376661,0.00004518603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002552519,0.0007830472,0.004875159,0.0002989809,0.0001269396,2.279367e-7,0.00154999,0.000533874,0.0851652,0.8348223,0.01042683,0.06139191],"study_design_scores_gemma":[0.002906623,0.0006408296,0.01424708,0.0003904539,0.0001027835,0.00004434141,0.0007752433,0.5267554,0.3926595,0.01994577,0.04054733,0.0009846651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8442253,0.0002037985,0.1422397,0.004165852,0.001301415,0.002864289,0.0001296975,0.000196548,0.004673449],"genre_scores_gemma":[0.8976334,0.00001020788,0.1006229,0.0001706586,0.00006740246,0.0002434801,0.000002723724,0.00001392484,0.001235227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8148766,"threshold_uncertainty_score":0.3302511,"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."}}