{"id":"W4313172799","doi":"10.14778/3551793.3551826","title":"Finding locally densest subgraphs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Graph; Graph factorization; Computer science; Combinatorics; Regular polygon; Pruning; Theoretical computer science; Mathematics; Graph power; Biology; 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.0008482772,0.00125586,0.001826702,0.003344016,0.001043907,0.001588676,0.001780596,0.001390132,0.004050439],"category_scores_gemma":[0.006509202,0.0008901958,0.001455689,0.002899232,0.0009628981,0.00255263,0.001946406,0.001070848,0.001211769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009669574,"about_ca_system_score_gemma":0.002051838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007617219,"about_ca_topic_score_gemma":0.01600523,"domain_scores_codex":[0.9988797,0.0002051044,0.00006108952,0.0004404192,0.0002768045,0.0001368547],"domain_scores_gemma":[0.9969288,0.001488398,0.0003665894,0.0006039793,0.0004123631,0.000199906],"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.0005797053,0.0003840589,0.01795869,0.00120777,0.0003768906,0.000906969,0.001007049,0.2402791,0.02420101,0.04622092,0.04313764,0.6237403],"study_design_scores_gemma":[0.00008365513,0.0001158931,0.003048462,0.00009001938,0.0001187283,0.0006564417,0.0005305088,0.8785716,0.007276698,0.09777113,0.01170479,0.00003194502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1091981,0.001268806,0.8775687,0.0008722232,0.00006646331,0.0003762359,0.002830718,0.003295156,0.004523651],"genre_scores_gemma":[0.3485104,0.0005967922,0.6324998,0.0003551975,0.0001026778,0.0003120846,0.01110803,0.0007493508,0.005765663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007617219,"threshold_uncertainty_score":0.01514572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009705402500551377,"score_gpt":0.200467016258106,"score_spread":0.1907616137575547,"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."}}