{"id":"W4410544001","doi":"10.14778/3717755.3717771","title":"In-Depth Analysis of Densest Subgraph Discovery in a Unified Framework","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computational biology; Biology","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.007226887,0.001342795,0.00306035,0.006011517,0.001423285,0.004436203,0.003534453,0.002035204,0.002405672],"category_scores_gemma":[0.03022389,0.000913986,0.001968039,0.006335585,0.002042448,0.01105283,0.004302676,0.002470787,0.0005767994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003015501,"about_ca_system_score_gemma":0.003764529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005197784,"about_ca_topic_score_gemma":0.009713241,"domain_scores_codex":[0.9928308,0.002319116,0.000356021,0.00166863,0.00224763,0.0005777375],"domain_scores_gemma":[0.9802712,0.01187954,0.001321999,0.004372482,0.001559424,0.0005952858],"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.0004832589,0.000630989,0.01722798,0.001474205,0.0006034713,0.0003646511,0.0009681188,0.4613896,0.01248876,0.2302093,0.01282022,0.2613394],"study_design_scores_gemma":[0.00002196186,0.00006602425,0.001219055,0.00004671063,0.00009273674,0.0002540743,0.0001550098,0.900622,0.002889221,0.08992828,0.00468555,0.00001933171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04943084,0.005306741,0.9395286,0.001076314,0.00007672143,0.000122501,0.0007359977,0.001147903,0.002574356],"genre_scores_gemma":[0.374308,0.003481547,0.6164224,0.0004104732,0.0002659323,0.0001261937,0.002962198,0.0004179034,0.00160535],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007226887,"threshold_uncertainty_score":0.03821987,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00938181969614827,"score_gpt":0.2451218865393913,"score_spread":0.235740066843243,"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."}}