{"id":"W4281779720","doi":"10.1145/3514221.3517837","title":"A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 International Conference on Management of Data","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"University of Hong Kong","keywords":"Scalability; Parameterized complexity; Computer science; Bipartite graph; Approximation algorithm; Linear programming; Matching (statistics); Theoretical computer science; Induced subgraph isomorphism problem; Directed graph; Graph; Mathematical optimization; Algorithm; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002634703,0.0022553,0.002469963,0.001724921,0.0008877677,0.002370255,0.002936391,0.001952813,0.005153056],"category_scores_gemma":[0.008887184,0.001296377,0.001900415,0.003453657,0.001324915,0.003088094,0.002420347,0.004586426,0.001634269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002322013,"about_ca_system_score_gemma":0.003293887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007935644,"about_ca_topic_score_gemma":0.01079811,"domain_scores_codex":[0.9981431,0.0006251662,0.00007987305,0.0004748015,0.0004657024,0.0002114472],"domain_scores_gemma":[0.9956252,0.003008251,0.0002609902,0.0004080803,0.0004978667,0.0001996035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000116842,0.0002763345,0.0008791861,0.0002440211,0.00008142119,0.0001406537,0.0001050065,0.8255715,0.00109994,0.04357922,0.01339097,0.1145149],"study_design_scores_gemma":[0.000007748699,0.00001133752,0.0000389311,0.000007202016,0.000004686598,0.00001955073,0.00001232029,0.9861492,0.0001805167,0.01288751,0.0006776462,0.000003339253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002967764,0.0002326721,0.9941459,0.0003825105,0.00003263751,0.00007145575,0.0001694909,0.0004421232,0.001555485],"genre_scores_gemma":[0.1199138,0.0005025486,0.8728608,0.0005079758,0.0001359103,0.0004978063,0.001486522,0.0004463918,0.003648244],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007935644,"threshold_uncertainty_score":0.01723868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06422309090837273,"score_gpt":0.2962473222413728,"score_spread":0.232024231333,"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."}}