{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002531888,0.001817312,0.002175238,0.005323214,0.001790802,0.002454726,0.003381835,0.002139315,0.003285509],"category_scores_gemma":[0.01699894,0.001310837,0.001806253,0.008397704,0.001910776,0.006331075,0.003670482,0.002197367,0.001513414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002419546,"about_ca_system_score_gemma":0.003373355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01427237,"about_ca_topic_score_gemma":0.02054987,"domain_scores_codex":[0.9964361,0.0008633066,0.000181354,0.001227121,0.0009943385,0.0002977465],"domain_scores_gemma":[0.9907951,0.004780336,0.0008681868,0.002201963,0.001013846,0.0003405492],"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.000437577,0.0004349783,0.009328983,0.00117219,0.0003538116,0.0006077841,0.0007827538,0.3172434,0.005059159,0.0930625,0.05656396,0.5149528],"study_design_scores_gemma":[0.00007890674,0.00007170536,0.0012896,0.00007865641,0.00007589885,0.0005020746,0.0002982804,0.8021528,0.00298575,0.1767881,0.0156404,0.0000378197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03344009,0.00251983,0.9513903,0.002017594,0.0001599188,0.0004129443,0.002569981,0.003544391,0.003945029],"genre_scores_gemma":[0.1973065,0.001713229,0.7843827,0.0008372274,0.0002764254,0.0003793303,0.009217323,0.0005950376,0.005292333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01427237,"threshold_uncertainty_score":0.02837855,"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."}}