{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001375601,0.001400229,0.001996565,0.003453891,0.001403356,0.00216501,0.003152797,0.001642021,0.004160638],"category_scores_gemma":[0.009554587,0.0009308317,0.001844117,0.005455643,0.0008949503,0.00408294,0.002912169,0.001492771,0.001728205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001789962,"about_ca_system_score_gemma":0.004011743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01257146,"about_ca_topic_score_gemma":0.02833061,"domain_scores_codex":[0.9978547,0.0004253342,0.000115266,0.0006622122,0.0006828394,0.0002597783],"domain_scores_gemma":[0.9950715,0.002025287,0.0004126014,0.001521152,0.0007102287,0.0002592848],"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.0004803299,0.0004968563,0.009645627,0.000995839,0.0002810528,0.0005265068,0.000730668,0.2364911,0.01019309,0.04832758,0.07449201,0.6173393],"study_design_scores_gemma":[0.00008589556,0.00005413729,0.001039221,0.00003471266,0.00005596547,0.0003423126,0.0002818511,0.9229982,0.003712428,0.06293352,0.008440258,0.00002142733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05953621,0.001437167,0.9180943,0.001517679,0.0001541676,0.00050293,0.004623936,0.00794359,0.006189918],"genre_scores_gemma":[0.2255506,0.0005479592,0.7540396,0.0004047903,0.00009434208,0.0003013645,0.01329616,0.0005298563,0.0052354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01257146,"threshold_uncertainty_score":0.02499658,"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."}}