{"id":"W3212747350","doi":"10.1145/3483940","title":"On Directed Densest Subgraph Discovery","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"University of Hong Kong; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Induced subgraph isomorphism problem; Enhanced Data Rates for GSM Evolution; Core (optical fiber); Graph; Directed graph; Subgraph isomorphism problem; Efficient algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Database; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000135104,0.0002703728,0.0002730285,0.0002173799,0.000321721,0.0002921078,0.0009613929,0.00008023818,0.00002140156],"category_scores_gemma":[0.00008309139,0.0002527359,0.0001580375,0.001446432,0.00005215285,0.001091856,0.00003713881,0.0004112317,0.0001539652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000604772,"about_ca_system_score_gemma":0.00007412403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005961852,"about_ca_topic_score_gemma":0.00009766273,"domain_scores_codex":[0.9977165,0.0002418779,0.0003384375,0.0008226992,0.0004673103,0.0004131305],"domain_scores_gemma":[0.9959985,0.0007171803,0.000094783,0.002922626,0.0001005935,0.0001663333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000665136,0.005987893,0.0008496029,0.0008463941,0.001439275,0.007877939,0.000962532,0.3689574,0.05521684,0.3702691,0.0332395,0.1536884],"study_design_scores_gemma":[0.01629252,0.003550137,0.007492193,0.009009319,0.0007463642,0.006353679,0.00149073,0.44467,0.3023508,0.02766387,0.1675467,0.01283359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01205493,0.0003647961,0.9830376,0.0004625204,0.002549055,0.000261556,0.0003129155,0.0006407591,0.0003158986],"genre_scores_gemma":[0.985059,0.0002131761,0.01248608,0.0004591162,0.00009013635,0.0001046336,0.00011672,0.00003516102,0.001435976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9730041,"threshold_uncertainty_score":0.9999925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01990446779099111,"score_gpt":0.2521827545106705,"score_spread":0.2322782867196793,"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."}}