{"id":"W3175911760","doi":"10.1145/3471485.3471494","title":"Efficient Directed Densest Subgraph Discovery","year":2021,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scalability; Computer science; Induced subgraph isomorphism problem; Graph; Enhanced Data Rates for GSM Evolution; Subgraph isomorphism problem; Core (optical fiber); Theoretical computer science; Graph factorization; Efficient algorithm; Algorithm; Database; Line graph; Artificial intelligence; Voltage 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.0001758454,0.0001466678,0.0002197973,0.0001226826,0.0001467265,0.0003640802,0.001149811,0.00005461016,0.000038382],"category_scores_gemma":[0.0005191823,0.00013124,0.0001589,0.001206829,0.00003540522,0.0002234225,0.00073046,0.0001334733,0.0001084985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002561049,"about_ca_system_score_gemma":0.0001136363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001191358,"about_ca_topic_score_gemma":0.0001106402,"domain_scores_codex":[0.9984875,0.0001086044,0.0002229092,0.0005995219,0.0002689773,0.0003124565],"domain_scores_gemma":[0.9977142,0.0002753584,0.00007725981,0.001725303,0.0001067135,0.0001012272],"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.00003948522,0.001452374,0.07758372,0.00008720342,0.0007166844,0.00192483,0.001745432,0.002284517,0.04191833,0.01566171,0.05203327,0.8045524],"study_design_scores_gemma":[0.002883314,0.0004768397,0.117064,0.0004930478,0.0004493639,0.000446266,0.0006607891,0.6805172,0.07476685,0.0108492,0.1075649,0.003828296],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8245572,0.0003672863,0.1709798,0.001495496,0.0008556404,0.00004746652,0.00001591475,0.0004061931,0.001275025],"genre_scores_gemma":[0.9413182,0.00005130765,0.05558308,0.0002993603,0.0001130211,0.000008879505,0.00003397296,0.00001266791,0.002579524],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8007241,"threshold_uncertainty_score":0.5351813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560761602411701,"score_gpt":0.2370158954038687,"score_spread":0.2214082793797517,"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."}}