{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005944961,0.0001215391,0.0001335959,0.0001220134,0.0004836708,0.0000706572,0.00188131,0.00001688623,0.00003556284],"category_scores_gemma":[0.00002947277,0.00009210049,0.0001466414,0.000776655,0.00006751154,0.0002148496,0.001317779,0.000202801,0.000004464694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005490688,"about_ca_system_score_gemma":0.00002814297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001022459,"about_ca_topic_score_gemma":3.609443e-7,"domain_scores_codex":[0.9987021,0.0000159586,0.0002175259,0.0002844289,0.0005093694,0.0002706297],"domain_scores_gemma":[0.9994476,0.00003834218,0.0001917945,0.0001943053,0.0000737476,0.00005418284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002117544,0.0002207609,0.005227593,0.00004276768,0.00005440279,0.000003305269,0.002374673,0.00020806,0.03207872,0.9485599,0.002042023,0.009166637],"study_design_scores_gemma":[0.002007439,0.0009008658,0.008921229,0.0001268968,0.00007157544,0.0003488762,0.002585631,0.01034511,0.4137633,0.5397478,0.02024053,0.0009406414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9679524,0.0003856364,0.007420305,0.003781439,0.001889323,0.0008882583,0.00001351071,0.0002973557,0.01737181],"genre_scores_gemma":[0.9956981,0.000006675594,0.003456522,0.0003303634,0.00002473238,0.0000735543,2.552649e-7,0.000008054468,0.0004017762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.408812,"threshold_uncertainty_score":0.3755749,"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."}}